153 search results - page 28 / 31 » An empirical comparison of supervised learning algorithms |
ICDM
2003
IEEE
15 years 2 months ago
2003
IEEE
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
89
Voted
SIGIR
2006
ACM
15 years 3 months ago
2006
ACM
This paper studies the problem of identifying comparative sentences in text documents. The problem is related to but quite different from sentiment/opinion sentence identification...
ML
2010
ACM
14 years 8 months ago
2010
ACM
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
118
click to vote
JMLR
2010
14 years 4 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...
NIPS
2007
14 years 11 months ago
2007
We present a theoretical study on the discriminative clustering framework, recently proposed for simultaneous subspace selection via linear discriminant analysis (LDA) and cluster...