Clustering with internal connectedness

DOI10.1007/978-3-642-19094-0_17MaRDI QIDQ3078394zbMATH OpenOpenAlexFDO

Authors Aditya Pancholi, Yogish Sabharwal, Neelima Gupta

Publication date 20 February 2011

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19094-0_17

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• Clustering data that are graph connected
• Joint cluster analysis of attribute data and relationship data
• The complexity of the simultaneous cluster problem
• Collective relational clustering
• Some types of clustering with relational constraints

Cites work

• scientific article; zbMATH DE number 1168330 (Why is no real title available?)
• scientific article; zbMATH DE number 1559563 (Why is no real title available?)
• A General Approximation Technique for Constrained Forest Problems
• Algorithms for connected set cover problem and fault-tolerant connected set cover problem
• Introduction to algorithms
• Linear-time approximation schemes for clustering problems in any dimensions
• On k-Median clustering in high dimensions
• On coresets for k-means and k-median clustering
• On the Complexity of Some Common Geometric Location Problems

Cited in

(4)

• Collective relational clustering
• Joint cluster analysis of attribute data and relationship data
• Connected k-center and k-diameter clustering
• Clustering data that are graph connected

This page was built for publication: Clustering with internal connectedness

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