SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
type: Item
instance of: scholarly article
title: SEP/COP: an efficient method to find the best partition in hierarchical clustering based on a new cluster validity index
zbMATH Open document ID: 1213.68526
author: Ibai Gurrutxaga
author: Iñaki Albisua
author: Olatz Arbelaitz
author: José I. Martín
author: Javier Muguerza
author: Jesús M. Pérez
author: Iñigo Perona
published in: Pattern Recognition
publication date: 2010-09-08T00:00:00Z
Mathematics Subject Classification ID: 68T10
zbMATH DE Number: 5781126
zbMATH Keywords: hierarchical clustering
zbMATH Keywords: post-processing
zbMATH Keywords: cluster validity index
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: j.patcog.2010.04.021
OpenAlex ID: W2003094092
cites work: Q5836477
cites work: Efficient bottom-up hybrid hierarchical clustering techniques for protein sequence classification
cites work: An optimal hierarchical clustering algorithm for gene expression data
cites work: Q5316730
cites work: Application of data mining in computer security.
cites work: Q3994557
cites work: On clustering validation techniques
cites work: Q4773020
cites work: A multi-prototype clustering algorithm
cites work: Clustering of time series data -- a survey
cites work: A partitional clustering algorithm validated by a clustering tendency index based on graph theory
cites work: A hierarchical clustering algorithm for categorical sequence data
cites work: Robust cluster validity indexes
cites work: Normality-based validation for crisp clustering
cites work: Clustering and its validation in a symbolic framework
cites work: Q5180702
cites work: Measuring the Power of Hierarchical Cluster Analysis
cites work: A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters
cites work: On similarity indices and correction for chance agreement
cites work: Comparing resemblance measures
cites work: The complexity of computing metric distances between partitions
cites work: Learning Theory and Kernel Machines
DOI: 10.1016/J.PATCOG.2010.04.021
description: scientific article; zbMATH DE number 5781126