{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:41:13Z","timestamp":1730209273704,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/codit.2019.8820298","type":"proceedings-article","created":{"date-parts":[[2019,9,3]],"date-time":"2019-09-03T01:09:32Z","timestamp":1567472972000},"page":"1723-1728","source":"Crossref","is-referenced-by-count":2,"title":["An Improved K-medoids Algorithm Based on Binary Sequences Similarity Measures"],"prefix":"10.1109","author":[{"given":"Fahdah","family":"Alalyan","sequence":"first","affiliation":[]},{"given":"Nuha","family":"Zamzami","sequence":"additional","affiliation":[]},{"given":"Manar","family":"Amayri","sequence":"additional","affiliation":[]},{"given":"Nizar","family":"Bouguila","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"1188","article-title":"Distributed representations of sentences and documents","author":"le","year":"0","journal-title":"International Conference on Machine Learning"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2248000"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(01)00032-2"},{"key":"ref30","first-page":"662","article-title":"Optimizing binary feature vector similarity measure using genetic algorithm and handwritten character recognition","author":"cha","year":"2003","journal-title":"null"},{"key":"ref37","article-title":"description of core experiments for mpeg-7 motion\/shape","volume":"2690","author":"jeannin","year":"1999","journal-title":"MPEG-7 ISO\/IEC\/JTC1\/SC29\/WG11\/MPEG99\/N2690"},{"key":"ref36","first-page":"755","article-title":"Recognition of shapes by editing shock graphs","author":"sebastian","year":"2001","journal-title":"null"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MMSP.2009.5293316"},{"journal-title":"Bow A Toolkit for Statistical Language Modeling Text Retrieval Classification and Clustering","year":"1996","author":"mccallum","key":"ref34"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3844\/jcssp.2010.363.368"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1201\/b15410"},{"journal-title":"Pattern Recognition and Neural Networks","year":"2007","author":"ripley","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2009.07.013"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-005-5316-9"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01307-2_19"},{"key":"ref16","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"1215","author":"agrawal","year":"0","journal-title":"Proc 20th Int Conf Very Large Data Bases"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1143844.1143918"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24958-7_15"},{"key":"ref19","first-page":"577","article-title":"Constrained k-means clustering with background knowledge","volume":"1","author":"wagstaff","year":"2001","journal-title":"ICML"},{"journal-title":"Similarity-based approaches to virtual screening","year":"2003","author":"willett","key":"ref28"},{"journal-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","year":"2006","author":"bishop","key":"ref4"},{"key":"ref27","first-page":"43","article-title":"A survey of binary similarity and distance measures","volume":"8","author":"choi","year":"2010","journal-title":"Journal of Systemics Cybernetics and Informatics"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.42"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1162678.1162679"},{"journal-title":"Enhancing binary feature vector similarity measures","year":"2005","author":"cha","key":"ref29"},{"key":"ref5","first-page":"105","article-title":"Evolving limitations in k-means algorithm in data mining and their removal","volume":"12","author":"singh","year":"2011","journal-title":"International Journal of Computational Engineering & Management"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/882082.882087"},{"journal-title":"Data Mining Concepts and Techniques","year":"2011","author":"han","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICIT.2017.7915506"},{"key":"ref9","first-page":"1758","article-title":"Efficiency of k-means and k-medoids algorithms for clustering arbitrary data points","volume":"3","author":"velmurugan","year":"2012","journal-title":"International Journal of Computer Applications in Technology"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.039"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1111\/j.1469-185X.1982.tb00376.x"},{"key":"ref21","volume":"37","author":"jaccard","year":"0","journal-title":"E comparative study of floral distribution in a portion of the alps and jura"},{"journal-title":"Pha principles of numeric taxonomy","year":"1963","author":"sokal","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.2307\/2255213"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01079031"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1996.545867"}],"event":{"name":"2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)","start":{"date-parts":[[2019,4,23]]},"location":"Paris, France","end":{"date-parts":[[2019,4,26]]}},"container-title":["2019 6th International Conference on Control, Decision and Information Technologies (CoDIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8806019\/8820291\/08820298.pdf?arnumber=8820298","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:21:16Z","timestamp":1658262076000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8820298\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/codit.2019.8820298","relation":{},"subject":[],"published":{"date-parts":[[2019,4]]}}}