Open Access Open Access  Restricted Access Subscription Access

Enhanced K-Means Clustering Algorithm Using Collaborative Filtering Approach


Affiliations
1 Institute of Engineering and Technology, Devi Ahilya University, Indore, M.P., India
 

Clustering is well-known unsupervised learning method. In clustering a set of essentials is separated into uniform groups.K-means is one of the most popular partition based clustering algorithms in the area of research. But in the original K-means the quality of the resulting clusters mostly depends on the selection of initial centroids, so number of iterations is increase and take more time because of that it is computationally expensive. There are so many methods have been proposed for improving accuracy, performance and efficiency of the k-means clustering algorithm. This paper proposed enhanced K-Means Clustering approach in addition to Collaborative filtering approach to recommend quality content to its users. This research would help those users who have to scroll through pages of results to find important content.


Keywords

Data Mining, Clustering, k-Means Clustering, Collaborative Filtering Centroids.
User
Notifications
Font Size

  • Nikita Jain, Vishal Srivastava “DATA MINING TECHNIQUES: SURVEY PAPER”IJRET eISSN: 2319-1163 | pISSN: 2321-7308.
  • Pahlavi Purohit “A new Efficient Approach towards k-means Clustering Algorithm”, International journal of Computer Applications,Vol 65-no 11,march 2013
  • Wang Shunye “An Improved K-means Clustering Algorithm Based on Dissimilarity” 2013 International Conference on Mechatronic Sciences, Electric Engineering and Computer (MEC)Dec 20-22,2013, Shenyang, China IEEE.
  • Juntao Wang & Xiaolong Su “An improved K -Means clustering algorithm” 2011 IEEE
  • Md. Sohrab Mahmud, Md. Mostafizer Rahman, and Md.Nasim Akhtar “Improvement of K-means Clustering algorithm with better initial centroids based on weighted average” 2012 7th International Conference on Electrical and Computer Engineering 20-22 December, 2012, Dhaka, Bangladesh, 2012 IEEE.
  • Shuhua Ren &Alin Fan “K-means Clustering Algorithm Based on Coefficient of Variation” 2011 4th International Congress on Image and Signal Processing2011 IEEE.
  • Navjot Kaur, Jaspreet Kaur Sahiwal, Navneet Kaur “EFFICIENT K-MEANSCLUSTERING ALGORITHM USING RANKING METHOD IN DATA MINING” ISSN: 2278–1323 International Journal of Advanced Research in Computer Engineering & Technology Volume 1, Issue 3, May2012.
  • SongJie Gong and Zhejiang “Joining User Clustering and Item Based Collaborative Filtering in Personalized
  • Friedrich Leisch1 and Bettina Gr un2, “Extending Standard Cluster Algorithms to Allow for Group Constraints”, Compstat 2006, Proceeding in Computational Statistics, hysica verlag, Heidelberg, Germany,2006.

Abstract Views: 165

PDF Views: 1




  • Enhanced K-Means Clustering Algorithm Using Collaborative Filtering Approach

Abstract Views: 165  |  PDF Views: 1

Authors

Ankush Saklecha
Institute of Engineering and Technology, Devi Ahilya University, Indore, M.P., India
Jagagdish Raikwal
Institute of Engineering and Technology, Devi Ahilya University, Indore, M.P., India

Abstract


Clustering is well-known unsupervised learning method. In clustering a set of essentials is separated into uniform groups.K-means is one of the most popular partition based clustering algorithms in the area of research. But in the original K-means the quality of the resulting clusters mostly depends on the selection of initial centroids, so number of iterations is increase and take more time because of that it is computationally expensive. There are so many methods have been proposed for improving accuracy, performance and efficiency of the k-means clustering algorithm. This paper proposed enhanced K-Means Clustering approach in addition to Collaborative filtering approach to recommend quality content to its users. This research would help those users who have to scroll through pages of results to find important content.


Keywords


Data Mining, Clustering, k-Means Clustering, Collaborative Filtering Centroids.

References





DOI: https://doi.org/10.13005/ojcst%2F10.02.31