Intrinsic Degree: An Estimator Of The Local Growth Rate In Graphs
SIMILARITY SEARCH AND APPLICATIONS, SISAP 2018(2018)
摘要
The neighborhood size of a query node in a graph often grows exponentially with the distance to the node, making a neighborhood search prohibitively expensive even for small distances. Estimating the growth rate of the neighborhood size is therefore an important task in order to determine an appropriate distance for which the number of traversed nodes during the search will be feasible. In this work, we present the intrinsic degree model, which captures the growth rate of exponential functions through the analysis of the infinitesimal vicinity of the origin. We further derive an estimator which allows to apply the intrinsic degree model to graphs. In particular, we can locally estimate the growth rate of the neighborhood size by observing the close neighborhood of some query points in a graph. We evaluate the performance of the estimator through experiments on both artificial and real networks.
更多查看译文
关键词
Intrinsic dimensionality, Graph, Degree, Estimation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络