4903 search results - page 739 / 981 » The Set Covering Machine |
170
click to vote
KDD
2005
ACM
16 years 6 months ago
2005
ACM
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
167
Voted
KDD
2004
ACM
16 years 6 months ago
2004
ACM
Extracting sentiments from unstructured text has emerged as an important problem in many disciplines. An accurate method would enable us, for example, to mine online opinions from ...
190
click to vote
PAKDD
2009
ACM
16 years 3 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
173
click to vote
CVPR
2010
IEEE
16 years 2 months ago
2010
IEEE
Online boosting is one of the most successful online learning algorithms in computer vision. While many challenging online learning problems are inherently multi-class, online boo...
164
click to vote
MCS
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. One of the most widely applied techniques to deal with multiclass categorization problems is the pairwise voting procedure. Recently, this classical approach has been emb...