Fast top- similarity search in large dynamic attributed networks.

Information Processing & Management(2019)

引用 5|浏览9
暂无评分
摘要
•A similarity search algorithm for attributed networks that combines the structure similarity and the attribute similarity into one single metric.•A single-source path sampling procedure for sampling single source paths, which is efficient and have a theoretic bound on the sample size.•Two dynamic updating schemes for maintaining similarity scores in response to batches of updates of nodes, edges and attributes.•Experimental results show that our proposed method achieves better convergence performance, runs faster than Panther.
更多
查看译文
关键词
Similarity search,Top-k search,Attributed network,Path sampling,Random walk
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要