NP-hard approximation problems in overlapping clustering.
From MaRDI portal
Publication:1566100
zbMath1040.91084MaRDI QIDQ1566100
François Brucker, Jean-Pierre Barthelemy
Publication date: 2001
Published in: Journal of Classification (Search for Journal in Brave)
complexity; approximation problems; \(k\)-hierarchies; \(k\)-weak hierarchies; pseudo-hierarchies; Robinson dissimilarities
91C20: Clustering in the social and behavioral sciences
65Y20: Complexity and performance of numerical algorithms
91C15: One- and multidimensional scaling in the social and behavioral sciences
Related Items
Graph-based data clustering with overlaps, Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances, Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis, Binary clustering, From hypertrees to arboreal quasi-ultrametrics, Closure systems, implicational systems, overhanging relations and the case of hierarchical classification, Combinatorial optimisation and hierarchical classifications, Sub-dominant theory in numerical taxonomy