Sciweavers

1651 search results - page 134 / 331
» Measuring the Complexity of Classification Problems
Sort
View
STOC
2003
ACM
193views Algorithms» more  STOC 2003»
14 years 8 months ago
Space efficient dynamic stabbing with fast queries
In dynamic stabbing, we operate on a dynamic set of intervals. A stabbing query asks for an interval containing a given point. This basic problem encodes problems such as method l...
Mikkel Thorup
JMLR
2010
104views more  JMLR 2010»
13 years 2 months ago
Learnability, Stability and Uniform Convergence
The problem of characterizing learnability is the most basic question of statistical learning theory. A fundamental and long-standing answer, at least for the case of supervised c...
Shai Shalev-Shwartz, Ohad Shamir, Nathan Srebro, K...
ICML
2000
IEEE
14 years 8 months ago
Version Space Algebra and its Application to Programming by Demonstration
Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the class...
Tessa A. Lau, Pedro Domingos, Daniel S. Weld
AI
2008
Springer
13 years 8 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
BMCBI
2008
105views more  BMCBI 2008»
13 years 8 months ago
A gene pattern mining algorithm using interchangeable gene sets for prokaryotes
Background: Mining gene patterns that are common to multiple genomes is an important biological problem, which can lead us to novel biological insights. When family classification...
Meng Hu, Kwangmin Choi, Wei Su, Sun Kim, Jiong Yan...