{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:38Z","timestamp":1740169118142,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71671186","71501182","71571185","71690233"],"award-info":[{"award-number":["71671186","71501182","71571185","71690233"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007085","name":"National University of Defense Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007085","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2935089","type":"journal-article","created":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T15:57:15Z","timestamp":1565711835000},"page":"112662-112680","source":"Crossref","is-referenced-by-count":2,"title":["Heterogeneous Graph Based Similarity Measure for Categorical Data Unsupervised Learning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4244-5385","authenticated-orcid":false,"given":"Yanqing","family":"Ye","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2483-2947","authenticated-orcid":false,"given":"Jiang","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0331-7260","authenticated-orcid":false,"given":"Bingfeng","family":"Ge","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kewei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H. Eugene","family":"Stanley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2791525"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2133360.2133361"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-007-9033-z"},{"key":"ref32","first-page":"380","article-title":"Using of Jaccard coefficient for keywords similarity","volume":"1","author":"niwattanakul","year":"2013","journal-title":"Proc Int Multiconf Eng Comput Sci"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.08.039"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.12.001"},{"key":"ref37","article-title":"A note on the triangle inequality for the Jaccard distance","author":"kosub","year":"2016","journal-title":"arXiv 1612 02696"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2013.07.002"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.53"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009769707641"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-015-5542-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1038\/ismej.2011.109"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.53"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.22"},{"key":"ref13","first-page":"296","article-title":"An information-theoretic definition of similarity","author":"lin","year":"1998","journal-title":"Proc 15th Int Conf Mach Learn"},{"journal-title":"UCI Machine Learning Repository","year":"2017","author":"dua","key":"ref14"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","article-title":"PathSim: Meta path-based top-K similarity search in heterogeneous information networks","author":"sun","year":"2011","journal-title":"Proc VLDB Endowment"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2806416.2806528"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2014.6889941"},{"key":"ref19","first-page":"1","article-title":"Context-aware clustering","author":"yuan","year":"2008","journal-title":"Proc IEEE Conf Comput Vis Pattern Recognit"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11116-2_61"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3196826","article-title":"Neural vector spaces for unsupervised information retrieval","volume":"36","author":"van","year":"2018","journal-title":"ACM Trans Inf Syst"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.04.022"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2633573"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2830977"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2436432"},{"key":"ref7","first-page":"1","author":"agresti","year":"2018","journal-title":"An Introduction to Categorical Data Analysis"},{"key":"ref2","first-page":"451","author":"han","year":"2011","journal-title":"Data Mining Concepts and Techniques"},{"key":"ref9","first-page":"491","article-title":"Learning multi-modal similarity","volume":"12","author":"mcfee","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1264-0"},{"key":"ref46","article-title":"Discriminative regression machine: A classifier for high-dimensional data or imbalanced data","author":"peng","year":"2019","journal-title":"arXiv 1904 07496"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2007.03.016"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1111\/j.1471-8286.2006.01657.x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2808532"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3200488"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2063576.2063715"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0039242"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2014.2325872"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2012-13-9-r79"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45372-5_20"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-017-01973-8"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.07.036"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1186\/s40168-015-0072-y"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646025"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08795560.pdf?arnumber=8795560","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:31:59Z","timestamp":1641987119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8795560\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2935089","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}