Sciweavers

851 search results - page 128 / 171
» On the Complexity of Mining Association Rules
Sort
View
DKE
2008
124views more  DKE 2008»
13 years 8 months ago
A MaxMin approach for hiding frequent itemsets
In this paper, we are proposing a new algorithmic approach for sanitizing raw data from sensitive knowledge in the context of mining of association rules. The new approach (a) rel...
George V. Moustakides, Vassilios S. Verykios
IDA
2010
Springer
14 years 20 days ago
Deterministic Finite Automata in the Detection of EEG Spikes and Seizures
This Paper presents a platform to mine epileptiform activity from Electroencephalograms (EEG) by combining the methodologies of Deterministic Finite Automata (DFA) and Knowledge Di...
Rory A. Lewis, Doron Shmueli, Andrew M. White
IDEAS
1999
IEEE
175views Database» more  IDEAS 1999»
14 years 29 days ago
A Parallel Scalable Infrastructure for OLAP and Data Mining
Decision support systems are important in leveraging information present in data warehouses in businesses like banking, insurance, retail and health-care among many others. The mu...
Sanjay Goil, Alok N. Choudhary
SEMCO
2008
IEEE
14 years 3 months ago
A Comparative Study of Feature Extraction Algorithms in Customer Reviews
The paper systematically compares two feature extraction algorithms to mine product features commented on in customer reviews. The first approach [17] identifies candidate featu...
Liliana Ferreira, Niklas Jakob, Iryna Gurevych
KES
2004
Springer
14 years 2 months ago
FIT: A Fast Algorithm for Discovering Frequent Itemsets in Large Databases
Association rule mining is an important data mining problem that has been studied extensively. In this paper, a simple but Fast algorithm for Intersecting attribute lists using a ...
Jun Luo, Sanguthevar Rajasekaran