Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
type: Item
instance of: scholarly article
title: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem
zbMATH Open document ID: 1179.62086
author: Michael J. Brusco
author: Hans-Friedrich Köhn
published in: Psychometrika
publication date: 2010-01-07T00:00:00Z
Mathematics Subject Classification ID: 62H30
Mathematics Subject Classification ID: 62P25
Mathematics Subject Classification ID: 05C90
Mathematics Subject Classification ID: 90C99
zbMATH DE Number: 5654157
zbMATH Keywords: equivalence relation
zbMATH Keywords: clique partitioning
zbMATH Keywords: clustering
zbMATH Keywords: heuristics
zbMATH Keywords: tabu search
zbMATH Keywords: simulated annealing
zbMATH Keywords: neighborhood search
describes a project that uses: AS 136
describes a project that uses: J-MEANS
describes a project that uses: CPLEX
describes a project that uses: clusfind
describes a project that uses: UCI-ml
MaRDI profile type: Publication
full work available at URL: s11336-009-9126-z
OpenAlex ID: W2046021437
cites work: Q4373474
cites work: The median procedure in cluster analysis and social choice theory
cites work: Q4763803
cites work: Improving Personnel Scheduling at Airline Stations
cites work: Optimal partitioning of a data set based on the \(p\)-median model
cites work: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning
cites work: A variable neighborhood search method for generalized blockmodeling of two-mode binary matrices
cites work: Noising methods for a clique partitioning problem
cites work: Q4139463
cites work: Fast Clustering Algorithms
cites work: Variable neighborhood search for the linear ordering problem
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Metric and Euclidean properties of dissimilarity coefficients
cites work: A cutting plane algorithm for a clustering problem
cites work: Facets of the clique partitioning polytope
cites work: Variable neighborhood search for the p-median
cites work: J-MEANS: A new local search heuristic for minimum sum of squares clustering
cites work: Q4148820
cites work: Algorithm AS 136: A K-Means Clustering Algorithm
cites work: Note: A local-search heuristic for large set-covering problems
cites work: Hierarchical clustering schemes
cites work: Finding Groups in Data
cites work: Optimization by Simulated Annealing
cites work: The p-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach
cites work: Clustering of microarray data via clique partitioning
cites work: Q5617409
cites work: Q4742505
cites work: Finite mixture models
cites work: Cliques and clustering: A combinatorial approach
cites work: Q4193321
cites work: Variable neighborhood search
cites work: The clique partitioning problem: Facets and patching facets
cites work: Analyse qualitativer Daten: Einführung und Übersicht. I
cites work: Analyse qualitativer Daten: Einführung und Übersicht. II
cites work: Design of hybrids for the minimum sum-of-squares clustering problem
cites work: A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
cites work: Ein Subgradientenverfahren zur Klassifikation qualitativer Daten
cites work: Q3745273
cites work: The complexity of computing medians of relations.
cites work: Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
cites work: Approximating Symmetric Relations by Equivalence Relations
DOI: 10.1007/S11336-009-9126-Z
Recommended article: Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis
Recommended article: Heuristic search of exact biclusters in binary data
Recommended article: Qualitative and quantitative combinations of crisp and rough clustering schemes using dominance relations
Recommended article: Clustering with qualitative information
Recommended article: Q3072825
Recommended article: Cluster analysis based on fuzzy equivalence relation
Recommended article: A heuristic approach to possibilistic clustering. Algorithms and applications
description: scientific article; zbMATH DE number 5654157