A Clustering Algorithm Incorporating Density and Direction

13 years 6 months ago

Download irserver.ucd.ie

This paper analyses the advantages and disadvantages of the K-means algorithm and the DENCLUE algorithm. In order to realise the automation of clustering analysis and eliminate human factors, both partitioning and density-based methods were adopted, resulting in a new algorithm

Yu-Chen Song, Michael J. O'Grady, Gregory M. P. O'

Real-time Traffic

Algorithm | CIMCA 2008 | Clustering Algorithm | Intelligent Agents | K-Means Algorithm |

claim paper

» Fast Estimation of Nonparametric Kernel Density Through PDDP and its Application in Textur...

» A method for initialising the Kmeans clustering algorithm using kdtrees

» Self Organized Dynamic Tree Neural Network

» Kernel Density Construction Using Orthogonal Forward Regression

» RegionBased Shape Incorporation for Probabilistic SpatioTemporal Video Object Segmentation

» MABAC Matrix Based Clustering Algorithm

» Perimeterdegree a priori metric for directly measuring and homogenizing interconnection co...

» Clustering via Random Walk Hitting Time on Directed Graphs

Post Info
More Details (n/a)

Added	12 Oct 2010
Updated	12 Oct 2010
Type	Conference
Year	2008
Where	CIMCA
Authors	Yu-Chen Song, Michael J. O'Grady, Gregory M. P. O'Hare, Wei Wang

Comments (0)

Sciweavers

A Clustering Algorithm Incorporating Density and Direction

Algorithm | CIMCA 2008 | Clustering Algorithm | Intelligent Agents | K-Means Algorithm |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers