{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:21:45Z","timestamp":1730208105134,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/cist.2016.7805061","type":"proceedings-article","created":{"date-parts":[[2017,1,5]],"date-time":"2017-01-05T17:19:51Z","timestamp":1483636791000},"page":"300-305","source":"Crossref","is-referenced-by-count":6,"title":["Classification of association rules based on K-means algorithm"],"prefix":"10.1109","author":[{"given":"Azzeddine","family":"Dahbi","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Mouhir","sequence":"additional","affiliation":[]},{"given":"Youssef","family":"Balouki","sequence":"additional","affiliation":[]},{"given":"Taoufiq","family":"Gadi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-60566-404-0.ch002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/5254.889106"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.10.059"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775053"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-60566-404-0.ch003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/2041-1480-5-8"},{"key":"ref16","article-title":"An efficient k-means clustering algorithm","author":"alsabti","year":"1997","journal-title":"Electrical Engineering and Computer Science"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"ref18","first-page":"457","article-title":"CHARM: An efficient algorithm for closed association rule mining","author":"zaki","year":"1999","journal-title":"Proc 2nd SIAM Int Conf Data Mining"},{"key":"ref19","article-title":"Proposition d'une solution au problème d'initialisation cas du k-means","volume":"547","author":"guellil","year":"2007","journal-title":"CEUR Workshop Proc"},{"key":"ref4","first-page":"3","article-title":"Quelques critères pour une mesure de qualité de règles d'association","author":"gras","year":"2004","journal-title":"Mesures de Qualit2 pour la Fouille de Donn2es RNTI-E-1"},{"key":"ref3","first-page":"122","article-title":"Ranking objective interestingness measures with sensitivity values","volume":"24","author":"huynh","year":"2008","journal-title":"Distribution"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30214-8_23"},{"key":"ref5","first-page":"487","article-title":"Mining The Stock Market: Which Measure Is Best ?","author":"gavrilov","year":"2000","journal-title":"ACM SIGKDD"},{"key":"ref8","first-page":"29","article-title":"S EM MDP REF: Algorithm to Filter and Sort Rules using a Semantically based Ontology Technique","author":"mouhir","year":"2015","journal-title":"Proceedings of the 7th International Conference on Management of computational and collective intElligence in Digital EcoSystems - MEDES '15"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213014600112"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/69.553165"},{"key":"ref1","first-page":"487","article-title":"Fast algorithms for mining association rules","volume":"1215","author":"agrawal","year":"1994","journal-title":"Proceeding VLDB '94 Proc 20th Int Conf Very Large Data Bases"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1504\/IJBIDM.2007.016385"},{"key":"ref20","first-page":"1027","article-title":"k-means++: The advantages of careful seeding","volume":"8","author":"arthur","year":"2007","journal-title":"Proc Eighth Ann ACM-SIAM Symp Discrete Algorithms"}],"event":{"name":"2016 4th IEEE International Colloquium on Information Science and Technology (CIST)","start":{"date-parts":[[2016,10,24]]},"location":"Tangier, Morocco","end":{"date-parts":[[2016,10,26]]}},"container-title":["2016 4th IEEE International Colloquium on Information Science and Technology (CiSt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7786012\/7804840\/07805061.pdf?arnumber=7805061","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,1,23]],"date-time":"2017-01-23T20:55:11Z","timestamp":1485204911000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7805061\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cist.2016.7805061","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}