Sciweavers

860 search results - page 117 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
JMLR
2010
116views more  JMLR 2010»
13 years 2 months ago
Feature Selection, Association Rules Network and Theory Building
As the size and dimensionality of data sets increase, the task of feature selection has become increasingly important. In this paper we demonstrate how association rules can be us...
Sanjay Chawla
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 22 days ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
CEC
2010
IEEE
13 years 9 months ago
Improving GP classification performance by injection of decision trees
This paper presents a novel hybrid method combining genetic programming and decision tree learning. The method starts by estimating a benchmark level of reasonable accuracy, based ...
Rikard König, Ulf Johansson, Tuve Löfstr...
PAKDD
2010
ACM
146views Data Mining» more  PAKDD 2010»
14 years 21 days ago
Mining Antagonistic Communities from Social Networks
During social interactions in a community, there are often sub-communities that behave in opposite manner. These antagonistic sub-communities could represent groups of people with ...
Kuan Zhang, David Lo, Ee-Peng Lim
ACSAC
2010
IEEE
12 years 11 months ago
A quantitative analysis of the insecurity of embedded network devices: results of a wide-area scan
We present a quantitative lower bound on the number of vulnerable embedded device on a global scale. Over the past year, we have systematically scanned large portions of the inter...
Ang Cui, Salvatore J. Stolfo