Sciweavers

54 search results - page 4 / 11
» An Incremental Subspace Learning Algorithm to Categorize Lar...
Sort
View
CVPR
2007
IEEE
14 years 7 months ago
Incremental Linear Discriminant Analysis Using Sufficient Spanning Set Approximations
This paper presents a new incremental learning solution for Linear Discriminant Analysis (LDA). We apply the concept of the sufficient spanning set approximation in each update st...
Björn Stenger, Josef Kittler, Roberto Cipolla...
IJCNN
2007
IEEE
13 years 11 months ago
Random Feature Subset Selection for Analysis of Data with Missing Features
Abstract - We discuss an ensemble-of-classifiers based algorithm for the missing feature problem. The proposed approach is inspired in part by the random subspace method, and in pa...
Joseph DePasquale, Robi Polikar
DATAMINE
1999
108views more  DATAMINE 1999»
13 years 5 months ago
A Survey of Methods for Scaling Up Inductive Algorithms
Abstract. One of the de ning challenges for the KDD research community is to enable inductive learning algorithms to mine very large databases. This paper summarizes, categorizes, ...
Foster J. Provost, Venkateswarlu Kolluri
PKDD
2010
Springer
178views Data Mining» more  PKDD 2010»
13 years 3 months ago
Large-Scale Support Vector Learning with Structural Kernels
Abstract. In this paper, we present an extensive study of the cuttingplane algorithm (CPA) applied to structural kernels for advanced text classification on large datasets. In par...
Aliaksei Severyn, Alessandro Moschitti
PKDD
2004
Springer
168views Data Mining» more  PKDD 2004»
13 years 10 months ago
Combining Winnow and Orthogonal Sparse Bigrams for Incremental Spam Filtering
Spam filtering is a text categorization task that has attracted significant attention due to the increasingly huge amounts of junk email on the Internet. While current best-pract...
Christian Siefkes, Fidelis Assis, Shalendra Chhabr...