Take a look at the new version of this page: [ beta version ]. Tell us what you think.

ABSTRACT

How best to present query search results is an important problem in search engines and information retrieval systems. When a single query retrieves many results, simply showing them as a long list will provide users with poor overview. Nowadays, ranking and clustering query search results have been two useful separate post-processing techniques to organize retrieved documents. In this paper, we proposed a spectral analysis method based on the content similarity networks to integrate the clustering and ranking techniques for improving literature search. The new approach organizes all these search results into categories intelligently and simultaneously rank the results in each category. A variety of theoretical and empirical studies have demonstrated that the presented method performs well in real applications, especially in biomedical literature retrieval. Moreover, any free text information can be analyzed with the new method, i.e., the proposed approach can be applied to various information systems, such as Web search engines and literature search service.

REFERENCES

• 1: Humberto Mossri de Almeida , Marcos André Gonçalves , Marco Cristo , Pável Calado, A combined component approach for finding collection-adapted ranking functions based on genetic programming, Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, July 23-27, 2007, Amsterdam, The Netherlands [doi>10.1145/1277741.1277810]
• 2: E. Bernstam, J. Herskovig, Y. Aphinyaphongs, C. Aliferis, M. Sriram, and W. Hersh. Using citation data to improve retrieval from medline. Journal of the American Medical Informatics Association, 13(1):96--105, Feb. 2006.
• 3: N. Biggs. Algebraic Graph Theory. Cambridge University Press, Springer Verlag, 2nd edition, 2004.
• 4: David Cheng , Ravi Kannan , Santosh Vempala , Grant Wang, A divide-and-merge methodology for clustering, ACM Transactions on Database Systems (TODS), v.31 n.4, p.1499-1525, December 2006 [doi>10.1145/1189769.1189779]
• 5: F. R. K. Chung. Spectral Graph Theory. Amer. Math. Soc. Providence, RI, 1997.
• 6: Chris H. Q. Ding , Xiaofeng He , Hongyuan Zha, A spectral method to separate disconnected and nearly-disconnected web graph components, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.275-280, August 26-29, 2001, San Francisco, California [doi>10.1145/502512.502551]
• 7: E. Estrada and J. A. Rodríguez-Velázquez. Subgraph centrality in complex networks. Physical Review E, 71, 2005.
• 8: M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298--305, 1973.
• 9: M. Fiedler. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal, 23:298--305, 1973.
• 10: A. Gulli. On Two Web IR Boosting Tools: Clustering And Ranking. PhD thesis, University Degli Stud di Pisa, Italy, 2006.
• 11: A. K. Jain , M. N. Murty , P. J. Flynn, Data clustering: a review, ACM Computing Surveys (CSUR), v.31 n.3, p.264-323, Sept. 1999 [doi>10.1145/331499.331504]
• 12: Jon M. Kleinberg, Authoritative sources in a hyperlinked environment, Journal of the ACM (JACM), v.46 n.5, p.604-632, Sept. 1999 [doi>10.1145/324133.324140]
• 13: A. Leuski and J. Allan. Improving interactive retrieval by combining ranked list and clustering. In Proc. of RIAO, pages 665--681, College de France, 2000.
• 14: Wenyuan Li , Wee-Keong Ng , Ying Liu , Kok-Leong Ong, Enhancing the Effectiveness of Clustering with Spectra Analysis, IEEE Transactions on Knowledge and Data Engineering, v.19 n.7, p.887-902, July 2007 [doi>10.1109/TKDE.2007.1066]
• 15: Y. Lin, W. Li, K. Chen, and Y. Liu. A document clustering and ranking system for exploring MEDLINE citations. Journal of the American Medical Informatics Association, 14(5):651--661, Oct. 2007.
• 16: M. Mihail, C. Gkantsidis, and E. Zegura. Spectral analysis of internet topologies. In Proc. of Infocom, 2003.
• 17: M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167--256, 2003.
• 18: M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 2006.
• 19: M. E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E, 74(3), 2006.
• 20: G. Royle and C. Godsil. Algebraic Graph Theory. Springer Verlag, Springer Verlag, 2001.
• 21: Danica Vukadinovic , Polly Huang , Thomas Erlebach, On the Spectrum and Structure of Internet Topology Graphs, Proceedings of the Second International Workshop on Innovative Internet Computing Systems, p.83-95, June 20-22, 2002
• 22: F. Wang, C. Zhang, and T. Li. Clustering of document with local and global regularization. In Proc. of the 30th ACM SIGIR, Amsterdam, Netherlands, July 2007.
• 23: Jun Xu , Hang Li, AdaRank: a boosting algorithm for information retrieval, Proceedings of the 30th annual international ACM SIGIR conference on Research and development in information retrieval, July 23-27, 2007, Amsterdam, The Netherlands [doi>10.1145/1277741.1277809]
• 24: Wei Xu , Xin Liu , Yihong Gong, Document clustering based on non-negative matrix factorization, Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval, July 28-August 01, 2003, Toronto, Canada [doi>10.1145/860435.860485]
• 25: Oren Zamir , Oren Etzioni, Web document clustering: a feasibility demonstration, Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval, p.46-54, August 24-28, 1998, Melbourne, Australia [doi>10.1145/290941.290956]
• 26: Hua-Jun Zeng , Qi-Cai He , Zheng Chen , Wei-Ying Ma , Jinwen Ma, Learning to cluster web search results, Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval, July 25-29, 2004, Sheffield, United Kingdom [doi>10.1145/1008992.1009030]
• 27: Ying Zhao , George Karypis, Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering, Machine Learning, v.55 n.3, p.311-331, June 2004 [doi>10.1023/B:MACH.0000027785.44527.d6]
• 28: Ying Zhao , George Karypis , Usama Fayyad, Hierarchical Clustering Algorithms for Document Datasets, Data Mining and Knowledge Discovery, v.10 n.2, p.141-168, March 2005 [doi>10.1007/s10618-005-0361-3]

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.3 INFORMATION STORAGE AND RETRIEVAL
      H.3.3 Information Search and Retrieval
          Subjects: Clustering

General Terms:
Algorithms, Experimentation, Theory

Keywords:
clustering, query search, ranking, spectral geometry