The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Cross-domain collaboration recommendation
Abstract
Interdisciplinary collaborations have generated huge impact to society. However, it is often hard for researchers to establish such cross-domain collaborations. What are the patterns of cross-domain collaborations? How do those collaborations form? Can we predict this type of collaborations?
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
Granovetter, M. S. (1973) · American Journal of Sociology · doi:10.1086/225469 · Cited by 40,491
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Baeza-Yates, R. A., & Ribeiro-Neto, B. A. (1999) · Cited by 11,505
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
On power-law relationships of the Internet topology
Faloutsos, M., Faloutsos, P., & Faloutsos, C. (1999) · Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/316188.316229 · Cited by 4,196
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Fab: content-based, collaborative recommendation
Balabanović, M., & Shoham, Y. (1997) · Communications of the ACM · doi:10.1145/245108.245124 · Cited by 2,934
ArnetMiner: extraction and mining of academic social networks
Tang, J., Zhang, J., Yao, L., Li, J., Zhang, L., & Su, Z. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1402008 · Cited by 2,231
Self-citationItem-based top-N recommendation algorithms
Deshpande, M., & Karypis, G. (2004) · ACM Transactions on Information Systems · doi:10.1145/963770.963776 · Cited by 2,164
Collaborative topic modeling for recommending scientific articles
Wang, C., & Blei, D. M. (2011) · Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2020408.2020480 · Cited by 1,527
Google news personalization: scalable online collaborative filtering
Das, A. S., Datar, M., Garg, A., & Rajaram, S. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242610 · Cited by 1,511
Predicting positive and negative links in online social networks
Leskovec, J., Huttenlocher, D., & Kleinberg, J. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772756 · Cited by 1,470
Random Walks on Graphs: A Survey
Lovász, L. (2001) · Cited by 1,411
Leskovec, J., & Faloutsos, C. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150479 · Cited by 1,170
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Murphy, K., & Russell, S. (2001) · Sequential Monte Carlo Methods in Practice · doi:10.1007/978-1-4757-3437-9_24 · Cited by 1,157
Referral Web: combining social networks and collaborative filtering
Kautz, H., Selman, B., & Shah, M. (1997) · Communications of the ACM · doi:10.1145/245108.245123 · Cited by 847
Relational learning via latent social dimensions
Tang, L., & Liu, H. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557109 · Cited by 799 · cited 1×
“Researchers have studied various issues in social networks, such as network properties [6, 11] and generation processes [18], link predictions [19, 20, 21, 32] and recommendations [2, 7, 17].”
BackgroundParameter estimation for text analysis
Heinrich, G. (2009) · Cited by 700
New perspectives and methods in link prediction
Lichtenwalter, R. N., Lussier, J. T., & Chawla, N. V. (2010) · Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1835804.1835837 · Cited by 664
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
On social networks and collaborative recommendation
Konstas, I., Stathopoulos, V., & Jose, J. M. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571977 · Cited by 604
Probabilistic author-topic models for information discovery
Steyvers, M., Smyth, P., Rosen-Zvi, M., & Griffiths, T. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014087 · Cited by 572
Formal models for expert finding in enterprise corpora
Balog, K., Azzopardi, L., & de Rijke, M. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148181 · Cited by 553
Microarray Analysis and Tumor Classification
Quackenbush, J. (2006) · New England Journal of Medicine · doi:10.1056/nejmra042342 · Cited by 455
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
Self-citationExpertise modeling for matching papers with reviewers
Mimno, D., & McCallum, A. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281247 · Cited by 257
Expert Finding in a Social Network
Zhang, J., Tang, J., & Li, J. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_106 · Cited by 207
Self-citationCombined regression and ranking
Sculley, D. (2010) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1835804.1835928 · Cited by 149
CollabSeer: a search engine for collaboration discovery
Chen, H., Gou, L., Zhang, X., & Giles, C. L. (2011) · ACM/IEEE Joint Conference on Digital Libraries · doi:10.1145/1998076.1998121 · Cited by 147
Applying Discrete PCA in Data AnalysisPreprint
Buntine, W., & Jakulin, A. (2012) · Repository of the University of Ljubljana (University of Ljubljana) · doi:10.5555/1036843.1036851 · Cited by 118
Multi-topic based Query-oriented Summarization
Tang, J., Yao, L., & Chen, D. (2009) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972795.98 · Cited by 92
Self-citationTopic level expertise search over heterogeneous networks
Tang, J., Zhang, J., Jin, R., Yang, Z., Cai, K., Zhang, L., & Su, Z. (2010) · Machine Learning · doi:10.1007/s10994-010-5212-9 · Cited by 92
Self-citationOn optimization of expertise matching with various constraints
Tang, W., Tang, J., Lei, T., Tan, C., Gao, B., & Li, T. (2011) · Neurocomputing · doi:10.1016/j.neucom.2011.04.039 · Cited by 47
Self-citation
Cited by
A Multi-View Deep Learning Approach for Cross Domain User Modeling in Recommendation Systems
Elkahky, A. M., Song, Y., & He, X. (2015) · Proceedings of the 24th International Conference on World Wide Web · doi:10.1145/2736277.2741667 · Cited by 704
Simplicial closure and higher-order link prediction
Benson, A. R., Abebe, R., Schaub, M. T., Jadbabaie, A., & Kleinberg, J. (2018) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1800683115 · Cited by 548
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
Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation
Wang, H., Zhang, F., Zhao, M., Li, W., Xie, X., & Guo, M. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313411 · Cited by 535
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
Metadata
- Authors
- Tang, J., Wu, S., Sun, J., & Su, H.
- Venue
- Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2012-08-12
- Pages
- 1285-1293
- OpenAlex
- W2127201730
- Cited by
- 292
- References
- 34
- FWCI
- 63.66
- 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.