Sciweavers

12943 search results - page 2249 / 2589
» Predicting When Not to Predict
Sort
View
KES
2008
Springer
15 years 5 months ago
Driven by Compression Progress
I argue that data becomes temporarily interesting by itself to some self-improving, but computationally limited, subjective observer once he learns to predict or compress the data...
Jürgen Schmidhuber
JMLR
2006
132views more  JMLR 2006»
15 years 5 months ago
Accurate Error Bounds for the Eigenvalues of the Kernel Matrix
The eigenvalues of the kernel matrix play an important role in a number of kernel methods, in particular, in kernel principal component analysis. It is well known that the eigenva...
Mikio L. Braun
JMLR
2006
125views more  JMLR 2006»
15 years 5 months ago
Spam Filtering Using Statistical Data Compression Models
Spam filtering poses a special problem in text categorization, of which the defining characteristic is that filters face an active adversary, which constantly attempts to evade fi...
Andrej Bratko, Gordon V. Cormack, Bogdan Filipic, ...
JMLR
2006
99views more  JMLR 2006»
15 years 5 months ago
Worst-Case Analysis of Selective Sampling for Linear Classification
A selective sampling algorithm is a learning algorithm for classification that, based on the past observed data, decides whether to ask the label of each new instance to be classi...
Nicolò Cesa-Bianchi, Claudio Gentile, Luca ...
JMLR
2006
120views more  JMLR 2006»
15 years 5 months ago
Kernel-Based Learning of Hierarchical Multilabel Classification Models
We present a kernel-based algorithm for hierarchical text classification where the documents are allowed to belong to more than one category at a time. The classification model is...
Juho Rousu, Craig Saunders, Sándor Szedm&aa...
« Prev « First page 2249 / 2589 Last » Next »