Comparison of conventional and rough K-means clustering

  • Authors:
  • Pawan Lingras;Rui Yan;Chad West

  • Affiliations:
  • Department of Math and Computer Science, Saint Mary's University, Halifax, Nova Scotia, Canada;Department of Math and Computer Science, Saint Mary's University, Halifax, Nova Scotia, Canada;Department of Math and Computer Science, Saint Mary's University, Halifax, Nova Scotia, Canada

  • Venue:
  • RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper compares the results of clustering obtained using a modified K-means algorithm with the conventional clustering process. The modifications to the K-means algorithm are based on the properties of rough sets. The resulting clusters are represented as interval sets. The paper describes results of experiments used to create conventional and interval set representations of clusters of web users on three educational web sites. The experiments use secondary data consisting of access logs from the World Wide Web. This type of analysis is called web usage mining, which involves applications of data mining techniques to discover usage patterns from the web data. Analysis shows the advantages of the interval set representation of clusters over conventional crisp clusters.