Please use this identifier to cite or link to this item:
Title: Distance based Incremental Clustering for Mining Clusters of Arbitrary Shapes
Authors: Patra, B K
Ville, O
Launonen, R
Nandi, S
Korra, S B
Keywords: Incremental clustering
arbitrary shaped clusters
Issue Date: 2013
Publisher: Springer
Citation: Lecture Notes in Computer Science Volume 8251, 2013, pp 229-236
Abstract: Clustering has been recognized as one of the important tasks in data mining. One important class of clustering is distance based method. To reduce the computational and storage burden of the classical clustering methods, many distance based hybrid clustering methods have been proposed. However, these methods are not suitable for cluster analysis in dynamic environment where underlying data distribution and subsequently clustering structures change over time. In this paper, we propose a distance based incremental clustering method, which can find arbitrary shaped clusters in fast changing dynamic scenarios. Our proposed method is based on recently proposed al-SL method, which can successfully be applied to large static datasets. In the incremental version of the al-SL (termed as IncrementalSL), we exploit important characteristics of al-SL method to handle frequent updates of patterns to the given dataset. The IncrementalSL method can produce exactly same clustering results as produced by the al-SL method. To show the effectiveness of the IncrementalSL in dynamically changing database, we experimented with one synthetic and one real world datasets.
Description: Copyright for this paper belongs to Springer
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
l-single.pdf231.85 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.