Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

SBP
2011
Springer

favoriteEmaildiscussreport

162views Applied Computing» more SBP 2011»

Ranking Information in Networks

13 years 5 months ago

Ranking Information in Networks

Download eliassi.org

Given a network, we are interested in ranking sets of nodes that score highest on user-speciﬁed 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 ﬁxed-memory heuristic search; and present performance of both the serial and distributed search algorithms on synthetic and real-world data sets.

Tina Eliassi-Rad, Keith Henderson

Real-time Traffic

Applied Computing | Real-world Data Sets | SBP 2011 | User-speciﬁed Criteria | ﬁxed-memory Heuristic Search |

claim paper

Related Content

» Information Retrieval in TrustEnhanced Document Networks

» DivRank the interplay of prestige and diversity in information networks

» RankClus integrating clustering with ranking for heterogeneous information network analysi...

» Decayed DivRank capturing relevance diversity and prestige in information networks

» Fast computation of SimRank for static and dynamic information networks

» SNDocRank document ranking based on social networks

» PeerSensitive ObjectRank Valuing Contextual Information in Social Networks

» Predictive Random Graph Ranking on the Web

» Coranking Authors and Documents in a Heterogeneous Network

Post Info
More Details (n/a)

Added	15 May 2011
Updated	15 May 2011
Type	Journal
Year	2011
Where	SBP
Authors	Tina Eliassi-Rad, Keith Henderson

Comments (0)