Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes
From MaRDI portal
Publication:4969701
Cites work
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 3793445 (Why is no real title available?)
- scientific article; zbMATH DE number 41467 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3231693 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Algorithms for the Assignment and Transportation Problems
- Cure: An efficient clustering algorithm for large databases
- Graph Clustering and Minimum Cut Trees
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Optimization approaches to semi-supervised learning
- Structural, Syntactic, and Statistical Pattern Recognition
This page was built for publication: Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969701)