4903 search results - page 574 / 981 » The Set Covering Machine |
180
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. Machine learning can be utilized to build models that predict the runtime of search algorithms for hard combinatorial problems. Such empirical hardness models have previo...
158
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
This paper presents an autonomous algorithm for discovering exception rules from data sets. An exception rule, which is defined as a deviational pattern to a well-known fact, exhi...
190
click to vote
AUSAI
2008
Springer
15 years 8 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...
193
click to vote
ESWS
2008
Springer
15 years 8 months ago
2008
Springer
Exploiting the complex structure of relational data enables to build better models by taking into account the additional information provided by the links between objects. We exten...
168
click to vote
IPCV
2008
15 years 8 months ago
2008
- We report classification experiments using the pilot Infant COPE database of neonatal facial expressions. Two sets of DCT coeffiecents were used to train a neural network simulta...