216 search results - page 16 / 44 » Learning Minimum Volume Sets |
IJCAI
1993
13 years 11 months ago
1993
Since most real-world applications of classification learning involve continuous-valued attributes, properly addressing the discretization process is an important problem. This pa...
JMLR
2006
13 years 9 months ago
2006
Spectral clustering refers to a class of techniques which rely on the eigenstructure of a similarity matrix to partition points into disjoint clusters, with points in the same clu...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper addresses the problem of learning archetypal structural models from examples. To this end we define a generative model for graphs where the distribution of observed nod...
UAI
2003
13 years 11 months ago
2003
This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that i...
NEUROSCIENCE
2001
Springer
14 years 2 months ago
2001
Springer
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...