160 search results - page 10 / 32 » Highly Scalable Rough Set Reducts Generation |
TCAD
2008
13 years 9 months ago
2008
BDDs have proven to be an efficient means to represent and manipulate Boolean formulae [1] and sets [2] due to their compactness and canonicality. In this work, we leverage the eff...
KDD
2003
ACM
14 years 10 months ago
2003
ACM
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
ADMA
2008
Springer
13 years 11 months ago
2008
Springer
We investigate the effects of dimensionality reduction using different techniques and different dimensions on six two-class data sets with numerical attributes as pre-processing fo...
SIGMOD
2011
ACM
13 years 19 days ago
2011
ACM
Today’s one-pass analytics applications tend to be data-intensive in nature and require the ability to process high volumes of data efficiently. MapReduce is a popular programm...
IJFCS
2008
13 years 9 months ago
2008
In data mining applications, highly sized contexts are handled what usually results in a considerably large set of frequent itemsets, even for high values of the minimum support t...