A half-split grid clustering algorithm by simulating cell division

Clustering, one of the important data mining techniques, has two main processing methods on data-based similarity clustering and space-based density grid clustering. The latter has more advantage than the former on larger and multiple shape and density dataset. However, due to a global partition of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2014 International Joint Conference on Neural Networks (IJCNN) s. 2183 - 2189
Hlavní autoři: Wenxiang Dou, Jinglu Hu
Médium: Konferenční příspěvek
Jazyk:angličtina
japonština
Vydáno: IEEE 01.07.2014
Témata:
Algorithm design and analysis
Binary trees
Clustering algorithms
data clustering
Educational institutions
grid clustering
Noise
Partitioning algorithms
Shape
unsupervised learningt
ISSN:2161-4393
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Clustering, one of the important data mining techniques, has two main processing methods on data-based similarity clustering and space-based density grid clustering. The latter has more advantage than the former on larger and multiple shape and density dataset. However, due to a global partition of existing grid-based methods, they will perform worse when there is a big difference on the density of clusters. In this paper, we propose a novel algorithm that can produces appropriate grid space in different density regions by simulating cell division process. The time complexity of the algorithm is O(n) in which n is number of points in dataset. The proposed algorithm will be applied on popular chameleon datasets and our synthetic datasets with big density difference. The results show our algorithm is effective on any multi-density situation and has scalability on space optimization problems.
ISSN:2161-4393
DOI:10.1109/IJCNN.2014.6889720