{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:46:42Z","timestamp":1743266802858,"version":"3.37.3"},"reference-count":98,"publisher":"Oxford University Press (OUP)","issue":"3","license":[{"start":{"date-parts":[[2021,11,11]],"date-time":"2021-11-11T00:00:00Z","timestamp":1636588800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,3,15]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this study, a novel record linkage system for E-commerce products is presented. Our system aims to cluster the same products that are crawled from different E-commerce websites into the same cluster. The proposed system achieves a very high success rate by combining both semi-supervised and unsupervised approaches. Unlike the previously proposed systems in the literature, neither a training set nor structured corpora are necessary. The core of the system is based on Hierarchical Agglomerative Clustering (HAC); however, the HAC algorithm is modified to be dynamic such that it can efficiently cluster a stream of incoming new data. Since the proposed system does not depend on any prior data, it can cluster new products. The system uses bag-of-words representation of the product titles, employs a single distance metric, exploits multiple domain-based attributes and does not depend on the characteristics of the natural language used in the product records. To our knowledge, there is no commonly used tool or technique to measure the quality of a clustering task. Therefore in this study, we use ELKI (Environment for Developing KDD-Applications Supported by Index-Structures), an open-source data mining software, for performance measurement of the clustering methods; and show how to use ELKI for this purpose. To evaluate our system, we collect our own dataset and make it publicly available to researchers who study E-commerce product clustering. Our proposed system achieves 96.25% F-Measure according to our experimental analysis. The other state-of-the-art clustering systems obtain the best 89.12% F-Measure.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab179","type":"journal-article","created":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T22:45:50Z","timestamp":1634424350000},"page":"581-602","source":"Crossref","is-referenced-by-count":4,"title":["An Incremental Hierarchical Clustering Based System For Record Linkage In E-Commerce Domain"],"prefix":"10.1093","volume":"66","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9379-2163","authenticated-orcid":false,"given":"Furkan","family":"G\u00f6z\u00fckara","sequence":"first","affiliation":[{"name":"Department of Software Engineering , Faculty of Engineering, , Mersin, Yeni\u015fehir 33140, Turkey"},{"name":"Toros University , Faculty of Engineering, , Mersin, Yeni\u015fehir 33140, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9201-6349","authenticated-orcid":false,"given":"Selma Ay\u015fe","family":"\u00d6zel","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering , Faculty of Engineering, , Adana, Balcal\u0131 Sar\u0131\u00e7am 01330, Turkey"},{"name":"\u00c7ukurova University , Faculty of Engineering, , Adana, Balcal\u0131 Sar\u0131\u00e7am 01330, Turkey"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,11,11]]},"reference":[{"volume-title":"Quarterly Retail E-Commerce Sales","author":"U. C. Bureau","key":"2023031708553995000_"},{"key":"2023031708553995000_","first-page":"178","article-title":"A Survey of the Comparison Shopping Agent-Based Decision Support Systems","volume":"11","author":"Pathak","year":"2010","journal-title":"J. Electron. Commer. Res."},{"key":"2023031708553995000_","first-page":"404","volume-title":"Proc. of the 17th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Kannan","year":"2011"},{"key":"2023031708553995000_","first-page":"17","volume-title":"Proc. of 18th Int. Conf. on Data Engineering","author":"Elfeky","year":"2002"},{"key":"2023031708553995000_","first-page":"137","volume-title":"Proc. of Eighth Int. Conf. on Database Systems for Advanced Applications, 2003.(DASFAA 2003)","author":"Jin","year":"2003"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1109\/ICDM.2006.13","volume-title":"Sixth Int. Conf. on Data Mining (ICDM'06)","author":"Bilenko","year":"2006"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1080\/01621459.1969.10501049","article-title":"A Theory for Record Linkage","volume":"64","author":"Fellegi","year":"1969","journal-title":"J. Am. Stat. Assoc."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"1537","DOI":"10.1109\/TKDE.2011.127","article-title":"A Survey of Indexing Techniques for Scalable Record Linkage and Deduplication","volume":"24","author":"Christen","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1145\/775047.775087","volume-title":"Proc. of the Eighth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Sarawagi","year":"2002"},{"key":"2023031708553995000_","first-page":"73","article-title":"A Comparison of String Metrics for Matching Names and Records","volume":"3","author":"Cohen","year":"2003","journal-title":"Kdd Workshop on Data Cleaning and Object Consolidation"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/276305.276323","article-title":"Integration of Heterogeneous Databases without Common Domains using Queries based on Textual Similarity","volume":"27","author":"Cohen","year":"1998","journal-title":"ACM SIGMOD Record"},{"key":"2023031708553995000_","first-page":"312","volume-title":"Proc. of the 16th Int. Conf. on Data Engineering","author":"Florescuand","year":"2000"},{"key":"2023031708553995000_","first-page":"3","article-title":"Data Cleaning: Problems and Current Approaches","volume":"23","author":"Rahm","year":"2000","journal-title":"IEEE Data Eng. Bull."},{"key":"2023031708553995000_","first-page":"313","volume-title":"Proc. of the 2003 ACM SIGMOD Int. Conf. on Management of Data","author":"Chaudhuri","year":"2003"},{"key":"2023031708553995000_","first-page":"7","volume-title":"Proc. of the KDD-2003 Workshop on Data Cleaning, Record Linkage, and Object Consolidation","author":"Bilenko","year":"2003"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TKDE.2007.250581","article-title":"Duplicate Record Detection: A Survey","volume":"19","author":"Elmagarmid","year":"2007","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2023031708553995000_","article-title":"An Efficient Domain-Independent Algorithm for Detecting Approximately Duplicate Database Records","author":"Monge","year":"1997","journal-title":"Proc. of the SIGMOD"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1145\/956750.956759","volume-title":"Proc. of the Ninth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Bilenko","year":"2003"},{"key":"2023031708553995000_","first-page":"30","volume-title":"Int. Workshop on Challenges in Web Information Retrieval and Integration","author":"Aizawa","year":"2005"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/1217299.1217304","article-title":"Collective Entity Resolution in Relational Data","volume":"1","author":"Bhattacharya","year":"2007","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"2023031708553995000_","first-page":"1565","volume-title":"Proc. of the 18th ACM Conf. on Information and Knowledge Management","author":"Christen","year":"2009"},{"key":"2023031708553995000_","first-page":"219","volume-title":"Proc. of the 2009 ACM SIGMOD Int. Conf. on Management of Data","author":"Whang","year":"2009"},{"key":"2023031708553995000_","first-page":"59","article-title":"A Latent Dirichlet Model for Unsupervised Entity Resolution","volume":"5","author":"Bhattacharya","year":"2006","journal-title":"SDM"},{"key":"2023031708553995000_","first-page":"85","volume-title":"Proc. of the 2005 ACM SIGMOD Int. Conf. on Management of Data","author":"Dong","year":"2005"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/568271.223807","article-title":"The Merge\/Purge Problem for Large Databases","volume":"24","author":"Hern\u00e1ndez","year":"1995","journal-title":"ACM Sigmod Record"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1145\/775047.775099","volume-title":"Proc. of the Eighth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Tejada","year":"2002"},{"key":"2023031708553995000_","first-page":"297","volume-title":"European Conf. on Principles of Data Mining and Knowledge Discovery","author":"Singla","year":"2005"},{"key":"2023031708553995000_","first-page":"862","article-title":"Constraint-Based Entity Matching","author":"Shen","year":"2005","journal-title":"AAAI"},{"key":"2023031708553995000_","first-page":"1401","volume-title":"Advances in Neural Inf. Processing Systems","author":"Pasula","year":"2002"},{"key":"2023031708553995000_","first-page":"169","volume-title":"Proc. of the Sixth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"McCallum","year":"2000"},{"key":"2023031708553995000_","first-page":"255","volume-title":"Proc. of the Sixth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Cohen","year":"2000"},{"key":"2023031708553995000_","article-title":"Robust Reading: Identification and Tracing of Ambiguous Names","author":"Li","year":"2004","journal-title":"DTIC Document"},{"key":"2023031708553995000_","first-page":"185","volume-title":"Proc. of the 7th ACM\/IEEE-CS Joint Conf. on Digital Libraries","author":"Yan","year":"2007"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.datak.2009.10.003","article-title":"Frameworks for Entity Matching: A Comparison","volume":"69","author":"K\u00f6pcke","year":"2010","journal-title":"Data Knowl. Eng."},{"key":"2023031708553995000_","first-page":"802","volume-title":"Proc. of the 2006 ACM SIGMOD Int. Conf. on Management of Data","author":"Koudas","year":"2006"},{"key":"2023031708553995000_","article-title":"Overview of Record Linkage and Current Research Directions","author":"Winkler","year":"2006","journal-title":"Bureau of the Census"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/978-3-642-15838-4_24","volume-title":"Int. Conf. on Privacy in Statistical Databases","author":"Hall","year":"2010"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4614-3223-4_4","volume-title":"Mining Text Data","author":"Aggarwal","year":"2012"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"484","DOI":"10.14778\/1920841.1920904","article-title":"Evaluation of Entity Resolution Approaches on Real-World Match Problems","volume":"3","author":"K\u00f6pcke","year":"2010","journal-title":"Proc. of the VLDB Endowment"},{"key":"2023031708553995000_","first-page":"17","volume-title":"Proc. of the Second Australasian Workshop on Health Data and Knowledge Management-Volume 80","author":"Christen","year":"2008"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1145\/775047.775116","volume-title":"Proc. of the Eighth ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"Cohen","year":"2002"},{"key":"2023031708553995000_","first-page":"259","volume-title":"AMIA Annual Symposium Proceedings","author":"Grannis","year":"2003"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/ICDM.2003.1250972","volume-title":"Third IEEE Int. Conf. on Data Mining, 2003","author":"Hotho","year":"2003"},{"key":"2023031708553995000_","first-page":"59","article-title":"Hierarchical Document Clustering Using Frequent Itemsets","volume":"3","author":"Fung","year":"2003","journal-title":"SDM"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/223784.223812","volume-title":"SIGMOD '95 Proc. of the 1995 ACM SIGMOD Int. Conf. on Management of Data","author":"Faloutsos","year":"1995"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1145\/276305.276326","article-title":"Incremental Distance Join Algorithms for Spatial Databases","volume":"27","author":"Hjaltason","year":"1998","journal-title":"ACM SIGMOD Record"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1008694.1008697","volume-title":"Proc. of the 9th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery","author":"Bhattacharya","year":"2004"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1109\/SIS.2005.1501621","volume-title":"Proc. 2005 IEEE Swarm Intelligence Symposium, 2005. SIS 2005","author":"Cui","year":"2005"},{"volume-title":"Fifth IEEE Int. Conf. on Data Mining (ICDM'05)","year":"2005","author":"Bilenko","key":"2023031708553995000_"},{"key":"2023031708553995000_","first-page":"196","volume-title":"IEEE 23rd Int. Conf. on Data Engineering","author":"Shen","year":"2007"},{"key":"2023031708553995000_","first-page":"496","volume-title":"IEEE 24th Int. Conf. on Data Engineering","author":"Inan","year":"2008"},{"key":"2023031708553995000_","first-page":"506","volume-title":"Springer Series in Statistics","author":"Hastie","year":"2009"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1145\/1739041.1739104","volume-title":"Proc. of the 13th Int. Conf. on Extending Database Technology","author":"Kim","year":"2010"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"208","DOI":"10.14778\/1938545.1938546","article-title":"Large-Scale Collective Entity Matching","volume":"4","author":"Rastogi","year":"2011","journal-title":"Proc. VLDB Endow."},{"key":"2023031708553995000_","first-page":"310","volume-title":"IEEE 11th Int. Conf. on Data Mining","author":"Kannan","year":"2011"},{"key":"2023031708553995000_","first-page":"2104","volume-title":"Proc. of the 21st ACM Int. Conf. on Information and Knowledge Management","author":"B\u00f6hm","year":"2012"},{"key":"2023031708553995000_","first-page":"601","volume-title":"Proc. of the 2014 ACM SIGMOD Int. Conf. on Management of Data","author":"Gokhale","year":"2014"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"2784","DOI":"10.1109\/TKDE.2015.2426714","article-title":"Principled Graph Matching Algorithms for Integrating Multiple Data Sources","volume":"27","author":"Zhang","year":"2015","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2023031708553995000_","first-page":"1","volume-title":"Proc. of the ACL-02 Conf. on Empirical Methods in Natural Language Processing-Volume 10","author":"Collins","year":"2002"},{"key":"2023031708553995000_","first-page":"357","volume-title":"Proc. of the 15th ACM Int. Conf. on Information and Knowledge Management","author":"Sahoo","year":"2006"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1145\/2247596.2247662","volume-title":"Proc. of the 15th Int. Conf. on Extending Database Technology","author":"K\u00f6pcke","year":"2012"},{"key":"2023031708553995000_","first-page":"1299","volume-title":"Proc. of the 23rd Int. Conf. on World Wide Web","author":"Petrovski","year":"2014"},{"key":"2023031708553995000_","first-page":"13","volume-title":"Proc. of the 6th Int. Conf. on Ontology Matching-Volume 814","author":"Isele","year":"2011"},{"volume-title":"WIMS2019: Proc. of the 9th Int. Conf. on Web Intelligence, Mining and Semantics","year":"2019","author":"Primpeli","key":"2023031708553995000_"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"707","DOI":"10.3233\/SW-180300","article-title":"A Machine Learning Approach for Product Matching and Categorization","volume":"9","author":"Ristoski","year":"2018","journal-title":"Semantic Web"},{"volume-title":"Proc. of the 31st Int. Conf. on Machine Learning","year":"2014","author":"Quoc","key":"2023031708553995000_"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10660-019-09371-6","article-title":"Entity Name Recognition of Cross-Border e-Commerce","volume":"20","author":"Luo","year":"2020","journal-title":"Electron. Commer. Res."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/s10791-019-09360-1","article-title":"Deep Cross-Platform Product Matching in e-Commerce","volume":"23","author":"Li","year":"2020","journal-title":"Inf. Retr. J."},{"key":"2023031708553995000_","first-page":"1","article-title":"Focused Web Crawler Development Challenges: Eccrawler","volume":"6","author":"G\u00f6z\u00fckara","year":"2017","journal-title":"Int. J. Comput. Sci. Eng."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/0-387-25465-X_15","volume-title":"Data Mining and Knowledge Discovery Handbook","author":"Rokach","year":"2005"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-28349-8_2","volume-title":"Grouping multidimensional data","author":"Berkhin","year":"2006"},{"volume-title":"MS Thesis, Computer Science and Engineering, The Ohio State University","year":"2010","author":"Sriram","key":"2023031708553995000_"},{"key":"2023031708553995000_","first-page":"161","volume-title":"N-Gram-Based Text Categorization","author":"Cavnar","year":"1994"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/361219.361220","article-title":"A Vector Space Model for Automatic Indexing","volume":"18","author":"Salton","year":"1975","journal-title":"Commun. ACM."},{"key":"2023031708553995000_","first-page":"35","article-title":"Modern Information Retrieval: A Brief Overview","volume":"24","author":"Singhal","year":"2001","journal-title":"IEEE Data Eng. Bull."},{"key":"2023031708553995000_","first-page":"1386","volume-title":"Proc. of the 48th Annual Meeting of the Association for Computational Linguistics","author":"Paltoglou","year":"2010"},{"volume-title":"Discussion of Similarity Metrics, Pearson Correlation Coefficient","year":"2010","author":"Philip","key":"2023031708553995000_"},{"volume-title":"Univ. of Massachusetts Amherst, Computer Science Dept.","year":"22, 2007","author":"Sutton","key":"2023031708553995000_"},{"volume-title":"BrayCurtis.cs","year":"1, 2016","author":"Souza","key":"2023031708553995000_"},{"volume-title":"Hamming distance","year":"15, 2008","author":"Schulz","key":"2023031708553995000_"},{"volume-title":"Similarity and Dissimilarity Measures","year":"28, 2012","author":"Karlsson","key":"2023031708553995000_"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1093\/comjnl\/26.4.354","article-title":"A Survey of Recent Advances in Hierarchical Clustering Algorithms","volume":"26","author":"Murtagh","year":"1983","journal-title":"Comput. J."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1093\/comjnl\/20.4.364","article-title":"An Efficient Algorithm for a Complete Link Method","volume":"20","author":"Defays","year":"1977","journal-title":"Comput. J."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1093\/comjnl\/16.1.30","article-title":"SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method","volume":"16","author":"Sibson","year":"1973","journal-title":"Comput. J."},{"key":"2023031708553995000_","first-page":"1409","article-title":"A Statistical Method for Evaluating Systematic Relationships","volume":"38","author":"Sokal","year":"1958","journal-title":"Univ. Kans. Sci. Bull."},{"volume-title":"Algorithms for Clustering Data","year":"1988","author":"Jain","key":"2023031708553995000_"},{"volume-title":"Ward\u2019s Method","year":"2016","author":"Wiesner","key":"2023031708553995000_"},{"key":"2023031708553995000_","first-page":"1","volume-title":"An Introduction to Information Retrieval Online edition","author":"Manning","year":"2009"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"1976","DOI":"10.14778\/2824032.2824115","article-title":"A Framework for Clustering Uncertain Data","volume":"8","author":"Schubert","year":"2015","journal-title":"Proc. VLDB Endow."},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"972","DOI":"10.1126\/science.1136800","article-title":"Clustering by Passing Messages between Data Points","volume":"315","author":"Frey","year":"2007","journal-title":"Science"},{"key":"2023031708553995000_","first-page":"199","article-title":"Agglomerative Nesting (Program AGNES)","author":"Kaufman","year":"2008","journal-title":"Finding Groups in Data: An Introduction to Cluster Analysis"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least Squares Quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Transactions on Information Theory"},{"key":"2023031708553995000_","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-45643-0_13","article-title":"Acceleration of k-means and Related Clustering Algorithms","author":"Phillips","year":"2002","journal-title":"Workshop on Algorithm Engineering and Experimentation"},{"key":"2023031708553995000_","first-page":"130","volume-title":"Proc. of the 2010 SIAM Int. Conf. on Data Mining","author":"Hamerly","year":"2010"},{"key":"2023031708553995000_","first-page":"147","article-title":"Using the Triangle Inequality to Accelerate k-means","volume":"3","author":"Elkan","year":"2003","journal-title":"ICML"},{"key":"2023031708553995000_","first-page":"368","article-title":"Clustering via Concave Minimization","author":"Bradley","year":"1997","journal-title":"Advances in Neural Information Processing Systems"},{"key":"2023031708553995000_","first-page":"281","article-title":"Some Methods for Classification and Analysis of Multivariate Observations","volume":"1","author":"MacQueen","year":"1967","journal-title":"Proc. of the Fifth Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"2023031708553995000_","first-page":"405","volume-title":"Statistical Data Analysis Based on the L1-Norm and Related Methods","author":"Kaufman","year":"1987"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/3\/581\/49530963\/bxab179.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/3\/581\/49530963\/bxab179.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T01:56:09Z","timestamp":1725933369000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/3\/581\/6425234"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,11]]},"references-count":98,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,11,11]]},"published-print":{"date-parts":[[2023,3,15]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab179","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2023,3]]},"published":{"date-parts":[[2021,11,11]]}}}