Skip to main content

Efficient Navigation in Learning Materials: An Empirical Study on the Linking Process

  • Conference paper
  • First Online:
Artificial Intelligence in Education (AIED 2018)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 10948))

Included in the following conference series:

  • 4908 Accesses

Abstract

We focus on the task of linking topically related segments in a collection of documents. In this scope, an existing corpus of learning materials was annotated with links between its segments. Using this corpus, we evaluate clustering, topic models, and graph-community detection algorithms in an unsupervised approach to the linking task. We propose several schemes to weight the word co-occurrence graph in order to discovery word communities, as well as a method for assigning segments to the discovered communities. Our experimental results indicate that the graph-community approach might BE more suitable for this task.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Source code and annotated corpus available at: https://github.com/pjdrm/SegmentLinkingAVL.

References

  1. Aggarwal, C.C., Reddy, C.K.: Data Clustering. Algorithms and Applications. Chapman & Hall/CRC, Boca Raton (2013)

    Book  Google Scholar 

  2. Blei, D.M.: Probabilistic topic models. Commun. ACM 55(4), 77–84 (2012)

    Article  Google Scholar 

  3. Blondel, V., Guillaume, J., Lambiotte, R., Mech, E.: Fast unfolding of communities in large networks. J. Stat. Mech. Theory Exp. 2008(10), P10008 (2008)

    Article  Google Scholar 

  4. Fortunato, S.: Community detection in graphs. Physics Reports (2010)

    Google Scholar 

  5. Malioutov, I., Barzilay, R.: Minimum cut model for spoken lecture segmentation. In: Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics, pp. 25–32. Association for Computational Linguistics (2006)

    Google Scholar 

  6. Maziero, E., Jorge, M., Pardo, T.: Identifying multi-document relations. In: Proceedings of the International Workshop on NLP and Cognitive Science (2010)

    Google Scholar 

  7. Mihalcea, R., Csomai, A.: Wikify!: Linking documents to encyclopedic knowledge. In: Proceedings of the sixteenth ACM Conference on Conference on Information and Knowledge Management, pp. 233–242. ACM (2007)

    Google Scholar 

  8. Minwoo, J., Ivan, T.: Multi-document topic segmentation. In: Proceedings of the 19th ACM international conference on Information and knowledge management. ACM (2010)

    Google Scholar 

  9. Mota, P., Eskenazi, M., Coheur, L.: Multi-document topic segmentation. In: Proceedings of the 2016 International Workshop on Semantic Multimedia (2016)

    Google Scholar 

  10. Radev, D.R., Jing, H., StyÅ›, M., Tam, D.: Centroid-based summarization of multiple documents. In: Information Processing Management (2004)

    Google Scholar 

  11. Reichardt, J., Bornholdt, S.: Statistical mechanics of community detection. Phys. Rev. E 74(1), 016110 (2006)

    Article  MathSciNet  Google Scholar 

  12. Shahaf, D., Guestrin, C., Horvitz, E.: Trains of thought: generating information maps. In: Proceedings of the 21st International Conference on World Wide Web. ACM (2012)

    Google Scholar 

  13. Sil, D.K., Sengamedu, S.H., Bhattacharyya, C.: Supervised matching of comments with news article segments. In: Proceedings of the 20th ACM International Conference on Information and Knowledge Management. ACM (2011)

    Google Scholar 

  14. Vinh, N.X., Epps, J., Bailey, J.: Information theoretic measures for clusterings comparison: is a correction for chance necessary? In: Proceedings of ICML (2009)

    Google Scholar 

  15. Ward, N.G., Werner, S.D., Novick, D.G., Shriberg, E.E., Oertel, C., Kawahara, T.: The similar segments in social speech task (2013)

    Google Scholar 

  16. Yang, J., Leskovec, J.: Overlapping community detection at scale: a nonnegative matrix factorization approach. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining. ACM (2013)

    Google Scholar 

Download references

Acknowledgements

This work was supported by national funds through Fundação para a Ciência e a Tecnologia (FCT) with reference UID/CEC/50021/2013; also under projects LAW-TRAIN (H2020-EU.3.7, contract 653587), and INSIDE (CMUP-ERI/HCI/0051/2013), and also through the Carnegie Mellon Portugal Program under Grant SFRH/BD/51917/2012.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Pedro Mota .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Mota, P., Coheur, L., Eskenazi, M. (2018). Efficient Navigation in Learning Materials: An Empirical Study on the Linking Process. In: Penstein Rosé, C., et al. Artificial Intelligence in Education. AIED 2018. Lecture Notes in Computer Science(), vol 10948. Springer, Cham. https://doi.org/10.1007/978-3-319-93846-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-93846-2_42

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-93845-5

  • Online ISBN: 978-3-319-93846-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics