Welcome to the InfoSci Platform
Reference Hub4
ASCCN: Arbitrary Shaped Clustering Method with Compatible Nucleoids

ASCCN: Arbitrary Shaped Clustering Method with Compatible Nucleoids

Renxia Wan, Lixin Wang, Xiaoke Su
Copyright: © 2010 |Volume: 6 |Issue: 4 |Pages: 15
ISSN: 1548-3924|EISSN: 1548-3932|EISBN13: 9781613502327|DOI: 10.4018/jdwm.2010100101
Cite Article Cite Article

MLA

Wan, Renxia, et al. "ASCCN: Arbitrary Shaped Clustering Method with Compatible Nucleoids." IJDWM vol.6, no.4 2010: pp.1-15. http://doi.org/10.4018/jdwm.2010100101

APA

Wan, R., Wang, L., & Su, X. (2010). ASCCN: Arbitrary Shaped Clustering Method with Compatible Nucleoids. International Journal of Data Warehousing and Mining (IJDWM), 6(4), 1-15. http://doi.org/10.4018/jdwm.2010100101

Chicago

Wan, Renxia, Lixin Wang, and Xiaoke Su. "ASCCN: Arbitrary Shaped Clustering Method with Compatible Nucleoids," International Journal of Data Warehousing and Mining (IJDWM) 6, no.4: 1-15. http://doi.org/10.4018/jdwm.2010100101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Special clustering algorithms are attractive for the task of grouping an arbitrary shaped database into several proper classes. Until now, a wide variety of clustering algorithms for this task have been proposed, although the majority of these algorithms are density-based. In this paper, the authors extend the dissimilarity measure to compatible measure and propose a new algorithm (ASCCN) based on the results. ASCCN is an unambiguous partition method that groups objects to compatible nucleoids, and merges these nucleoids into different clusters. The application of cluster grids significantly reduces the computational cost of ASCCN, and experiments show that ASCCN can efficiently and effectively group arbitrary shaped data points into meaningful clusters.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.