A distance based clustering method for arbitrary shaped clusters in large datasets

DOI10.1016/j.patcog.2011.04.027zbMath1218.68151OpenAlexW2065179205MaRDI QIDQ2276025

Yanyan Li

Publication date: 10 August 2011

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2011.04.027

zbMATH Keywords

large datasetsleadersarbitrary shaped clustersdistance based clusteringhybrid clustering methodsingle-link

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Related Items (4)

On the approximation of Euclidean SL via geometric method ⋮ An approach to facial expression analysis with multi-model interactions ⋮ A fast multiobjective fuzzy clustering with multimeasures combination ⋮ A study of feature representation via neural network feature extraction and weighted distance for clustering

Uses Software

• clusfind

Cites Work

• Parallel algorithms for hierarchical clustering
• Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
• A multi-prototype clustering algorithm
• Finding Groups in Data
• A Hybrid Clustering Method for Identifying High-Density Clusters
• Fast hierarchical clustering and its validation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A distance based clustering method for arbitrary shaped clusters in large datasets