Clustering with Partial Information

DOI10.1007/978-3-540-85238-4_11MaRDI QIDQ3599122zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael R. Fellows, Pinar Heggernes, F. Mancini, Charis Papadopoulos, Frances Rosamond, Hans L. Bodlaender

Publication date 3 February 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-85238-4_11

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Clustering with partial information
• Correlation clustering with partial information
• Clustering with respect to the information distance
• Information-based clustering
• Partial dissimilarities with application to clustering

Cites work

• A More Effective Linear Kernelization for Cluster Editing
• Algorithms - ESA 2003
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Cluster graph modification problems
• Clustering with Partial Information
• Clustering with qualitative information
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Correlation clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with partial information
• Data reduction, exact, and heuristic algorithms for clique cover
• Efficient Parameterized Preprocessing for Cluster Editing
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Graph Sandwich Problems
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 1507224 (Why is no real title available?)
• scientific article; zbMATH DE number 4121434 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• NP-hard problems in hierarchical-tree clustering
• Parameterized and Exact Computation
• The Cluster Editing Problem: Implementations and Experiments
• The Lost Continent of Polynomial Time: Preprocessing and Kernelization

Cited in

(6)

• Clustering with partial information
• On the parameterized complexity of clustering problems for incomplete data
• Clustering with Partial Information
• Complexity issues for the sandwich homogeneous set problem
• Information-based clustering
• Constant ratio fixed-parameter approximation of the edge multicut problem

This page was built for publication: Clustering with Partial Information

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599122)