SVD based Term Suggestion and Ranking System

David F. Gleich, Leonid Zhukov

Abstract

In this paper, we consider the application of the singular value decomposition (SVD) to a search term suggestion system in a pay-for-performance search market. We propose a positive and negative refinement method based on orthogonal subspace projections. We demonstrate that SVD subspace-based methods: 1) expand coverage by reordering the results, and 2) enhance the clustered structure of the data. The numerical experiments reported in this paper were performed on Overture's pay-per-performance search market data.
BibTeX
@inproceedings{gleich2004svd,
  author = {David F. Gleich and Leonid Zhukov},
  title = {{SVD based Term Suggestion and Ranking System}},
  booktitle = {ICDM},
  year = {2004},
  doi = {10.1109/icdm.2004.10006},
}

Loading related content...

Figure