SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
From MaRDI portal
Publication:991943
DOI10.1016/j.patcog.2010.04.021zbMath1213.68526OpenAlexW2003094092MaRDI QIDQ991943
Iñaki Albisua, Iñigo Perona, Ibai Gurrutxaga, Olatz Arbelaitz, Javier Muguerza, Jesús M. Pérez, José I. Martín
Publication date: 8 September 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2010.04.021
Related Items
DESPOTA: dendrogram slicing through a pemutation test approach, Parallel complete gradient clustering algorithm and its properties, SEP/COP
Uses Software
Cites Work
- On similarity indices and correction for chance agreement
- An optimal hierarchical clustering algorithm for gene expression data
- Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
- A multi-prototype clustering algorithm
- The complexity of computing metric distances between partitions
- Application of data mining in computer security.
- Comparing resemblance measures
- Robust cluster validity indexes
- A partitional clustering algorithm validated by a clustering tendency index based on graph theory
- A hierarchical clustering algorithm for categorical sequence data
- Clustering of time series data -- a survey
- Normality-based validation for crisp clustering
- Measuring the Power of Hierarchical Cluster Analysis
- Clustering and its validation in a symbolic framework
- Learning Theory and Kernel Machines
- On clustering validation techniques
- A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
