A graph-theoretic approach to extract storylines from search results
暂无分享,去创建一个
[1] Ravi Kumar,et al. Trawling the Web for Emerging Cyber-Communities , 1999, Comput. Networks.
[2] Santosh S. Vempala,et al. On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[3] Oren Etzioni,et al. Grouper: A Dynamic Clustering Interface to Web Search Results , 1999, Comput. Networks.
[4] Oren Etzioni,et al. Fast and Intuitive Clustering of Web Documents , 1997, KDD.
[5] Vijay V. Vazirani,et al. NP-Completeness of Some Generalizations of the Maximum Matching Problem , 1982, Inf. Process. Lett..
[6] Krishna Bharat,et al. Improved algorithms for topic distillation in a hyperlinked environment , 1998, SIGIR '98.
[7] A. Tomkins,et al. Spectral filtering for resource discovery , 1998 .
[8] Richard A. Harshman,et al. Indexing by Latent Semantic Analysis , 1990, J. Am. Soc. Inf. Sci..
[9] Sergey Brin,et al. The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.
[10] Inderjit S. Dhillon,et al. Information-theoretic co-clustering , 2003, KDD '03.
[11] David R. Karger,et al. Scatter/Gather: a cluster-based approach to browsing large document collections , 1992, SIGIR '92.
[12] Allan Borodin,et al. Link analysis ranking , 2004 .
[13] Naftali Tishby,et al. The information bottleneck method , 2000, ArXiv.