Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
My Menu
Saved Items

Comparison of Conventional and Rough K-Means Clustering

Pawan Lingras5, Rui Yan5 and Chad West5

(5)  Department of Math and Computer Science, Saint Mary’s University, Halifax, Nova Scotia, Canada, B3H 3C3
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.

Keywords  Rough Sets - Clustering - K-means - Web Usage mining - Unsupervised Learning


Fulltext Preview (Small, Large)
Image of the first page of the fulltext

References secured to subscribers.



Export this chapter
Export this chapter as RIS | Text
 
Remote Address: 38.107.191.108 • Server: mpweb06
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)