{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:43:25Z","timestamp":1763642605921,"version":"3.37.3"},"reference-count":15,"publisher":"World Scientific Pub Co Pte Ltd","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2019,3]]},"abstract":"<jats:p> Data clustering is the unsupervised classification of a set of objects into groups (clusters), according to their similarities. This can be seen as a form of equilibrium, which is the motivation that led to recent formulations of the data clustering task using game theoretic models. In this context, we propose a novel game-theoretic clustering approach reducing the clustering task to that of searching for a pure Nash equilibrium of a potential game, which corresponds to a stable clustering. Interestingly, the existence and the convergence towards such equilibrium are established, and we experimentally prove that such stability is not always guaranteed by the classical k-means algorithm. We also propose an iterative best-response algorithm for solving this potential clustering game. This algorithm is implemented and tested on several real-world and artificial datasets. Considering most of clustering quality measures, the obtained results are compared to those provided by both the classical k-means and by an hybridization of these two algorithms. <\/jats:p>","DOI":"10.1142\/s0218213019500064","type":"journal-article","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T23:40:14Z","timestamp":1554421214000},"page":"1950006","source":"Crossref","is-referenced-by-count":3,"title":["Solving a Potential Clustering Game"],"prefix":"10.1142","volume":"28","author":[{"given":"Kahina","family":"Bouchama","sequence":"first","affiliation":[{"name":"Research Unit LaMOS, Faculty of Exact Sciences, University of Bejaia 06000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Lallouet","sequence":"additional","affiliation":[{"name":"Huawei Technologies Ltd Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammed Said","family":"Radjef","sequence":"additional","affiliation":[{"name":"Research Unit LaMOS, Faculty of Exact Sciences, University of Bejaia 06000, Algeria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2879-8627","authenticated-orcid":false,"given":"Lakhdar","family":"Sais","sequence":"additional","affiliation":[{"name":"CRIL \u2013 CNRS, University of Artois, Lens, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"p_4","first-page":"25","author":"Berkhin P.","year":"2006","journal-title":"Berlin) ("},{"key":"p_6","doi-asserted-by":"publisher","DOI":"10.1145\/2742345"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.09.008"},{"key":"p_8","doi-asserted-by":"publisher","DOI":"10.1016\/j.geb.2008.02.015"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2012.08.037"},{"key":"p_11","doi-asserted-by":"publisher","DOI":"10.1006\/game.1996.0044"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1006\/game.2001.0877"},{"key":"p_13","doi-asserted-by":"publisher","DOI":"10.1016\/S1574-0005(05)80020-7"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289588"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009745219419"},{"issue":"1","key":"p_19","first-page":"27","volume":"5","author":"Rend\u00f3n E.","year":"2011","journal-title":"International Journal of Computers and Communications"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.9.763"},{"key":"p_25","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.250608"},{"key":"p_28","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2017.06.011"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213019500064","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:43:22Z","timestamp":1565084602000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213019500064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2019,4,4]]},"published-print":{"date-parts":[[2019,3]]}},"alternative-id":["10.1142\/S0218213019500064"],"URL":"https:\/\/doi.org\/10.1142\/s0218213019500064","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"type":"print","value":"0218-2130"},{"type":"electronic","value":"1793-6349"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}