scientific article; zbMATH DE number 2080486

MaRDI QIDQ4473284zbMATH OpenFDO

Authors Anthony K. H. Tung, Jiawei Han, V. S. Lakshmanan, Raymond T. Ng

Publication date 4 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/1973/19730405.htm

Mathematics Subject Classification ID

Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Constrained clustering by constraint programming
• Constrained Clustering Using Column Generation
• Constrained predictive clustering
• Constrained clustering with a complex cluster structure
• Partition-based clustering using constraint optimization

Cited in

(18)

• Clustering with relational constraint
• Probability-one homotopy methods for constrained clustering
• On the complexity of clustering with relaxed size constraints in fixed dimension
• Constrained clustering problems: new optimization algorithms
• Using projection-based clustering to find distance- and density-based clusters in high-dimensional data
• Hierarchical constraints
• Constrained clustering with a complex cluster structure
• Quality driven database mining
• On the Complexity of Clustering with Relaxed Size Constraints
• Boosting clustering by active constraint selection
• Constrained predictive clustering
• Clustering with balancing constraints
• scientific article; zbMATH DE number 2088074 (Why is no real title available?)
• Partition-based clustering using constraint optimization
• On finding large conjunctive clusters.
• Constrained Clustering Using Column Generation
• Structural, Syntactic, and Statistical Pattern Recognition
• Constrained clustering: current and new trends

This page was built for publication:

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