A new method for non-spherical and multi-density clustering

Authors:
Xiaobing Yang;Lingmin He;Huijuan Lu
Affiliations:
Computer Science Department, China Jiliang University, Hangzhou, China;Computer Science Department, China Jiliang University, Hangzhou, China;Computer Science Department, China Jiliang University, Hangzhou, China
Venue:
IITA'09 Proceedings of the 3rd international conference on Intelligent information technology application
Year:
2009

Citing 5
Cited 0

A spatial data mining method by Delaunay triangulation

GIS '97 Proceedings of the 5th ACM international workshop on Advances in geographic information systems
CRYSTAL - A new density-based fast and efficient clustering algorithm

ISVD '06 Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering
Effective clustering and boundary detection algorithm based on Delaunay triangulation

Pattern Recognition Letters
A Clustering Algorithm for Datasets with Different Densities

ICCTD '09 Proceedings of the 2009 International Conference on Computer Technology and Development - Volume 01
Algorithm that mimics human perceptual grouping of dot patterns

BVAI'05 Proceedings of the First international conference on Brain, Vision, and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cluster analysis based on Delaunay Diagrams has been widely researched in all kinds of fields. In this article, a new method is proposed to treat with datasets of non-spherical and multi-density clustering. As well as, the problem of noise data is solved by defining the conceptions of In_Points and Out_Points in this method. The above points will be illustrated by two simulation experiments.