Diversified ranking on large graphs: An optimization viewpoint

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2011, Pages 1028-1036

  Tong, Hanghang ^a   He, Jingrui ^a   Wen, Zhen ^a   Konuru, Ravi ^a   Lin, Ching Yung ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Diversity; Graph mining; Ranking; Scalability

Indexed keywords

ALGORITHMIC ASPECTS; DIVERSITY; GRAPH MINING; HIGH IMPACT; LARGE GRAPHS; MINING TASKS; OPTIMISATIONS; RANKING; RANKING LISTS; TOP-K RANKINGS;

EID: 80052660788     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020573     Document Type: Conference Paper

References (43)

1. C. L. 0001, F. Guo, and C. Faloutsos. Bbm: bayesian browsing model from petabyte-scale data. In KDD, pages 537-546, 2009.
2. D. Agarwal, A. Z. Broder, D. Chakrabarti, D. Diklic, V. Josifovski, and M. Sayyadian. Estimating rates of rare events at multiple resolutions. In KDD, pages 16-25, 2007. (Pubitemid 350229189)
3. A. Angel, S. Chaudhuri, G. Das, and N. Koudas. Ranking objects based on relationships and fixed associations. In EDBT'09, pages 910-921, 2009.
4. L. Backstrom and J. Leskovec. Supervised random walks: predicting and recommending links in social networks. In WSDM, pages 635-644, 2011.
5. A. Broder, R. Kumar, F. Maghoull, P. Raghavan, S. Rajagopalan, R. Stata, A. Tomkins, and J. Wiener. Graph structure in the web: experiments and models. In WWW Conf., 2000.
6. J. G. Carbonell and J. Goldstein. The use of mmr, diversity-based reranking for reordering documents and producing summaries. In SIGIR, pages 335-336, 1998.
7. K. El-Arini, G. Veda, D. Shahaf, and C. Guestrin. Turning down the noise in the blogosphere. In KDD, pages 289-298, 2009.
8. Y. Ge, H. Xiong, A. Tuzhilin, K. Xiao, M. Gruteser, and M. J. Pazzani. An energy-efficient mobile recommender system. In KDD, pages 899-908, 2010.
9. F. Geerts, H. Mannila, and E. Terzi. Relational link-based ranking. In VLDB, pages 552-563, 2004.
10. G. H. Golub and C. F. V. Loan. Matrix Perturbation Theory. The Johns Hopkins University Press, 1996.
11. T. H. Haveliwala. Topic-sensitive pagerank. WWW, pages 517-526, 2002.
12. D. Heckerman, D. M. Chickering, C. Meek, R. Rounthwaite, and C. M. Kadie. Dependency networks for collaborative filtering and data visualization. In UAI, pages 264-273, 2000.
13. U. Kang, C. E. Tsourakakis, and C. Faloutsos. Pegasus: A peta-scale graph mining system. In ICDM, pages 229-238, 2009.
14. G. Karypis and V. Kumar. Multilevel -way hypergraph partitioning. In DAC, pages 343-348, 1999.
15. J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. ACM, 46(5):604-632, 1999.
16. Y. Koren. Collaborative filtering with temporal dynamics. In KDD, pages 447-456, 2009.
17. Y. Koren, S. C. North, and C. Volinsky. Measuring and extracting proximity in networks. In KDD, pages 245-255, 2006. (Pubitemid 44535521)
18. A. Krause and C. Guestrin. Beyond convexity - submodularity in machine learning. In ICML, 2008.
19. T. Lappas, K. Liu, and E. Terzi. Finding a team of experts in social networks. In KDD, pages 467-476, 2009.
20. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. M. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD, pages 420-429, 2007. (Pubitemid 350229228)
21. L. Li, K. Zhou, G.-R. Xue, H. Zha, and Y. Yu. Enhancing diversity, coverage and balance for summarization through structure learning. In WWW, pages 71-80, 2009.
22. P. Li, H. Liu, J. X. Yu, J. He, and X. Du. Fast single-pair simrank computation. In SDM, pages 571-582, 2010.
23. D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In Proc. CIKM, 2003.
24. R. Lichtenwalter, J. T. Lussier, and N. V. Chawla. New perspectives and methods in link prediction. In KDD, pages 243-252, 2010.
25. A. S. Maiya and T. Y. Berger-Wolf. Sampling community structure. In WWW, pages 701-710, 2010.
26. H. Maserrat and J. Pei. Neighbor query friendly compression of social networks. In KDD, pages 533-542, 2010.
27. Q. Mei, J. Guo, and D. R. Radev. Divrank: the interplay of prestige and diversity in information networks. In KDD, pages 1009-1018, 2010.
28. J. Neville, B. Gallagher, and T. Eliassi-Rad. Evaluating statistical tests for within-network classifiers of relational data. In ICDM, pages 397-406, 2009.
29. C. C. Noble and D. J. Cook. Graph-based anomaly detection. In KDD, pages 631-636, 2003.
30. L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. Technical report, Stanford Digital Library Technologies Project, 1998. Paper SIDL-WP-1999-0120 (version of 11/11/1999).
31. R. Pemantle. Vertex reinforced random walk. Prob. Th. and Rel. Fields, pages 117-136, 1992.
32. F. Radlinski, P. N. Bennett, B. Carterette, and T. Joachims. Redundancy, diversity and interdependent document relevance. SIGIR Forum, 43(2):46-52, 2009.
33. P. Sarkar and A. W. Moore. Fast nearest-neighbor search in disk-resident graphs. In KDD, pages 513-522, 2010.
34. V. Satuluri and S. Parthasarathy. Scalable graph clustering using stochastic flows: applications to community discovery. In KDD, pages 737-746, 2009.
35. H. Shan and A. Banerjee. Generalized probabilistic matrix factorizations for collaborative filtering. In ICDM, pages 1025-1030, 2010.
36. C. Tan, J. Tang, J. Sun, Q. Lin, and F. Wang. Social action tracking via noise tolerant time-varying factor graphs. In KDD, pages 1049-1058, 2010.
37. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, pages 613-622, 2006.
38. L. Wu. Social network effects on performance and layoffs: Evidence from the adoption of a social networking tool. Job Market Paper, 2011.
39. D. Xin, J. Han, X. Yan, and H. Cheng. Mining compressed frequent-pattern sets. In VLDB, pages 709-720, 2005. (Pubitemid 43991046)
40. X. Yin, J. Han, and P. S. Yu. Cross-relational clustering with user's guidance. In KDD, pages 344-353, 2005. (Pubitemid 43218296)
41. Y. Yue and T. Joachims. Predicting diverse subsets using structural svms. In ICML, pages 1224-1231, 2008.
42. X. Zhu, A. B. Goldberg, J. V. Gael, and D. Andrzejewski. Improving diversity in ranking using absorbing random walks. In HLT-NAACL, pages 97-104, 2007.
43. C.-N. Ziegler, S. M. McNee, J. A. Konstan, and G. Lausen. Improving recommendation lists through topic diversification. In WWW, pages 22-32, 2005.