9888 search results - page 1727 / 1978 » Active Algorithm Selection |
100
click to vote
NIPS
2003
15 years 15 days ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
102
click to vote
SDM
2003
SIAM
15 years 15 days ago
2003
SIAM
In earlier work we have introduced and explored a variety of different probabilistic models for the problem of answering selectivity queries posed to large sparse binary data set...
AAAI
1998
15 years 15 days ago
1998
A central problem in learning in complex environmentsis balancing exploration of untested actions against exploitation of actions that are known to be good. The benefit of explora...
115
click to vote
AAAI
2000
15 years 15 days ago
2000
Due to the large variation and richness of visual inputs, statistical learning gets more and more concerned in the practice of visual processing such as visual tracking and recogn...
TREC
2003
15 years 15 days ago
2003
Abstract. We present the results of UMBC’s participation in the Web and Novelty tracks. We explored various heuristics-based link analysis approaches to the Topic Distillation ta...