Kernel latent semantic analysis using an information retrieval based kernel

Authors:
Laurence A.F. Park;Kotagiri Ramamohanarao
Affiliations:
The University of Melbourne, Melbourne, Australia;The University of Melbourne, Melbourne, Australia
Venue:
Proceedings of the 18th ACM conference on Information and knowledge management
Year:
2009

Citing 11
Cited 1

Nonlinear component analysis as a kernel eigenvalue problem

Neural Computation
A probabilistic model of information retrieval: development and comparative experiments Part 2

Information Processing and Management: an International Journal
Latent Semantic Kernels

Journal of Intelligent Information Systems
Hybrid Pre-Query Term Expansion using Latent Semantic Analysis

ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
A probabilistic model for Latent Semantic Indexing: Research Articles

Journal of the American Society for Information Science and Technology
Eigenvalue-based model selection during latent semantic indexing: Research Articles

Journal of the American Society for Information Science and Technology
A framework for understanding latent semantic indexing (LSI) performance

Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
Text similarity: an alternative way to search MEDLINE

Bioinformatics
An analysis of latent semantic term self-correlation

ACM Transactions on Information Systems (TOIS)
Efficient storage and retrieval of probabilistic latent semantic information for information retrieval

The VLDB Journal — The International Journal on Very Large Data Bases
Query expansion using a collection dependent probabilistic latent semantic thesaurus

PAKDD'07 Proceedings of the 11th Pacific-Asia conference on Advances in knowledge discovery and data mining

Trading spaces: on the lore and limitations of latent semantic analysis

ICTIR'11 Proceedings of the Third international conference on Advances in information retrieval theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Hidden term relationships can be found within a document collection using Latent semantic analysis (LSA) and can be used to assist in information retrieval. LSA uses the inner product as its similarity function, which unfortunately introduces bias due to document length and term rarity into the term relationships. In this article, we present the novel kernel based LSA method, which uses separate document and query kernel functions to compute document and query similarities, rather than the inner product. We show that by providing an appropriate kernel function, we are able to provide a better fit of our data and hence produce more effective term relationships.