{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:59:41Z","timestamp":1740182381921,"version":"3.37.3"},"reference-count":32,"publisher":"IOP Publishing","issue":"4","license":[{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"vor","delay-in-days":7,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T00:00:00Z","timestamp":1701993600000},"content-version":"tdm","delay-in-days":7,"URL":"https:\/\/iopscience.iop.org\/info\/page\/text-and-data-mining"}],"funder":[{"name":"nstitute of Information & communications Technology Planning & Evaluation","award":["IITP-2023-RS-2023-00254592"],"award-info":[{"award-number":["IITP-2023-RS-2023-00254592"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2022R1F1A1074228"],"award-info":[{"award-number":["NRF-2022R1F1A1074228"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["iopscience.iop.org"],"crossmark-restriction":false},"short-container-title":["Mach. Learn.: Sci. Technol."],"published-print":{"date-parts":[[2023,12,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Metric learning involves learning a metric function for distance measurement, which plays an important role in improving the performance of classification or similarity-based algorithms. Multiple metric learning is essential for efficiently reflecting the local properties between instances, as single metric learning has limitations in reflecting the nonlinear structure of complex datasets. Previous research has proposed a method for learning a smooth metric matrix function through data manifold to address the challenge of independently learning multiple metrics. However, this method uses the basic distance-based clustering algorithm to set the anchor points, which are the basis for local metric learning, and the number of basis metrics is dependent on the user. We propose a new method that can assign sophisticated anchor points by iteratively partitioning to identify mixed clusters of multi-class instances and cluster the most similar class instances together. In an experiment, we demonstrate the reliability of the automatically set parameter by comparison with the distribution of error rates according to the number of basis metrics of the existing algorithm. Furthermore, we show the superior performance of the proposed method over a fixed parameter setting of existing algorithms and confirm the relative classification accuracy superiority through performance comparison with baseline algorithms.<\/jats:p>","DOI":"10.1088\/2632-2153\/ad113b","type":"journal-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T22:31:51Z","timestamp":1701383511000},"page":"045049","update-policy":"https:\/\/doi.org\/10.1088\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameter-free basis allocation for efficient multiple metric learning"],"prefix":"10.1088","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4675-7909","authenticated-orcid":false,"given":"Dongyeon","family":"Kim","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1653-7764","authenticated-orcid":false,"given":"Yejin","family":"Kan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4922-8151","authenticated-orcid":false,"given":"Seungmin","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4664-5325","authenticated-orcid":true,"given":"Gangman","family":"Yi","sequence":"additional","affiliation":[]}],"member":"266","published-online":{"date-parts":[[2023,12,8]]},"reference":[{"key":"mlstad113bbib1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1967.1053964","volume":"13","author":"Cover","year":"1967","journal-title":"IEEE Trans. Inf. Theory"},{"key":"mlstad113bbib2","first-page":"207","volume":"10","author":"Weinberger","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"mlstad113bbib3","first-page":"pp 209","article-title":"Information-theoretic metric learning","author":"Davis","year":"2007"},{"volume":"vol 25","year":"2012","author":"Wang","key":"mlstad113bbib4"},{"volume":"vol 17","year":"2004","author":"Goldberger","key":"mlstad113bbib5"},{"key":"mlstad113bbib6","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.knosys.2016.11.004","volume":"116","author":"Li","year":"2017","journal-title":"Knowl.-Based Syst."},{"key":"mlstad113bbib7","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/j.neucom.2020.08.017","volume":"425","author":"Su\u00e1rez","year":"2021","journal-title":"Neurocomputing"},{"key":"mlstad113bbib8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ins.2022.11.118","volume":"621","author":"Guo","year":"2023","journal-title":"Inf. Sci."},{"key":"mlstad113bbib9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/j.neunet.2018.06.003","volume":"105","author":"Li","year":"2018","journal-title":"Neural Netw."},{"key":"mlstad113bbib10","article-title":"Parameter free large margin nearest neighbor for distance metric learning","volume":"vol 31","author":"Song","year":"2017"},{"key":"mlstad113bbib11","first-page":"pp 308","article-title":"A metric learning perspective of SVM: on the relation of LMNN and SVM","author":"Do","year":"2012"},{"key":"mlstad113bbib12","first-page":"1007","volume":"13","author":"Shen","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"mlstad113bbib13","first-page":"pp 2464","article-title":"Geometric mean metric learning","author":"Zadeh","year":"2016"},{"key":"mlstad113bbib14","doi-asserted-by":"publisher","first-page":"1072","DOI":"10.1109\/TCYB.2018.2881417","volume":"50","author":"Nguyen","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"mlstad113bbib15","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.neucom.2018.12.060","volume":"333","author":"Liu","year":"2019","journal-title":"Neurocomputing"},{"key":"mlstad113bbib16","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.knosys.2018.01.026","volume":"146","author":"Le Capitaine","year":"2018","journal-title":"Knowl.-Based Syst."},{"key":"mlstad113bbib17","first-page":"pp 162","article-title":"Learning local invariant mahalanobis distances","author":"Fetaya","year":"2015"},{"key":"mlstad113bbib18","first-page":"pp 1225","article-title":"Learning instance specific distances using metric propagation","author":"Zhan","year":"2009"},{"key":"mlstad113bbib19","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/TPAMI.2019.2901675","volume":"42","author":"Ye","year":"2019","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"mlstad113bbib20","first-page":"pp 679","article-title":"Large margin local metric learning","volume":"vol 13","author":"Bohn\u00e9","year":"2014"},{"key":"mlstad113bbib21","doi-asserted-by":"publisher","first-page":"2337","DOI":"10.1016\/j.patcog.2013.01.010","volume":"46","author":"Mu","year":"2013","journal-title":"Pattern Recognit."},{"year":"2018","author":"Rajabzadeh","key":"mlstad113bbib22"},{"key":"mlstad113bbib23","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108481","volume":"243","author":"Yuan","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"mlstad113bbib24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.ins.2018.08.055","volume":"471","author":"Nguyen","year":"2019","journal-title":"Inf. Sci."},{"key":"mlstad113bbib25","first-page":"100","volume":"28","author":"Hartigan","year":"1979","journal-title":"J. R. Stat. Soc. C"},{"key":"mlstad113bbib26","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.ins.2017.04.027","volume":"406","author":"Li","year":"2017","journal-title":"Inf. Sci."},{"key":"mlstad113bbib27","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1016\/j.neucom.2016.07.005","volume":"214","author":"Nguyen","year":"2016","journal-title":"Neurocomputing"},{"key":"mlstad113bbib28","doi-asserted-by":"publisher","first-page":"3597","DOI":"10.1007\/s13042-021-01408-3","volume":"12","author":"Guo","year":"2021","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"mlstad113bbib29","first-page":"pp 209","article-title":"Training linear discriminant analysis in linear time 2008","author":"Cai","year":"2008"},{"key":"mlstad113bbib30","first-page":"pp 3298","article-title":"A novel Gaussian mixture model for classification 2019","author":"Wan","year":"2019"},{"volume":"vol 11","year":"1998","author":"Moore","key":"mlstad113bbib31"},{"year":"2023","author":"Kelly","key":"mlstad113bbib32"}],"container-title":["Machine Learning: Science and Technology"],"original-title":[],"link":[{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b","content-type":"text\/html","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"am","intended-application":"similarity-checking"},{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T07:25:30Z","timestamp":1702020330000},"score":1,"resource":{"primary":{"URL":"https:\/\/iopscience.iop.org\/article\/10.1088\/2632-2153\/ad113b"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,1]]},"references-count":32,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2023,12,8]]},"published-print":{"date-parts":[[2023,12,1]]}},"URL":"https:\/\/doi.org\/10.1088\/2632-2153\/ad113b","relation":{},"ISSN":["2632-2153"],"issn-type":[{"type":"electronic","value":"2632-2153"}],"subject":[],"published":{"date-parts":[[2023,12,1]]},"assertion":[{"value":"Parameter-free basis allocation for efficient multiple metric learning","name":"article_title","label":"Article Title"},{"value":"Machine Learning: Science and Technology","name":"journal_title","label":"Journal Title"},{"value":"paper","name":"article_type","label":"Article Type"},{"value":"\u00a9 2023 The Author(s). Published by IOP Publishing Ltd","name":"copyright_information","label":"Copyright Information"},{"value":"2023-09-18","name":"date_received","label":"Date Received","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2023-11-30","name":"date_accepted","label":"Date Accepted","group":{"name":"publication_dates","label":"Publication dates"}},{"value":"2023-12-08","name":"date_epub","label":"Online publication date","group":{"name":"publication_dates","label":"Publication dates"}}]}}