{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:54Z","timestamp":1750306314930,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T00:00:00Z","timestamp":1457049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,3,4]]},"DOI":"10.1145\/2905055.2905112","type":"proceedings-article","created":{"date-parts":[[2016,8,29]],"date-time":"2016-08-29T12:17:16Z","timestamp":1472473036000},"page":"1-5","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Performance Based Analysis of Novel Equilin Clustering"],"prefix":"10.1145","author":[{"given":"A. Joy","family":"Christy","sequence":"first","affiliation":[{"name":"Bishop Heber College (Autonomous), Tiruchirappalli, India"}]},{"given":"S. Hari","family":"Ganesh","sequence":"additional","affiliation":[{"name":"H.H The Rajah's College (Autonomous), Pudukottai, India"}]}],"member":"320","published-online":{"date-parts":[[2016,3,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Jain A.K. and Dubes R.C. 1988. Algorithms for clustering data. Prentice-Hall Inc.. Vancouver   Jain A.K. and Dubes R.C. 1988. Algorithms for clustering data. Prentice-Hall Inc.. Vancouver"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/331499.331504"},{"key":"e_1_3_2_1_3_1","first-page":"79","volume-title":"A review of evolutionary algorithms for data mining","author":"Freitas A.A.","unstructured":"Freitas , A.A. , 2008. A review of evolutionary algorithms for data mining . In Soft Computing for Knowledge Discovery and Data Mining Springer US. pp. 79 -- 111 . Freitas, A.A., 2008. A review of evolutionary algorithms for data mining. In Soft Computing for Knowledge Discovery and Data Mining Springer US. pp. 79--111."},{"key":"e_1_3_2_1_4_1","first-page":"65","volume-title":"NJ:World Scientific.","author":"Gordon A.","unstructured":"Gordon , A. , 1999. Hierarchical classification, Clustering and Classification , NJ:World Scientific. pp. 65 -- 121 . Gordon, A., 1999. Hierarchical classification, Clustering and Classification, NJ:World Scientific. pp. 65--121."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICICA.2014.21"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.05.003"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2015.03.007"},{"key":"e_1_3_2_1_8_1","article-title":"K-means for spherical clusters with large variance in sizes","author":"Fahim A.M.","year":"2008","unstructured":"Fahim , A.M. , Saake , G. , Salem , A.M. , Torkey , F.A. and Ramadan , M.A. , 2008 . K-means for spherical clusters with large variance in sizes . Journal of World Academy of Science, Engineering and Technology. Fahim, A.M., Saake, G., Salem, A.M., Torkey, F.A. and Ramadan, M.A., 2008. K-means for spherical clusters with large variance in sizes. Journal of World Academy of Science, Engineering and Technology.","journal-title":"Journal of World Academy of Science, Engineering and Technology."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1556436"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v050.i10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0218-4885(02)00139-9"},{"key":"e_1_3_2_1_12_1","unstructured":"Baswade A.M. and Nalwade P.S. 2013. Selection of Initial Centroids for k-Means Algorithm.  Baswade A.M. and Nalwade P.S. 2013. Selection of Initial Centroids for k-Means Algorithm."},{"key":"e_1_3_2_1_13_1","first-page":"856","article-title":"August. Feature selection for high-dimensional data: A fast correlation-based filter solution","volume":"3","author":"Yu L.","year":"2003","unstructured":"Yu , L. and Liu , H. , 2003 , August. Feature selection for high-dimensional data: A fast correlation-based filter solution . In ICML Vol. 3 , pp. 856 -- 863 . Yu, L. and Liu, H., 2003, August. Feature selection for high-dimensional data: A fast correlation-based filter solution. In ICML Vol. 3, pp. 856--863.","journal-title":"ICML"},{"key":"e_1_3_2_1_14_1","unstructured":"Kaufman L. and Rousseeuw P.J. 2009. Finding groups in data: an introduction to cluster analysis (Vol. 344). John Wiley & Sons.  Kaufman L. and Rousseeuw P.J. 2009. Finding groups in data: an introduction to cluster analysis (Vol. 344). John Wiley & Sons."}],"event":{"name":"ICTCS '16: Second International Conference on Information and Communication Technology for Competitive Strategies","acronym":"ICTCS '16","location":"Udaipur India"},"container-title":["Proceedings of the Second International Conference on Information and Communication Technology for Competitive Strategies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2905055.2905112","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2905055.2905112","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:03Z","timestamp":1750222443000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2905055.2905112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,4]]},"references-count":14,"alternative-id":["10.1145\/2905055.2905112","10.1145\/2905055"],"URL":"https:\/\/doi.org\/10.1145\/2905055.2905112","relation":{},"subject":[],"published":{"date-parts":[[2016,3,4]]},"assertion":[{"value":"2016-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}