A new hierarchical clustering algorithm
Authors:
- 1 November 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 148-152
Abstract
The purpose of data clustering algorithm is to form clusters (groups) of data points such that there is high intra-cluster and low inter-cluster similarity. There are different types of clustering methods such as hierarchical, partitioning, grid and density based. Hierarchical clustering is a method of cluster analysis which seeks to build a hierarchy of clusters. A hierarchical clustering method can be thought of as a set of ordinary (flat) clustering methods organized in a tree structure. These methods construct the clusters by recursively partitioning the objects in either a top-down or bottom-up fashion. In this paper we present a new hierarchical clustering algorithm using Euclidean distance. To validate this method we have performed some experiments with low dimensional artificial datasets and high dimensional fMRI dataset. Finally the result of our method is compared to some of existing clustering methods.Keywords
This publication has 4 references indexed in Scilit:
- Hierarchical clustering2015
- A New, Fast and Accurate Algorithm for Hierarchical Clustering on Euclidean DistancesLecture Notes in Computer Science, 2013
- Hierarchical Clustering Algorithms for Document DatasetsData Mining and Knowledge Discovery, 2005
- Data Mining and Knowledge Discovery Handbook2005