Nearest-neighbor Queries in Probabilistic Graphs
msra(2009)
摘要
Large probabilistic graphs arise in various domains spanning from social networks to biological and communication networks. An important query in these graphs is the k nearest- neighbor query, which involves finding and reporting the k closest nodes to a specific node. This query assumes the existence of a measure of the "proximity" or the "distance" between any two nodes in the graph. To that end, we propose various novel distance functions that extend well known notions of classical graph theory, such as shortest paths and random walks. We argue that many meaningful distance functions are com- putationally intractable to compute exactly. Thus, in order to process nearest-neighbor queries, we resort to Monte Carlo sam- pling and exploit novel graph-transformation ideas and pruning opportunities. In our extensive experimental analysis, we explore the trade-offs of our approximation algorithms and demonstrate that they scale well on real-world probabilistic graphs with tens of millions of edges.
更多查看译文
关键词
technical report
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络