A half-split grid clustering algorithm by simulating cell division

Wenxiang Dou, Takayuki Furuzuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the International Joint Conference on Neural Networks
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2183-2189
Number of pages7
ISBN (Print)9781479914845
DOIs
Publication statusPublished - 2014 Sep 3
Event2014 International Joint Conference on Neural Networks, IJCNN 2014 - Beijing
Duration: 2014 Jul 62014 Jul 11

Other

Other2014 International Joint Conference on Neural Networks, IJCNN 2014
CityBeijing
Period14/7/614/7/11

Fingerprint

Clustering algorithms
Cells
Data mining
Scalability
Processing

Keywords

  • data clustering
  • grid clustering
  • unsupervised learningt

ASJC Scopus subject areas

  • Software
  • Artificial Intelligence

Cite this

Dou, W., & Furuzuki, T. (2014). A half-split grid clustering algorithm by simulating cell division. In Proceedings of the International Joint Conference on Neural Networks (pp. 2183-2189). [6889720] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IJCNN.2014.6889720

A half-split grid clustering algorithm by simulating cell division. / Dou, Wenxiang; Furuzuki, Takayuki.

Proceedings of the International Joint Conference on Neural Networks. Institute of Electrical and Electronics Engineers Inc., 2014. p. 2183-2189 6889720.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dou, W & Furuzuki, T 2014, A half-split grid clustering algorithm by simulating cell division. in Proceedings of the International Joint Conference on Neural Networks., 6889720, Institute of Electrical and Electronics Engineers Inc., pp. 2183-2189, 2014 International Joint Conference on Neural Networks, IJCNN 2014, Beijing, 14/7/6. https://doi.org/10.1109/IJCNN.2014.6889720
Dou W, Furuzuki T. A half-split grid clustering algorithm by simulating cell division. In Proceedings of the International Joint Conference on Neural Networks. Institute of Electrical and Electronics Engineers Inc. 2014. p. 2183-2189. 6889720 https://doi.org/10.1109/IJCNN.2014.6889720
Dou, Wenxiang ; Furuzuki, Takayuki. / A half-split grid clustering algorithm by simulating cell division. Proceedings of the International Joint Conference on Neural Networks. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 2183-2189
@inproceedings{9ff23a42b41a4328bc6eac15217c2b3d,
title = "A half-split grid clustering algorithm by simulating cell division",
abstract = "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.",
keywords = "data clustering, grid clustering, unsupervised learningt",
author = "Wenxiang Dou and Takayuki Furuzuki",
year = "2014",
month = "9",
day = "3",
doi = "10.1109/IJCNN.2014.6889720",
language = "English",
isbn = "9781479914845",
pages = "2183--2189",
booktitle = "Proceedings of the International Joint Conference on Neural Networks",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - A half-split grid clustering algorithm by simulating cell division

AU - Dou, Wenxiang

AU - Furuzuki, Takayuki

PY - 2014/9/3

Y1 - 2014/9/3

N2 - 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.

AB - 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.

KW - data clustering

KW - grid clustering

KW - unsupervised learningt

UR - http://www.scopus.com/inward/record.url?scp=84908494514&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84908494514&partnerID=8YFLogxK

U2 - 10.1109/IJCNN.2014.6889720

DO - 10.1109/IJCNN.2014.6889720

M3 - Conference contribution

SN - 9781479914845

SP - 2183

EP - 2189

BT - Proceedings of the International Joint Conference on Neural Networks

PB - Institute of Electrical and Electronics Engineers Inc.

ER -