NP-hard approximation problems in overlapping clustering.

zbMath1040.91084MaRDI QIDQ1566100

François Brucker, Jean-Pierre Barthelemy

Publication date: 2001

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

complexityapproximation problems\(k\)-hierarchies\(k\)-weak hierarchiespseudo-hierarchiesRobinson dissimilarities

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Complexity and performance of numerical algorithms (65Y20) One- and multidimensional scaling in the social and behavioral sciences (91C15)

Related Items (16)

An optimal algorithm to recognize Robinsonian dissimilarities ⋮ A Simple and Optimal Algorithm for Strict Circular Seriation ⋮ Closure systems, implicational systems, overhanging relations and the case of hierarchical classification ⋮ Reconstruction of line-embeddings of graphons ⋮ ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions ⋮ Modules in Robinson Spaces ⋮ Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances ⋮ An Optimization Parameter for Seriation of Noisy Data ⋮ Graph-based data clustering with overlaps ⋮ On critical sets of a finite Moore family ⋮ Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis ⋮ Binary clustering ⋮ Combinatorial optimisation and hierarchical classifications ⋮ From hypertrees to arboreal quasi-ultrametrics ⋮ Sub-dominant theory in numerical taxonomy ⋮ Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices

This page was built for publication: NP-hard approximation problems in overlapping clustering.