Comparison of conventional and rough K-means clustering

28Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Lingras, P., Yan, R., & West, C. (2003). Comparison of conventional and rough K-means clustering. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2639, pp. 130–137). Springer Verlag. https://doi.org/10.1007/3-540-39205-x_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free