Name
Abstract | ||
|---|---|---|
In this paper, we present a new incremental clustering approach (InDEC) capable of detecting arbitrary cluster structures. Cluster may contain embedded structures. Available methods do not address this important issue in the context of continuously growing databases. A density variation concept is used to detect embedded clusters that may occurs after successive updation of database. Unlike popular methods which use distance measure, we use a new affinity score to decide the proximity of a new object with the clusters. We use both synthetic and real datasets to evaluate the performance of our proposed method. Experimental result reveals that proposed method is effective in detecting arbitrary and embedded clusters in dynamic scenario. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-45547-1_18 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Incremental clustering,Arbitrary cluster structure,Embedded cluster,Density variation | Data mining,Cluster (physics),Computer science,Cluster analysis | Conference |
Volume | ISSN | Citations |
9893 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Keshab Nath | 1 | 0 | 1.35 |
| Swarup Roy | 2 | 56 | 12.13 |
| Sukumar Nandi | 3 | 530 | 89.50 |