(Publisher of Peer Reviewed Open Access Journals)

International Journal of Advanced Technology and Engineering Exploration (IJATEE)

ISSN (Print):2394-5443    ISSN (Online):2394-7454
Volume-7 Issue-64 March-2020
Full-Text PDF
Paper Title : An efficient ICKM approach for similarity measurement and distance estimation based on k-means
Author Name : Isha Kumari and Vivek Sharma
Abstract :

An iterative centroid initialization k-means (ICKM) based clustering has been proposed in this paper. In this approach first the dataset selection has been performed along with the option of choosing and selection as per the data use or the user can access partial data also based on the iterative centroid. Then the data preprocessing steps are followed for the data arrangement and analysis. There are four different distance algorithms have been considered with the k-means. These algorithms provide the complete variability for the distance estimation and production. The proposed method found to be useful along with different distance estimation and measures.

Keywords : K-means, Euclidean, ICKM, Similarity measurement, Centroid distances.
Cite this article : Kumari I, Sharma V. An efficient ICKM approach for similarity measurement and distance estimation based on k-means. International Journal of Advanced Technology and Engineering Exploration. 2020; 7 (64): 73-78. DOI:10.19101/IJATEE.2020.762022.
References :
[1]Dubey AK, Gupta U, Jain S. Analysis of k-means clustering approach on the breast cancer Wisconsin dataset. International Journal of Computer Assisted Radiology and Surgery. 2016; 11(11):2033-47.
[Crossref] [Google Scholar]
[2]Dubey AK, Gupta U, Jain S. Comparative study of K-means and fuzzy C-means algorithms on the breast cancer data. International Journal on Advanced Science, Engineering and Information Technology. 2018; 8(1):18-29.
[Crossref] [Google Scholar]
[3]Mahmud MS, Rahman MM, Akhtar MN. Improvement of K-means clustering algorithm with better initial centroids based on weighted average. In international conference on electrical and computer engineering 2012 (pp. 647-50). IEEE.
[Crossref] [Google Scholar]
[4]Margaret H. Data mining-“introductory and advanced concepts”. Pearson.
[Google Scholar]
[5]Khandelwal A, Jain YK. An efficient k-means algorithm for the cluster head selection based on SAW and WPM. International Journal of Advanced Computer Research. 2018; 8(37):191-202.
[Crossref] [Google Scholar]
[6]Pei J, Han J, Lu H, Nishio S, Tang S, Yang D. H-mine: hyper-structure mining of frequent patterns in large databases. In proceedings of international conference on data mining 2001 (pp. 441-8). IEEE.
[Crossref] [Google Scholar]
[7]Dubey AK, Dubey AK, Agarwal V, Khandagre Y. Knowledge discovery with a subset-superset approach for mining heterogeneous data with dynamic support. In CSI sixth international conference on software engineering 2012 (pp. 1-6). IEEE.
[Crossref] [Google Scholar]
[8]Babu DB, Prasad RS, Umamaheswararao Y. Efficient frequent pattern tree construction. International Journal of Advanced Computer Research. 2014; 4(14):331-6.
[Google Scholar]
[9]Li K, Cui L. A kernel fuzzy clustering algorithm with generalized entropy based on weighted sample. International Journal of Advanced Computer Research. 2014; 4(2):596-600.
[Google Scholar]
[10]Horeis T, Sick B. Collaborative knowledge discovery & data mining: from knowledge to experience. In symposium on computational intelligence and data mining 2007 (pp. 421-8). IEEE.
[Crossref] [Google Scholar]
[11]Zhou Z, Wu Z, Feng Y. Enhancing reliability throughout knowledge discovery process. In sixth international conference on data mining-workshops 2006 (pp. 754-8). IEEE.
[Crossref] [Google Scholar]
[12]Mansour AM. Decision tree-based expert system for adverse drug reaction detection using fuzzy logic and genetic algorithm. International Journal of Advanced Computer Research. 2018; 8(36):110-28.
[Crossref] [Google Scholar]
[13]Jamil A, Salam A, Amin F. Performance evaluation of top-k sequential mining methods on synthetic and real datasets. International Journal of Advanced Computer Research. 2017; 7(32):176-84.
[Crossref] [Google Scholar]
[14]Lan GC, Hong TP, Tseng VS. An efficient projection-based indexing approach for mining high utility itemsets. Knowledge and Information Systems. 2014; 38(1):85-107.
[Crossref] [Google Scholar]
[15]Singh B, Dubey V, Sheetlani J. A review and analysis on knowledge discovery and data mining techniques. International Journal of Advanced Technology and Engineering Exploration. 2018; 5(41):70-7.
[Crossref] [Google Scholar]
[16]Dubey AK, Shandilya SK. Exploiting need of data mining services in mobile computing environments. In international conference on computational intelligence and communication networks 2010 (pp. 409-14). IEEE.
[Crossref] [Google Scholar]
[17]Kumar J, Vashistha R. Estimation of inter-centroid distance quality in data clustering problem using hybridized K-means algorithm. In second international conference on electrical, computer and communication technologies 2017 (pp. 1-7). IEEE.
[Crossref] [Google Scholar]
[18]Ushakov AV, Vasilyev I. A parallel heuristic for a k-medoids clustering problem with unfixed number of clusters. In international convention on information and communication technology, electronics and microelectronics 2019 (pp. 1116-20). IEEE.
[Crossref] [Google Scholar]
[19]Contreras GF, Delgado BM, Ibarra DG, De Castro CL, Jaimes BR. Cluster CV2: a computer vision approach to spatial identification of data clusters. In symposium on image, signal processing and artificial vision 2019 (pp. 1-5). IEEE.
[Crossref] [Google Scholar]
[20]Choi HW, Qureshi NM, Shin DR. Analysis of electricity consumption at home using K-means clustering algorithm. In international conference on advanced communication technology 2019 (pp. 639-43). IEEE.
[Crossref] [Google Scholar]
[21]Akbari M, Izadkhah H. GAKH: a new evolutionary algorithm for graph clustering problem. In international conference on pattern recognition and image analysis 2019 (pp. 159-62). IEEE.
[Crossref] [Google Scholar]
[22]Wang M, Xu Y. Research on label propagation algorithms based on clustering coefficient. In 4th international conference on cloud computing and big data analysis 2019 (pp. 348-52). IEEE.
[Crossref] [Google Scholar]
[23]Brown D, Japa A, Shi Y. A fast density-grid based clustering method. In 9th annual computing and communication workshop and conference 2019 (pp. 48-54). IEEE.
[Crossref] [Google Scholar]
[24]Alalyan F, Zamzami N, Bouguila N. Model-based hierarchical clustering for categorical data. In IEEE 28th international symposium on industrial electronics 2019 (pp. 1424-9). IEEE.
[Crossref] [Google Scholar]
[25]Zhang G, Liu C, Men T. Research on data mining technology based on association rules algorithm. In 8th joint international information technology and artificial intelligence conference 2019 (pp. 526-30). IEEE.
[Crossref] [Google Scholar]
[26]Yang Y, Zhang X. Block-diagonal subspace clustering with laplacian rank constraint. In information technology, networking, electronic and automation control conference 2019 (pp. 1556-9). IEEE.
[Crossref] [Google Scholar]