The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
HeteSim: A General Framework for Relevance Measure in Heterogeneous Networks
Open accessAbstract
Similarity search is an important function in many applications, which usually focuses on measuring the similarity between objects with the same type. However, in many scenarios, we need to measure the relatedness between objects with different types. With the surge of study on heterogeneous networks, the relevance measure on objects with different types becomes increasingly important. In this paper, we study the relevance search problem in heterogeneous networks, where the task is to measure the relatedness of heterogeneous objects (including objects with the same type or different types). A novel measure HeteSim is proposed, which has the following attributes: (1) a uniform measure: it can measure the relatedness of objects with the same or different types in a uniform framework; (2) a path-constrained measure: the relatedness of object pairs are defined based on the search path that connects two objects through following a sequence of node types; (3) a semi-metric measure: HeteSim has some good properties (e.g., self-maximum and symmetric), which are crucial to many data mining tasks. Moreover, we analyze the computation characteristics of HeteSim and propose the corresponding quick computation strategies. Empirical studies show that HeteSim can effectively and efficiently evaluate the relatedness of heterogeneous objects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
(1999) · Cited by 12,854
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
SimRank: a measure of structural-context similarity
Jeh, G., & Widom, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775126 · Cited by 1,925
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
Fouss, F., Pirotte, A., Renders, J.-M., & Saerens, M. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.46 · Cited by 1,265
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
Fast 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
SCAN: a structural clustering algorithm for networks
Xu, X., Yuruk, N., Feng, Z., & Schweiger, T. A. J. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281280 · Cited by 842
Relational retrieval using a combination of path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · Machine Learning · doi:10.1007/s10994-010-5205-8 · Cited by 614
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
Balmin, A., Hristidis, V., & Papakonstantinou, Y. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50051-6 · Cited by 452
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
Towards Scaling Fully Personalized PageRank: Algorithms, Lower Bounds, and Experiments
Fogaras, D., Rácz, B., Csalogány, K., & Sarlós, T. (2005) · Internet Mathematics · doi:10.1080/15427951.2005.10129104 · Cited by 282
Nie, Z., Zhang, Y., Wen, J.-R., & Ma, W. (2005) · International World Wide Web Conference (WWW) · doi:10.1145/1060745.1060828 · Cited by 266
Graph Regularized Transductive Classification on Heterogeneous Information Networks
Ji, M., Sun, Y., Danilevsky, M., Han, J., & Gao, J. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15880-3_42 · Cited by 248
Dynamic personalized pagerank in entity-relation graphs
Chakrabarti, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242650 · Cited by 199
Sun, Y., Norick, B., Han, J., Yan, X., Yu, P. S., & Yu, X. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339738 · Cited by 197
Fast computation of SimRank for static and dynamic information networks
Li, C., Han, J., He, G., Jin, X., Sun, Y., Yu, Y., & Wu, T. (2010) · Proceedings of the 13th International Conference on Extending Database Technology · doi:10.1145/1739041.1739098 · Cited by 173
Accuracy estimate and optimization techniques for SimRank computation
Lizorkin, D., Velikhov, P., Grinev, M., & Turdakov, D. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453904 · Cited by 167
Fast nearest neighbor search in high-dimensional space
Berchtold, S., Ertl, B., Keim, D. A., et al. (2002) · Proceedings - International Conference on Data Engineering · doi:10.1109/icde.1998.655779 · Cited by 155
Scaling personalized web search
Jeh, G., & Widom, J. (2003) · International World Wide Web Conference (WWW) · doi:10.1145/775189.775191 · Cited by 134
Axiomatic ranking of network role similarity
Jin, R., Lee, V. E., & Hong, H. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020561 · Cited by 119
Fast query execution for retrieval models based on path-constrained random walks
Lao, N., & Cohen, W. W. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835916 · Cited by 100
Mining Heterogeneous Information Networks by Exploring the Power of Links
Han, J. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-04747-3_2 · Cited by 89
HeteroMF: recommendation in heterogeneous information networks using context dependent factor models
Jamali, M., & Lakshmanan, L. V. S. (2013) · International World Wide Web Conference (WWW) · doi:10.1145/2488388.2488445 · Cited by 85
The Geodesic Problem in Quasimetric Spaces
Xia, Q. (2009) · Journal of Geometric Analysis · doi:10.1007/s12220-008-9065-4 · Cited by 65
Learning relevance from heterogeneous social network and its application in online targeting
Wang, C., Raina, R., Fong, D. C.-L., Zhou, D. X., Han, J., & Badros, G. J. (2011) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/2009916.2010004 · Cited by 49
Measuring Relatedness Between Scientific Entities in Annotation Datasets
Palma, G., Vidal, M.-E., Haag, E. S., Raschid, L., & Thor, A. (2013) · ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB) · doi:10.1145/2506583.2506651 · Cited by 16
Cited by
Heterogeneous Information Network Embedding for Recommendation
Shi, C., Hu, B., Zhao, W. X., & Yu, P. S. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2833443 · Cited by 1,204
Self-citationA 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
Self-citationLeveraging Meta-path based Context for Top- N Recommendation with A Neural Co-Attention Model
Hu, B., Shi, C., Zhao, W. X., & Yu, P. S. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219965 · Cited by 674
Self-citationMeta-Graph Based Recommendation Fusion over Heterogeneous Information Networks
Zhao, H., Yao, Q., Li, J., Song, Y., & Lee, D. L. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098063 · Cited by 565
A Survey on Heterogeneous Graph Embedding: Methods, Techniques, Applications and Sources
Wang, X., Bo, D., Shi, C., Fan, S., Ye, Y., & Yu, P. S. (2023) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2022.3177455 · Cited by 438
Self-citation
Metadata
- Authors
- Shi, C., Kong, X., Huang, Y., S. Yu, P., & Wu, B.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2014-10
- Volume
- 26
- Issue
- 10
- Pages
- 2479-2492
- ISSN
- 1041-4347 (ISSN-L)
- OpenAlex
- W1967863517
- Cited by
- 350
- References
- 29
- FWCI
- 23.15
- Type
- journal article
- Language
- en
- Open access
- green
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.