137 search results - page 1 / 28 » Fast Committee-Based Structure Learning |
JMLR
2010
12 years 11 months ago
2010
Current methods for causal structure learning tend to be computationally intensive or intractable for large datasets. Some recent approaches have speeded up the process by first m...
KDD
2010
ACM
13 years 8 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
KDD
1998
ACM
13 years 9 months ago
1998
ACM
Abstract: The problem of discovering association rules in large databases has received considerable research attention. Much research has examined the exhaustive discovery of all a...
ESANN
2006
13 years 6 months ago
2006
The training of Emergent Self-organizing Maps (ESOM ) with large datasets can be a computationally demanding task. Batch learning may be used to speed up training. It is demonstrat...
IJCV
2010
13 years 3 months ago
2010
A decomposition is described, which parameterizes the geometry and appearance of contours and regions of gray-scale images with the goal of fast categorization. To express the con...