1252 search results - page 136 / 251 » Minimizing Learned Clauses |
119
click to vote
ICANN
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. This paper proposes a general approach named ExpectationMiniMax (EMM) for clustering analysis without knowing the cluster number. It describes the contrast function of Ex...
134
click to vote
COLT
1999
Springer
15 years 9 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
116
click to vote
LREC
2008
15 years 6 months ago
2008
This paper presents various strategies for improving the extraction performance of less prominent relations with the help of the rules learned for similar relations, for which lar...
150
click to vote
BIBM
2010
IEEE
15 years 2 months ago
2010
IEEE
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
187
click to vote
ALT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...