8099 search results - page 1438 / 1620 » Higher-Order Task Models |
161
click to vote
DAWAK
2010
Springer
15 years 5 months ago
2010
Springer
Mining of frequent closed itemsets has been shown to be more efficient than mining frequent itemsets for generating non-redundant association rules. The task is challenging in data...
151
click to vote
ECIR
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Many tasks (e.g., search and summarization) result in an ordered list of items. In order to evaluate such an ordered list of items, we need to compare it with an ideal or...
139
click to vote
DBSEC
2009
15 years 5 months ago
2009
Managing the configuration of heterogeneous enterprise security mechanisms is a wholly complex task. The effectiveness of a configuration may be constrained by poor understanding a...
129
click to vote
GECCO
2008
Springer
15 years 4 months ago
2008
Springer
In evolutionary algorithms, the typical post-processing phase involves selection of the best-of-run individual, which becomes the final outcome of the evolutionary run. Trivial f...
151
click to vote
ICML
2010
IEEE
15 years 4 months ago
2010
IEEE
Pseudo-likelihood and contrastive divergence are two well-known examples of contrastive methods. These algorithms trade off the probability of the correct label with the probabili...