A new hierarchical clustering algorithm

Authors:
Artur Starczewski
Affiliations:
Department of Computer Engineering, Częstochowa University of Technology, Częstochowa, Poland
Venue:
ICAISC'12 Proceedings of the 11th international conference on Artificial Intelligence and Soft Computing - Volume Part II
Year:
2012

Citing 10
Cited 0

Algorithms for clustering data

Algorithms for clustering data
A comparative study of clustering methods

Future Generation Computer Systems - Special double issue on data mining
Data clustering: a review

ACM Computing Surveys (CSUR)
Chameleon: Hierarchical Clustering Using Dynamic Modeling

Computer
The new k-windows algorithm for improving the k-means clustering algorithm

Journal of Complexity
Connectionist Structures of Type 2 Fuzzy Inference Systems

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
ROCK: A Robust Clustering Algorithm for Categorical Attributes

ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification

Pattern Recognition
From Ensemble of Fuzzy Classifiers to Single Fuzzy Rule Base Classifier

ICAISC '08 Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing
Neuro-fuzzy systems with relation matrix

ICAISC'10 Proceedings of the 10th international conference on Artificial intelligence and soft computing: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper a new hierarchical clustering technique is presented. This approach is similar to two popular hierarchical clustering algorithms, i.e. single-link and complete-link. These hierarchical methods play an important role in clustering data and allow to create well-separable clusters, whenever the clusters exist. The proposed method has been used to clustering artificial and real data sets. Obtained results confirm very good performances of the method.