670 search results - page 12 / 134 » Intractability and clustering with constraints |
CSCLP
2007
Springer
15 years 3 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
How to determine the number of clusters is an intractable problem in clustering analysis. In this paper, we propose a new learning paradigm named Maximum Weighted Likelihood (MwL)...
NIPS
2001
14 years 11 months ago
2001
In previous work on "transformed mixtures of Gaussians" and "transformed hidden Markov models", we showed how the EM algorithm in a discrete latent variable mo...
SSPR
2004
Springer
15 years 3 months ago
2004
Springer
Several clustering algorithms equipped with pairwise hard constraints between data points are known to improve the accuracy of clustering solutions. We develop a new clustering alg...
EWIMT
2004
14 years 11 months ago
2004
The identification of categories in image databases usually relies on clustering algorithms that only exploit the feature-based similarities between images. The addition of semant...