The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
SimRank: a measure of structural-context similarity
Abstract
The problem of measuring "similarity" of objects arises in many applications, and many domain-specific measures have been developed, e.g., matching text across documents or computing overlap among item-sets. We propose a complementary approach, applicable in any domain with object-to-object relationships, that measures similarity of the structural context in which objects occur, based on their relationships with other objects. Effectively, we compute a measure that says "two objects are similar if they are related to similar objects:" This general similarity measure, called SimRank, is based on a simple and intuitive graph-theoretic model. For a given domain, SimRank can be combined with other domain-specific similarity measures. We suggest techniques for efficient computation of SimRank scores, and provide experimental results on two application domains showing the computational feasibility and effectiveness of our approach.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1999) · Cited by 12,854
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Co‐citation in the scientific literature: A new measure of the relationship between two documents
Small, H. (1973) · Journal of the American Society for Information Science · doi:10.1002/asi.4630240406 · Cited by 5,345
Empirical Analysis of Predictive Algorithms for Collaborative Filtering
Breese, J. S., Heckerman, D. E., & Kadie, C. M. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.7363 · Cited by 4,772
Using collaborative filtering to weave an information tapestry
Goldberg, D., Nichols, D., Oki, B. M., & Terry, D. (1992) · Communications of the ACM · doi:10.1145/138859.138867 · Cited by 4,066
Bibliographic coupling between scientific papers
Kessler, M. M. (1963) · American Documentation · doi:10.1002/asi.5090140103 · Cited by 2,855
Social information filtering: algorithms for automating “word of mouth”
Shardanand, U., & Maes, P. (1995) · Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '95 · doi:10.1145/223904.223931 · Cited by 2,823
GroupLens: applying collaborative filtering to Usenet news
Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., & Riedl, J. (1997) · Communications of the ACM · doi:10.1145/245108.245126 · Cited by 2,367
Authoritative sources in a hyperlinked environment
Kleinberg, J. M. (1998) · Symposium on Discrete Algorithms · doi:10.5555/314613.315045 · Cited by 1,814
Cited by
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Link prediction in complex networks: A survey
Lü, L., & Zhou, T. (2011) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2010.11.027 · Cited by 2,819
Newman, M. (2018) · doi:10.1093/oso/9780198805090.001.0001 · Cited by 2,297
Rajaraman, A., & Ullman, J. D. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9781139058452 · Cited by 2,262
PathSim: meta path-based top-K similarity search in heterogeneous information networks
Sun, Y., Han, J., Yan, X., Yu, P. S., & Wu, T. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402736 · Cited by 1,870
The link prediction problem for social networks
Liben-Nowell, D., & Kleinberg, J. (2003) · Proceedings of the twelfth international conference on Information and knowledge management · doi:10.1145/956863.956972 · Cited by 1,612
Graph based anomaly detection and description: a survey
Akoglu, L., Tong, H., & Koutra, D. (2015) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-014-0365-y · Cited by 1,504
“Another graph proximity measure that quantifies the closeness of two nodes in the graph is SimRank [Jeh and Widom, 2002], which computes similarity of the structural context in which the graph objects occur, based on their relationships with other objects.”
BackgroundMethodInfluentialAsymmetric Transitivity Preserving Graph Embedding
Ou, M., Cui, P., Pei, J., Zhang, Z., & Zhu, W. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939751 · Cited by 1,248
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · Proceedings of the twelfth international conference on World Wide Web - WWW '03 · doi:10.1145/775152.775191 · Cited by 1,195
“To formalize the relationship among hub vectors, we relate the personalized PageRank scores represented by PPV’s to inverse P-distances in the web graph, a concept based on expected-f distances as introduced in [8].”
MethodSelf-citationFast Random Walk with Restart and Its Applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2006) · Sixth International Conference on Data Mining (ICDM'06) · doi:10.1109/icdm.2006.70 · Cited by 1,184
A survey of heterogeneous information network analysis
Shi, C., Li, Y., Zhang, J., Sun, Y., & Yu, P. S. (2017) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2016.2598561 · Cited by 1,112
Lü, L., Medo, M., Yeung, C. H., Zhang, Y.-C., Zhang, Z.-K., & Zhou, T. (2012) · Physics Reports · doi:10.1016/j.physrep.2012.02.006 · Cited by 995
Getoor, L., & Diehl, C. P. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117456 · Cited by 973
Graph clustering based on structural/attribute similarities
Zhou, Y., Cheng, H., & Yu, J. X. (2009) · Proceedings of the VLDB Endowment · doi:10.14778/1687627.1687709 · Cited by 863
GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training
Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403168 · Cited by 777
Personalized entity recommendation: a heterogeneous information network approach
Yu, X., Ren, X., Sun, Y., Gu, Q., Sturt, B., Khandelwal, U., Norick, B., & Han, J. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556259 · Cited by 714
A Survey of Link Prediction in Complex Networks
Martínez, V., Berzal, F., & Cubero, J.-C. (2017) · ACM Computing Surveys · doi:10.1145/3012704 · Cited by 695
Truth Discovery with Multiple Conflicting Information Providers on the Web
Yin, X., Han, J., & Yu, P. S. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190745 · Cited by 648
Gleich, D. F. (2015) · SIAM Review · doi:10.1137/140976649 · Cited by 646
Link prediction based on local random walk
Liu, W., & Lü, L. (2010) · EPL (Europhysics Letters) · doi:10.1209/0295-5075/89/58007 · Cited by 572
A Survey of Link Prediction in Social Networks
Hasan, M. A., & Zaki, M. J. (2011) · Social Network Data Analytics · doi:10.1007/978-1-4419-8462-3_9 · Cited by 566
Handwritten Optical Character Recognition (OCR): A Comprehensive Systematic Literature Review (SLR)
Memon, J., Sami, M., Khan, R. A., & Uddin, M. (2020) · IEEE Access · doi:10.1109/access.2020.3012542 · Cited by 556
Link prediction in social networks: the state-of-the-art
Wang, P., Xu, B., Wu, Y., & Zhou, X. (2015) · Science China Information Sciences · doi:10.1007/s11432-014-5237-y · Cited by 548
Optimizing web search using social annotations
Bao, S., Xue, G., Wu, X., Yu, Y., Fei, B., & Su, Z. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242640 · Cited by 546
Link prediction techniques, applications, and performance: A survey
Kumar, A., Singh, S. S., Singh, K., & Biswas, B. (2020) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2020.124289 · Cited by 516
Ranking-based clustering of heterogeneous information networks with star network schema
Sun, Y., Yu, Y., & Han, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557107 · Cited by 513
A Survey on PageRank Computing
Berkhin, P. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129098 · Cited by 474
Mining Heterogeneous Information Networks: Principles and Methodologies
Sun, Y., & Han, J. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00433ed1v01y201207dmk005 · Cited by 471
A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching
Blondel, V. D., Gajardo, A., Heymans, M., Senellart, P., & Van Dooren, P. (2004) · SIAM Review · doi:10.1137/s0036144502415960 · Cited by 423
Random walk with restart: fast solutions and applications
Tong, H., Faloutsos, C., & Pan, J.-Y. (2008) · Knowledge and Information Systems · doi:10.1007/s10115-007-0094-2 · Cited by 384
RankClus: integrating clustering with ranking for heterogeneous information network analysis
Sun, Y., Han, J., Zhao, P., Yin, Z., Cheng, H., & Wu, T. (2009) · Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology · doi:10.1145/1516360.1516426 · Cited by 382
Exploiting hierarchical domain structure to compute similarity
Ganesan, P., Garcia-Molina, H., & Widom, J. (2003) · ACM Transactions on Information Systems · doi:10.1145/635484.635487 · Cited by 361
Self-citationHeteSim: A General Framework for Relevance Measure in Heterogeneous Networks
Shi, C., Kong, X., Huang, Y., S. Yu, P., & Wu, B. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.2297920 · Cited by 350
Quantifying controversy on social media
Garimella, K., Morales, G. D. F., Gionis, A., & Mathioudakis, M. (2018) · ACM Transactions on Social Computing · doi:10.1145/3140565 · Cited by 472
Knowledge transfer via multiple model local structure mapping
Gao, J., Fan, W., Jiang, J., & Han, J. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401928 · Cited by 330
Efficient semi-streaming algorithms for local triangle counting in massive graphs
Becchetti, L., Boldi, P., Castillo, C., & Gionis, A. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401898 · Cited by 319
A Co-Saliency Model of Image Pairs
Li, H., & Ngan, K. N. (2011) · IEEE Transactions on Image Processing · doi:10.1109/tip.2011.2156803 · Cited by 319
Neighborhood Formation and Anomaly Detection in Bipartite Graphs
Sun, J., Qu, H., Chakrabarti, D., & Faloutsos, C. (2006) · Fifth IEEE International Conference on Data Mining (ICDM'05) · doi:10.1109/icdm.2005.103 · Cited by 308
VERSE: Versatile Graph Embeddings from Similarity Measures
Tsitsulin, A., Mottin, D., Karras, P., & Müller, E. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186120 · Cited by 277
Center-piece subgraphs: problem definition and fast solutions
Tong, H., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150448 · Cited by 264
Link Prediction Based on Graph Neural Networks
Zhang, M., & Chen, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.09691 · Cited by 263
Survey on web spam detection: principles and algorithms
Spirin, N., & Han, J. (2012) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2207243.2207252 · Cited by 252
ProjE: Embedding Projection for Knowledge Graph Completion
Shi, B., & Weninger, T. (2017) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v31i1.10677 · Cited by 218
Quantifying Controversy in Social Media
Garimella, K., De Francisci Morales, G., Gionis, A., & Mathioudakis, M. (2016) · Proceedings of the Ninth ACM International Conference on Web Search and Data Mining · doi:10.1145/2835776.2835792 · Cited by 147
“We explore the use of the all pairs expected hitting time computed using sim rank [18].”
MethodKang, U., Tong, H., & Sun, J. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.71 · Cited by 127
Li, Z. (., Fang, X., & Sheng, O. R. L. (2018) · ACM Transactions on Management Information Systems · doi:10.1145/3131782 · Cited by 65
Big graphs: challenges and opportunities
Fan, W. (2022) · Proceedings of the VLDB Endowment · doi:10.14778/3554821.3554899 · Cited by 19
Xiao, F., Chen, S., Yang, J., He, H., Jiang, X., Tan, X., & Jin, D. (2025) · Computers & Security · doi:10.1016/j.cose.2024.104180 · Cited by 17
Quantifying Controversy in Social Media
Garimella, K., Morales, G. D. F., Gionis, A., & Mathioudakis, M. (2015) · arXiv · Cited by 7
Metadata
- Authors
- Jeh, G., & Widom, J.
- Venue
- Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2002-07-23
- Pages
- 538-543
- OpenAlex
- W2117831564
- Cited by
- 1,925
- References
- 17
- FWCI
- 8.45
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.