{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:08:10Z","timestamp":1774368490391,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T00:00:00Z","timestamp":1585180800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T00:00:00Z","timestamp":1585180800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s10115-020-01454-3","type":"journal-article","created":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T06:02:46Z","timestamp":1585202566000},"page":"3203-3216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Simple supervised dissimilarity measure: Bolstering iForest-induced similarity with class information without learning"],"prefix":"10.1007","volume":"62","author":[{"given":"Jonathan R.","family":"Wells","sequence":"first","affiliation":[]},{"given":"Sunil","family":"Aryal","sequence":"additional","affiliation":[]},{"given":"Kai Ming","family":"Ting","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,26]]},"reference":[{"key":"1454_CR1","volume-title":"A data-dependent dissimilarity measure: an effective alternative to distance measures","author":"S Aryal","year":"2017","unstructured":"Aryal S (2017) A data-dependent dissimilarity measure: an effective alternative to distance measures. Monash University, Clayton PhD thesis"},{"key":"1454_CR2","unstructured":"Aryal S, Ting KM, Haffari G, Washio T (2014) $$m_p$$-dissimilarity: a data dependent dissimilarity measure. In: Proceedings of the IEEE international conference on data mining, IEEE, pp\u00a0707\u2013712"},{"issue":"2","key":"1454_CR3","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10115-017-1046-0","volume":"53","author":"S Aryal","year":"2017","unstructured":"Aryal S, Ting KM, Washio T, Haffari G (2017) Data-dependent dissimilarity measure: an effective alternative to geometric distance measures. Knowl Inf Syst 53(2):479\u2013506","journal-title":"Knowl Inf Syst"},{"key":"1454_CR4","unstructured":"Breiman L (2000) Some infinity theory for predictor ensembles, Technical Report 577. Statistics Dept, UCB"},{"issue":"1","key":"1454_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"T Cover","year":"1967","unstructured":"Cover T, Hart P (1967) Nearest neighbor pattern classification. IEEE Trans Inf Theory 13(1):21\u201327","journal-title":"IEEE Trans Inf Theory"},{"key":"1454_CR6","unstructured":"Davies A, Ghahramani Z (2014) The random forest kernel and creating other kernels for big data from random partitions. arXiv:1402.4293"},{"key":"1454_CR7","first-page":"1","volume":"7","author":"J Dem\u0161ar","year":"2006","unstructured":"Dem\u0161ar J (2006) Statistical comparisons of classifiers over multiple data sets. J Mach Learn Res 7:1\u201330","journal-title":"J Mach Learn Res"},{"key":"1454_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00234-2","volume-title":"Encyclopedia of distances","author":"MM Deza","year":"2009","unstructured":"Deza MM, Deza E (2009) Encyclopedia of distances. Springer, Berlin"},{"key":"1454_CR9","unstructured":"Dua D, Graff C (2017) UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1","key":"1454_CR10","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The weka data mining software: an update. SIGKDD Explor Newsl 11(1):10\u201318","journal-title":"SIGKDD Explor Newsl"},{"key":"1454_CR11","first-page":"175","volume-title":"Learning vector quantization","author":"T Kohonen","year":"1995","unstructured":"Kohonen T (1995) Learning vector quantization. Springer, Berlin, pp 175\u2013189"},{"issue":"5","key":"1454_CR12","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1037\/0033-295X.85.5.445","volume":"85","author":"CL Krumhansl","year":"1978","unstructured":"Krumhansl CL (1978) Concerning the applicability of geometric models to similarity data: the interrelationship between similarity and spatial density. Psychol Rev 85(5):445\u2013463","journal-title":"Psychol Rev"},{"issue":"4","key":"1454_CR13","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1561\/2200000019","volume":"5","author":"B Kulis","year":"2013","unstructured":"Kulis B (2013) Metric learning: a survey. Found Trends Mach Learn 5(4):287\u2013364","journal-title":"Found Trends Mach Learn"},{"key":"1454_CR14","doi-asserted-by":"crossref","unstructured":"Liu F, Ting KM, Zhou Z-H (2008) Isolation forest. In: Proceedings of the eighth IEEE international conference on data mining, pp 413\u2013422","DOI":"10.1109\/ICDM.2008.17"},{"key":"1454_CR15","unstructured":"Macqueen J (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability, pp 281\u2013297"},{"key":"1454_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.neucom.2014.12.096","volume":"169","author":"D Nebel","year":"2015","unstructured":"Nebel D, Hammer B, Frohberg K, Villmann T (2015) Median variants of learning vector quantization for learning of dissimilarity data. Neurocomputing 169:295\u2013305","journal-title":"Neurocomputing"},{"issue":"1","key":"1454_CR17","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn 1(1):81\u2013106","journal-title":"Mach Learn"},{"issue":"379\u2013423","key":"1454_CR18","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"CE Shannon","year":"1948","unstructured":"Shannon CE (1948) A mathematical theory of communication. Bell Syst Tech J 27(379\u2013423):623\u2013657","journal-title":"Bell Syst Tech J"},{"issue":"1","key":"1454_CR19","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10994-012-5303-x","volume":"90","author":"KM Ting","year":"2013","unstructured":"Ting KM, Zhou G-T, Liu FT, Tan SC (2013) Mass estimation. Mach Learn 90(1):127\u2013160","journal-title":"Mach Learn"},{"issue":"2","key":"1454_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10994-018-5737-x","volume":"108","author":"KM Ting","year":"2019","unstructured":"Ting KM, Zhu Y, Carman M, Zhu Y, Washio T, Zhou Z-H (2019) Lowest probability mass neighbour algorithms: relaxing the metric constraint in distance-based neighbourhood algorithms. Mach Learn 108(2):331\u2013376","journal-title":"Mach Learn"},{"key":"1454_CR21","doi-asserted-by":"crossref","unstructured":"Ting KM, Zhu Y, Carman M, Zhu Y, Zhou Z-H (2016) Overcoming key weaknesses of distance-based neighbourhood methods using a data dependent dissimilarity measure. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining. ACM, New York, NY, USA, pp 1205\u20131214","DOI":"10.1145\/2939672.2939779"},{"key":"1454_CR22","doi-asserted-by":"crossref","unstructured":"Ting KM, Zhu Y, Zhou Z-H (2018) Isolation kernel and its effect on SVM. In: Proceedings of the 24th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp\u00a02329\u20132337","DOI":"10.1145\/3219819.3219990"},{"issue":"4","key":"1454_CR23","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1037\/0033-295X.84.4.327","volume":"84","author":"A Tversky","year":"1977","unstructured":"Tversky A (1977) Features of similarity. Psychol Rev 84(4):327\u2013352","journal-title":"Psychol Rev"},{"issue":"2","key":"1454_CR24","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1007\/s10618-014-0356-z","volume":"29","author":"F Wang","year":"2015","unstructured":"Wang F, Sun J (2015) Survey on distance metric learning and dimensionality reduction in data mining. Data Min Knowl Discov 29(2):534\u2013564","journal-title":"Data Min Knowl Discov"},{"key":"1454_CR25","first-page":"207","volume":"10","author":"KQ Weinberger","year":"2009","unstructured":"Weinberger KQ, Saul LK (2009) Distance metric learning for large margin nearest neighbor classification. J Mach Learn Res 10:207\u2013244","journal-title":"J Mach Learn Res"},{"key":"1454_CR26","unstructured":"Yang L (2006) Distance metric learning: a comprehensive survey, Technical report, Michigan State University"},{"key":"1454_CR27","unstructured":"Zadeh PH, Hosseini R, Sra S (2016) Geometric mean metric learning. In: Proceedings of the 33rd international conference on international conference on machine learning, vol 48, pp\u00a02464\u20132471"},{"key":"1454_CR28","doi-asserted-by":"crossref","unstructured":"Zhu X, Loy CC, Gong S (2014) Constructing robust affinity graphs for spectral clustering. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 1450\u20131457","DOI":"10.1109\/CVPR.2014.188"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01454-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-020-01454-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-020-01454-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,26]],"date-time":"2021-03-26T00:47:03Z","timestamp":1616719623000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-020-01454-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,26]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["1454"],"URL":"https:\/\/doi.org\/10.1007\/s10115-020-01454-3","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,3,26]]},"assertion":[{"value":"4 February 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}