Abstract
A graph-theoretic model for incrementally detecting latent associations among terms in a document corpus is presented. The algorithm is based on an energy model that quantifies similarity in context between pairs of terms. Latent associations that are established in turn contribute to the energy of their respective contexts. The proposed model avoids the polysemy problem where spurious associations across terms in different contexts are established due to the presence of one or more common polysemic terms. The algorithm works in an incremental fashion where energy values are adjusted after each document is added to the corpus. This has the advantage that computation is localized around the set of terms contained in the new document, thus making the algorithm run much faster than conventional matrix computations used for singular value decompositions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bassu, D., Behrens, C.: Distributed LSI: Scalable Concept-based Information Retrieval with High Semantic Resolution. In: Proceedings of the 3rd SIAM International Conference on Data Mining (Text Mining Workshop), San Francisco, CA, May 3 (2003)
Chakrabarti, S.: Mining the web: Discovering knowledge from hypertext data, 1st edn. Elsevier Science, USA (2003)
Deerwester, S., Dumais, S.T., Landauer, T.K., Furnas, G.W., Harshman, R.A.: Indexing by latent semantic analysis. Journal of the Society for Information Science 41(6), 391–407 (1990)
Dumais, S.T.: Enhancing Performance in Latent Semantic Indexing (LSI) Retrieval. Technical Report, Bellcore (1992)
Gorell, G., Webb, B.: Generalized Hebbian Algorithm for Latent Semantic Analysis. In: Proceedings of InterSpeech 2005, Lisbon (2005)
Hoffman, T.: Probabilistic Latent Semantic Analysis. Uncertainty in Artificial Intelligence, UAI 1999, Stockholm (1999)
Kleinberg, J.M.: Authoritative Sources in a Hyperlinked Environment. In: Proceedings of ACM-SIAM Symposium on Discrete Algorithms (1998)
Landauer, T.K., Foltz, P.W., Laham, D.: Introduction to Latent Semantic Analysis. Discourse Processes 25, 259–284 (1998)
Rachakonda, A.R.: Incremental Aggregation of Latent Semantics. Master’s Thesis. International Institute of Information Technology, Bangalore (June 2006)
van Rijsbergen, C.J.: Automatic Text Analysis. In: Information Retrieval, 2nd edn. (1999)
Carnegie Mellon University World Wide Knowledge Base (Web-KB) project as of (February 15, 2006), http://www-2.cs.cmu.edu/~webkb/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rachakonda, A.R., Srinivasa, S. (2006). Incremental Aggregation of Latent Semantics Using a Graph-Based Energy Model. In: Crestani, F., Ferragina, P., Sanderson, M. (eds) String Processing and Information Retrieval. SPIRE 2006. Lecture Notes in Computer Science, vol 4209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11880561_30
Download citation
DOI: https://doi.org/10.1007/11880561_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45774-9
Online ISBN: 978-3-540-45775-6
eBook Packages: Computer ScienceComputer Science (R0)