{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T05:35:56Z","timestamp":1751607356613,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T00:00:00Z","timestamp":1510531200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10796-017-9811-x","type":"journal-article","created":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T07:18:46Z","timestamp":1510557526000},"page":"979-995","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["DPRel: A Meta-Path Based Relevance Measure for Mining Heterogeneous Networks"],"prefix":"10.1007","volume":"21","author":[{"given":"Mukul","family":"Gupta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0075-0197","authenticated-orcid":false,"given":"Pradeep","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Bharat","family":"Bhasker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,13]]},"reference":[{"issue":"17","key":"9811_CR1","doi-asserted-by":"publisher","first-page":"2463","DOI":"10.1093\/bioinformatics\/btr406","volume":"27","author":"U Bodenhofer","year":"2011","unstructured":"Bodenhofer, U., Kothmeier, A., & Hochreiter, S. (2011). APCluster: An R package for affinity propagation clustering. Bioinformatics, 27(17), 2463\u20132464.","journal-title":"Bioinformatics"},{"issue":"3","key":"9811_CR2","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/1961189.1961194","volume":"2","author":"F Bonchi","year":"2011","unstructured":"Bonchi, F., Castillo, C., Gionis, A., & Jaimes, A. (2011). Social network analysis and mining for business applications. ACM Transactions on Intelligent Systems and Technology, 2(3), 22.","journal-title":"ACM Transactions on Intelligent Systems and Technology"},{"issue":"5814","key":"9811_CR3","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1126\/science.1136800","volume":"315","author":"BJ Frey","year":"2007","unstructured":"Frey, B. J., & Dueck, D. (2007). Clustering by passing messages between data points. Science, 315(5814), 972\u2013976.","journal-title":"Science"},{"key":"9811_CR4","volume-title":"Data mining: Concepts and techniques","author":"J Han","year":"2006","unstructured":"Han, J., Kamber, M., & Pei, J. (2006). Data mining: Concepts and techniques. Burlington: Morgan Kaufmann."},{"issue":"4","key":"9811_CR5","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TKDE.2003.1208999","volume":"15","author":"TH Haveliwala","year":"2003","unstructured":"Haveliwala, T. H. (2003). Topic-sensitive pagerank: A context-sensitive ranking algorithm for web search. IEEE Transactions on Knowledge and Data Engineering, 15(4), 784\u2013796.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"3","key":"9811_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/widm.1126","volume":"4","author":"Y Huang","year":"2014","unstructured":"Huang, Y., & Gao, X. (2014). Clustering on heterogeneous networks. Wiley Interdisciplinary Reviews. Data Mining and Knowledge Discovery, 4(3), 213\u2013233.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9811_CR7","unstructured":"Jeh, G., & Widom, J. (2002). SimRank: A measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 538\u2013543). New York: ACM."},{"key":"9811_CR8","unstructured":"Ji, M., Sun, Y., Danilevsky, M., Han, J., & Gao, J. (2010). Graph regularized transductive classification on heterogeneous information networks. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 570\u2013586). Berlin, Heidelberg: Springer."},{"issue":"1","key":"9811_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10994-010-5205-8","volume":"81","author":"N Lao","year":"2010","unstructured":"Lao, N., & Cohen, W. W. (2010). Relational retrieval using a combination of path-constrained random walks. Machine Learning, 81(1), 53\u201367.","journal-title":"Machine Learning"},{"issue":"2","key":"9811_CR10","first-page":"918","volume":"1","author":"W Liang","year":"2006","unstructured":"Liang, W., & Yokota, H. (2006). SLAX: An improved leaf-clustering based approximate XML join algorithm for integrating XML data at subtree classes. Information and Media Technologies, 1(2), 918\u2013928.","journal-title":"Information and Media Technologies"},{"key":"9811_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C. D., Raghavan, P., & Sch\u00fctze, H. (2008). Introduction to information retrieval. Cambridge: Cambridge university press."},{"key":"9811_CR12","unstructured":"Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The PageRank citation ranking: Bringing order to the web. Stanford InfoLab. Available at: http:\/\/infolab.stanford.edu\/~backrub\/pageranksub.ps . Accessed 19 Jul 2017."},{"issue":"10","key":"9811_CR13","first-page":"2479","volume":"26","author":"C Shi","year":"2014","unstructured":"Shi, C., Kong, X., Huang, Y., Philip, S. Y., & Wu, B. (2014). HeteSim: A general framework for relevance measure in heterogeneous networks. IEEE Transactions on Knowledge & Data. Engineering, 26(10), 2479\u20132492.","journal-title":"Engineering"},{"issue":"2","key":"9811_CR14","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2481244.2481248","volume":"14","author":"Y Sun","year":"2013","unstructured":"Sun, Y., & Han, J. (2013). Mining heterogeneous information networks: A structural analysis approach. ACM SIGKDD Explorations Newsletter, 14(2), 20\u201328.","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"9811_CR15","doi-asserted-by":"crossref","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P. S., & Wu, T. (2011). PathSim: Meta path-based top-K similarity search in heterogeneous information networks. In Proceedings of the VLDB Endowment, 4(11), 992\u20131003.","DOI":"10.14778\/3402707.3402736"},{"issue":"2","key":"9811_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10994-010-5212-9","volume":"82","author":"J Tang","year":"2011","unstructured":"Tang, J., Zhang, J., Jin, R., Yang, Z., Cai, K., Zhang, L., & Su, Z. (2011). Topic level expertise search over heterogeneous networks. Machine Learning, 82(2), 211\u2013237.","journal-title":"Machine Learning"},{"key":"9811_CR17","unstructured":"Theodoridis, S., Koutroumbas, K. (2009). Pattern Recognition, 4th Edn. New Delhi: Academic Press."},{"issue":"4","key":"9811_CR18","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10796-013-9436-7","volume":"15","author":"WF Tung","year":"2013","unstructured":"Tung, W. F., & Lee, T. Y. (2013). Rank-mediated collaborative tagging recommendation service using video-tag relationship prediction. Information Systems Frontiers, 15(4), 627\u2013635.","journal-title":"Information Systems Frontiers"},{"key":"9811_CR19","doi-asserted-by":"crossref","unstructured":"Viyanon, W., & Madria, S. K. (2009a). A system for detecting xml similarity in content and structure using relational database. In Proceedings of the 18th ACM conference on Information and knowledge management (pp. 1197\u20131206). ACM.","DOI":"10.1145\/1645953.1646105"},{"key":"9811_CR20","doi-asserted-by":"crossref","unstructured":"Viyanon, W., & Madria, S. K. (2009b). XML-SIM: Structure and content semantic similarity detection using keys. In OTM Confederated International Conferences On the Move to Meaningful Internet Systems (pp. 1183\u20131200). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-05151-7_31"},{"issue":"1","key":"9811_CR21","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1077464.1077466","volume":"1","author":"R Yuster","year":"2005","unstructured":"Yuster, R., & Zwick, U. (2005). Fast sparse matrix multiplication. ACM Transactions on Algorithms (TALG), 1(1), 2\u201313.","journal-title":"ACM Transactions on Algorithms (TALG)"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-017-9811-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-017-9811-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-017-9811-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T18:32:19Z","timestamp":1603305139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-017-9811-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,13]]},"references-count":21,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9811"],"URL":"https:\/\/doi.org\/10.1007\/s10796-017-9811-x","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"type":"print","value":"1387-3326"},{"type":"electronic","value":"1572-9419"}],"subject":[],"published":{"date-parts":[[2017,11,13]]},"assertion":[{"value":"13 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}