Skip to main content
SpringerLink
Log in

Search Result Clustering using a Singular Value Decomposition (SVD)

  • Conference paper
Proceedings of the First International Conference on Intelligent Human Computer Interaction

  • 1151 Accesses

Abstract

There are many search engines in the web, but they return along list of search results, ranked by their relevancies to the given query. Web users have to go through the list and examine the titles and (short) snippets sequentially to identify their required results. In this paper we present usage of Singular Value Decomposition (SVD) as a very good solution for search results clustering.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Osinski, S.: Improving Quality of Search Results Clustering with Approximate Matrix Factorisations. ECIR (2006)

    Google Scholar 

  2. Hua-Jun Zeng, Qi-Cai He, Zheng Chen, Wei-Ying Ma, Jinwen Ma: Learning to cluster web search results. SIGIR (2004)

    Google Scholar 

  3. Snasel V., Gajdos P., Abdulla H.D., Polovincak M.: Concept Lattice Reduction by Matrix Decompositions. DCCA (2007)

    Google Scholar 

  4. Snasel V., Gajdos P., Abdulla H.D., Polovincak M.: Behavior of the Concept Lattice Reduction to visualizing data after Using Matrix Decompositions. IEEE Innovations’07, (2007)

    Google Scholar 

  5. Snasel V., Polovincak M., Abdulla H.D., Horak Z.: On Knowledge Structures Reduction, IEEE CISIM (2008)

    Google Scholar 

  6. Snasel V., Polovincak M., Abdulla H.D., Hora kZ.: On Concept Lattices and Implication Bases from Reduced Contexts. ICCS Supplement (2008)

    Google Scholar 

  7. Berry M., Browne M.,: Understanding Search Engines, Mathematical Modelling and Text Retrieval. Siam, (1999)

    Google Scholar 

  8. Berry M., Dumais S., Letsche T.: Computation Methods for Intelligent Information Access. In Proceedings of the 1995 ACM/IEEE Supercomputing Conference (1995)

    Google Scholar 

  9. Larsen R.M.: Lanczos bidiagonalization with partial reorthogonalization. Technical report, University of Aarhus (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Deptt. of Computer Science, VSB-Technical University of Ostrava, Czech

    Hussam Dahwa Abdulla & Vaclav Snasel

Authors
  1. Hussam Dahwa Abdulla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vaclav Snasel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Indian Institute of Information Technology, Allahabad, India

    U. S. Tiwary (Professor), Tanveer J. Siddiqui (Assistant Professor), M. Radhakrishna (Professor) & M. D. Tiwari (Director) (Professor),  (Assistant Professor),  (Professor) &  (Director)

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Indian Institute of Information Technology, India

About this paper

Cite this paper

Abdulla, H.D., Snasel, V. (2009). Search Result Clustering using a Singular Value Decomposition (SVD). In: Tiwary, U.S., Siddiqui, T.J., Radhakrishna, M., Tiwari, M.D. (eds) Proceedings of the First International Conference on Intelligent Human Computer Interaction. Springer, New Delhi. https://doi.org/10.1007/978-81-8489-203-1_33

Download citation

  • DOI: https://doi.org/10.1007/978-81-8489-203-1_33

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-8489-404-2

  • Online ISBN: 978-81-8489-203-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation