Filters








7 Hits in 3.2 sec

Probesim

Yu Liu, Bolong Zheng, Xiaodong He, Zhewei Wei, Xiaokui Xiao, Kai Zheng, Jiaheng Lu
2017 Proceedings of the VLDB Endowment  
Single-source and top-k SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection, etc.  ...  This paper presents ProbeSim, an index-free algorithm for single-source and top-k SimRank queries that provides a non-trivial theoretical guarantee in the absolute error of query results.  ...  PROBESIM ALGORITHM In this section, we present ProbeSim, an index-free algorithm for approximate single-source and top-k SimRank queries on large graphs.  ... 
doi:10.14778/3151113.3151115 fatcat:vj47sjztozfvxgyq2p3tocozi4

Cluster Analysis of Stations Based on Weight SimRank in Sharing Bicycle

Bo Guan, Et al.
2021 Converter  
In order to find out the effective small world region of bicycles, we introduced the idea of SimRank (that is, the similarity of a station is due to the similarity of its bicycle source station and destination  ...  Finally, in order to verify the effectiveness of the algorithm, we implemented the station clustering based on SimRank algorithm, and compared the clustering effect with the W-SimRank algorithm proposed  ...  Proposed probesim, an index free unit algorithm and Top-k SimRank query to solve the problem of too long preprocessing time or too much space cost when processing large dynamic graphs.  ... 
doi:10.17762/converter.152 fatcat:6uvhvbestzbfxhkureool23jra

SimRank*: effective and scalable pairwise similarity search based on graph topology

Weiren Yu, Xuemin Lin, Wenjie Zhang, Jian Pei, Julie A. McCann
2019 The VLDB journal  
semantics of SimRank*, and validate its high computational efficiency and scalability on large graphs with billions of edges.  ...  This leads to an iterative form of SimRank*, which requires O(K nm) time and O(n 2 ) memory for computing all (n 2 ) pairs of similarities on a graph of n nodes and m edges for K iterations. (4) To improve  ...  reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.  ... 
doi:10.1007/s00778-018-0536-3 fatcat:gmrmn52mpreibajcxvteab4is4

Picture semantic similarity search based on bipartite network of picture-tag type

Mingxi Zhang, Liuqian Yang, Yipeng Dong, Jinhua Wang, Qinghan Zhang, Haroldo V. Ribeiro
2021 PLoS ONE  
Consequently, we utilize the SimRank algorithm to compute the similarity scores between pictures.  ...  Previous studies mainly focused on the similarities of content, which measures similarities based on visual features, such as color and shape, and few of them pay enough attention to semantics.  ...  ProbeSim [27] assesses similarity without precomputing index structure, so it can support real-time computation of top k queries on a dynamic network.  ... 
doi:10.1371/journal.pone.0259028 pmid:34723985 pmcid:PMC8559930 fatcat:p5obugcwbvblhd7hlbarvrv22y

Efficient Pairwise Penetrating-rank Similarity Retrieval

Weiren Yu, Julie McCann, Chengyuan Zhang
2019 ACM Transactions on the Web  
graphs, are respectively devised for efficient P-Rank computation, which improves the computational time from O(kn 3 ) to O(υn 2 +υ 6 ) for digraphs, and to O(υn 2 ) for undirected graphs, where n is  ...  , with the aim to find out the number of iterations, k, required to guarantee a desired accuracy. (2) A rigorous bound on the condition number of P-Rank is obtained for stability analysis.  ...  This work was supported by the National Natural Science Foundation of China (61972203 and 61702560), Natural Science Foundation of Jiangsu Province (BK20190442), and Natural Science Foundation of Hunan  ... 
doi:10.1145/3368616 fatcat:wercjvjztra4vbcbk4n77scfcy

PRSim: Sublinear Time SimRank Computation on Large Power-Law Graphs [article]

Zhewei Wei, Xiaodong He, Xiaokui Xiao, Sibo Wang, Yu Liu, Xiaoyong Du, Ji-Rong Wen
2019 pre-print
Given a node u in graph G =(V, E), a single-source SimRank query returns the SimRank similarities s(u, v) between node u and each node v ∈ V.  ...  This paper proposes , an algorithm that exploits the structure of graphs to efficiently answer single-source SimRank queries. uses an index of size O(m), where m is the number of edges in the graph, and  ...  ProbeSim. ProbeSim [25] is an index-free algorithm that computes single-source and top-k SimRank queries on large graphs.  ... 
doi:10.1145/3299869.3319873 arXiv:1905.02354v1 fatcat:6masostltzfk3gm3dbeti45unu

Exact Single-Source SimRank Computation on Large Graphs [article]

Hanzhi Wang, Zhewei Wei, Ye Yuan, Xiaoyong Du, Ji-Rong Wen
2020 pre-print
In this paper, we present ExactSim, the first algorithm that computes the exact single-source and top-k SimRank results on large graphs.  ...  In recent years, single-source and top-k SimRank queries have received increasing attention due to their applications in web mining, social network analysis, and spam detection.  ...  Unfortunately, computing ground truths for the single-source and top-k queries on large graphs still remains an open problem.  ... 
doi:10.1145/3318464.3389781 arXiv:2004.03493v1 fatcat:hmnqp5o4krhy5fjrk47hpcbkve