17688 search results - page 200 / 3538 » Data Set Balancing |
202
click to vote
AI
1998
Springer
15 years 6 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. ...
187
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
This paper presents SaM, a split and merge algorithm for frequent item set mining. Its distinguishing qualities are an exceptionally simple algorithm and data structure, which not ...
198
click to vote
SOFSEM
2007
Springer
16 years 17 days ago
2007
Springer
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
143
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Set intersection is a fundamental operation in information retrieval and database systems. This paper introduces linear space data structures to represent sets such that their int...
206
click to vote
ISCI
2011
15 years 1 months ago
2011
We present a general rule induction algorithm based on sequential covering, suitable for variable consistency rough set approaches. This algorithm, called VC-DomLEM, can be used f...