1083 search results - page 115 / 217 » Efficient Discovery of Confounders in Large Data Sets |
166
click to vote
KDD
1997
ACM
15 years 10 months ago
1997
ACM
This paper investigates a brute-force technique for mining classification rules from large data sets. We employ an association rule miner enhanced with new pruning strategies to c...
151
click to vote
CAV
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
177
click to vote
ICDM
2010
IEEE
15 years 4 months ago
2010
IEEE
Nowadays, the classification of graph data has become an important and active research topic in the last decade, which has a wide variety of real world applications, e.g. drug acti...
263
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Many semi-supervised learning algorithms only
deal with binary classification. Their extension to the
multi-class problem is usually obtained by repeatedly
solving a set of bina...
159
click to vote
ICPR
2008
IEEE
16 years 23 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...