Sciweavers

853 search results - page 15 / 171
» Are many small sets explicitly small
Sort
View
JMLR
2006
206views more  JMLR 2006»
15 years 6 months ago
New Algorithms for Efficient High-Dimensional Nonparametric Classification
This paper is about non-approximate acceleration of high-dimensional nonparametric operations such as k nearest neighbor classifiers. We attempt to exploit the fact that even if w...
Ting Liu, Andrew W. Moore, Alexander G. Gray
CIKM
2006
Springer
15 years 9 months ago
Finding highly correlated pairs efficiently with powerful pruning
We consider the problem of finding highly correlated pairs in a large data set. That is, given a threshold not too small, we wish to report all the pairs of items (or binary attri...
Jian Zhang, Joan Feigenbaum
AI
2008
Springer
15 years 6 months ago
An experimental evaluation of simplicity in rule learning
While recent research on rule learning has focussed largely on finding highly accurate hypotheses, we evaluate the degree to which these hypotheses are also simple, that is small....
Ulrich Rückert, Luc De Raedt
BMCBI
2010
144views more  BMCBI 2010»
15 years 6 months ago
Finding sRNA generative locales from high-throughput sequencing data with NiBLS
Background: Next-generation sequencing technologies allow researchers to obtain millions of sequence reads in a single experiment. One important use of the technology is the seque...
Daniel MacLean, Vincent Moulton, David J. Studholm...
169
Voted
ACSC
2003
IEEE
15 years 9 months ago
Efficient Trie-Based Sorting of Large Sets of Strings
Sorting is a fundamental algorithmic task. Many generalpurpose sorting algorithms have been developed, but efficiency gains can be achieved by designing algorithms for specific ki...
Ranjan Sinha, Justin Zobel