Constrained clustering: general pairwise and cardinality constraints
In this work, we study constrained clustering, where constraints are utilized to guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the cluster labels of two instances to...
Main Authors: | Bibi, A, Alqahtani, A, Ghanem, B |
---|---|
Format: | Journal article |
Language: | English |
Published: |
IEEE
2023
|
Similar Items
-
Polynomial Constraints for Sets with Cardinality Bounds
by: Marnette, B, et al.
Published: (2007) -
On Algorithms and Complexity for Sets with Cardinality Constraints
by: Marnette, Bruno, et al.
Published: (2005) -
On the Computational Complexity of Cardinality Constraints in Relational Databases
by: Kanellakis, Paris C.
Published: (2023) -
A class of generalized cardinal splines /
by: 373654 Goodman, T. N. T., et al.
Published: (1977) -
A multiscale approximation algorithm for the cardinality constrained knapsack problem
by: Krishnan, Bharath Kumar
Published: (2006)