2010 DivRanktheInterplayofPrestigean

• (Mei et al., 2010) ⇒ Qiaozhu Mei, Jian Guo, and Dragomir Radev. (2010). “DivRank: The Interplay of Prestige and Diversity in Information Networks.” In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2010). doi:10.1145/1835804.1835931

Subject Headings:

Cited By

• http://scholar.google.com/scholar?q=%22DivRank%3A+the+interplay+of+prestige+and+diversity+in+information+networks%22+2010
• http://portal.acm.org/citation.cfm?id=1835931&preflayout=flat#citedby

Quotes

Abstract

Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the data items based on their centrality or prestige in the network. Beyond prestige, diversity has been recognized as a crucial objective in ranking, aiming at providing a non-redundant and high coverage piece of information in the top ranked results. Nevertheless, existing network-based ranking approaches either disregard the concern of diversity, or handle it with non-optimized heuristics, usually based on greedy vertex selection.

 We propose a novel ranking algorithm, DivRank, based on a reinforced random walk in an information network. This model automatically balances the prestige and the diversity of the top ranked vertices in a principled way. DivRank not only has a clear optimization explanation, but also well connects to classical models in mathematics and network science. We evaluate DivRank using empirical experiments on three different networks as well as a text summarization task. DivRank outperforms existing network-based ranking methods in terms of enhancing diversity in prestige.

References

,

	Author	volume	Date Value	title	type	journal	titleUrl	doi	note	year
2010 DivRanktheInterplayofPrestigean	Dragomir Radev Qiaozhu Mei Jian Guo			DivRank: The Interplay of Prestige and Diversity in Information Networks		KDD-2010 Proceedings		10.1145/1835804.1835931		2010