Ranking Information in Networks

Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would like to discover sets of authors with expertise in a wide range of disciplines. We present this ranking task as a Top-K problem; utilize fixed-memory heuristic search; and present performance of both the serial and distributed search algorithms on synthetic and real-world data sets.

• Type: Journal
• Year: 2011
• Where: SBP
• Authors: Tina Eliassi-Rad, Keith Henderson
• Keywords: Applied Computing, Real-world Data Sets, SBP 2011, User-specified Criteria, fixed-memory Heuristic Search