NDLI: Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains

Content Provider	IEEE Xplore Digital Library
Author	Weiren Yu Xuemin Lin Wenjie Zhang McCann, J.A.
Copyright Year	1989
Abstract	SimRank is a powerful model for assessing vertex-pair similarities in a graph. It follows the concept that two vertices are similar if they are referenced by similar vertices. The prior work [18] exploits partial sums memoization to compute SimRank in O(Kmn) time on a graph of n vertices and m edges, for K iterations. However, computations among different partial sums may have redundancy. Besides, to guarantee a given accuracy ε, the existing SimRank needs K = [log C alterations, where C is a damping factor, but the geometric rate of convergence is slow if a high accuracy is expected. In this paper, (1) a novel clustering strategy is proposed to eliminate duplicate computations occurring in partial sums, and an efficient algorithm is then devised to accelerate SimRank computation to O(Kd'n²) time, where d' is typically much smaller than mn. (2) A new differential SimRank equation is proposed, which can represent the SimRank matrix as an exponential sum of transition matrices, as opposed to the geometric sum of the conventional counterpart. This leads to a further speedup in the convergence rate of SimRank iterations. (3) In bipartite domains, a novel finer-grained partial max clustering method is developed to speed up the computation of the Minimax SimRank variation from O(Kmn) to O(Km'n) time, where m' (≤m) is the number of edges in a reduced graph after edge clustering, which can be typically much smaller than m. Using real and synthetic data, we empirically verify that (1) our approach of partial sums sharing outperforms the best known algorithm by up to one order of magnitude; (2) the revised notion of SimRank further achieves a 5X speedup on large graphs while also fairly preserving the relative order of original SimRank scores; (3) our finer-grained partial max memoization for the Minimax SimRank variation in bipartite domains is 5X-12X faster than the baselines.
Sponsorship	IEEE IEEE Comput. Soc. Tech. Committee on Data Eng IEEE Computer Society
Starting Page	1810
Ending Page	1823
Page Count	14
File Size	998399
File Format	PDF
ISSN	10414347
Volume Number	27
Issue Number	7
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-07-01
Publisher Place	U.S.A.
Access Restriction	One Nation One Subscription (ONOS)
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computational modeling Redundancy Accuracy Convergence Acceleration Optimization Damping hyperlink analysis Structural similarity SimRank
Content Type	Text
Resource Type	Article
Subject	Information Systems Computational Theory and Mathematics Computer Science Applications

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Accuracy estimate and optimization techniques for SimRank computation

Measuring Similarity Based on Link Information: A Comparative Study

Dynamical SimRank search on time-varying networks

GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph Constructions

On Similarity Preserving Feature Selection

Efficient identifications of structural similarities for graphs

A fast and complete algorithm for enumerating pseudo-cliques in large graphs

SketchSort: Fast All Pairs Similarity Search for Large Databases of Molecular Fingerprints.

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains

Similar Documents

Accuracy estimate and optimization techniques for SimRank computation

Measuring Similarity Based on Link Information: A Comparative Study

Dynamical SimRank search on time-varying networks

GoldFinger: Fast & Approximate Jaccard for Efficient KNN Graph Constructions

On Similarity Preserving Feature Selection

Efficient identifications of structural similarities for graphs

A fast and complete algorithm for enumerating pseudo-cliques in large graphs

SketchSort: Fast All Pairs Similarity Search for Large Databases of Molecular Fingerprints.

Minimum paired-dominating set in chordal bipartite graphs and perfect elimination bipartite graphs

Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains