815 search results - page 30 / 163 » Approximate Entropy Reducts |
103
click to vote
AI
1998
Springer
14 years 11 months ago
1998
Springer
The main statistics used in rough set data analysis, the approximation quality, is of limited value when there is a choice of competing models for predicting a decision variable. ...
106
click to vote
KDD
2003
ACM
16 years 7 days ago
2003
ACM
Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass...
102
click to vote
SIGCOMM
2006
ACM
15 years 5 months ago
2006
ACM
Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question ...
113
click to vote
CIARP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. It has been shown that many kernel methods can be equivalently formulated as minimal-enclosing-ball (MEB) problems in certain feature space. Exploiting this reduction eff...
SPIRE
2001
Springer
15 years 4 months ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...