Incremental approach for detecting arbitrary and embedded cluster structures

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

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.

Cite

CITATION STYLE

APA

Nath, K., Roy, S., & Nandi, S. (2016). Incremental approach for detecting arbitrary and embedded cluster structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9893 LNCS, pp. 220–233). Springer Verlag. https://doi.org/10.1007/978-3-319-45547-1_18

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