Data clustering using a modified Kuwahara filter

Authors:
Hasan Al-Marzouqi
Affiliations:
Department of Electrical Engineering, The Petroleum Institute, Abu Dhabi, United Arab Emirates
Venue:
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Year:
2009

Citing 7
Cited 0

Algorithms for clustering data

Algorithms for clustering data
Automatic subspace clustering of high dimensional data for data mining applications

SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
STING: A Statistical Information Grid Approach to Spatial Data Mining

VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Support vector clustering

The Journal of Machine Learning Research
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Dynamic Cluster Formation Using Level Set Methods

IEEE Transactions on Pattern Analysis and Machine Intelligence
Survey of clustering algorithms

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper we propose a new density based clustering algorithm. As with other density based clustering algorithms our approach does not require the number of clusters as input. A modification of the Kuwahara filter, used in image processing, is used to generate a special density map in which the brightness of pixels is indicative of the density of the data points. A framework for clustering is derived and its performance is demonstrated on a number of different data sets.