Sciweavers

17688 search results - page 331 / 3538
» Data Set Balancing
Sort
View
SEKE
2005
Springer
16 years 4 days ago
From Data to Knowledge: an Integrated Rule-Based Data Mining System
This paper presents an integrated rule-based data mining system that is capable of creating rulebased classifiers with web-based user interface from data sets provided by end user...
Chien-Chung Chan, Zhicheng Su
STOC
2009
ACM
87views Algorithms» more  STOC 2009»
16 years 7 months ago
Randomly supported independence and resistance
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
Per Austrin, Johan Håstad
ALT
2006
Springer
16 years 3 months ago
Risk-Sensitive Online Learning
We consider the problem of online learning in settings in which we want to compete not simply with the rewards of the best expert or stock, but with the best trade-off between rew...
Eyal Even-Dar, Michael J. Kearns, Jennifer Wortman
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
CINQ
2004
Springer
131views Database» more  CINQ 2004»
16 years 1 days ago
Model-Independent Bounding of the Supports of Boolean Formulae in Binary Data
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
Artur Bykowski, Jouni K. Seppänen, Jaakko Hol...