Sciweavers

136 search results - page 8 / 28
» Finding Alternative Clusterings Using Constraints
Sort
View
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 5 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
FLAIRS
2004
13 years 8 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
NIPS
2004
13 years 8 months ago
Maximum Margin Clustering
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...
NIPS
2008
13 years 8 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
CSDA
2010
208views more  CSDA 2010»
13 years 7 months ago
Bayesian density estimation and model selection using nonparametric hierarchical mixtures
We consider mixtures of parametric densities on the positive reals with a normalized generalized gamma process (Brix, 1999) as mixing measure. This class of mixtures encompasses t...
Raffaele Argiento, Alessandra Guglielmi, Antonio P...