Sciweavers

148 search results - page 15 / 30
» Partitioning strategies for distributed association rule min...
Sort
View
ADMA
2010
Springer
248views Data Mining» more  ADMA 2010»
13 years 5 months ago
Classification Inductive Rule Learning with Negated Features
This paper reports on an investigation to compare a number of strategies to include negated features within the process of Inductive Rule Learning (IRL). The emphasis is on generat...
Stephanie Chua, Frans Coenen, Grant Malcolm
CIKM
2001
Springer
13 years 11 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 11 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
KDD
2004
ACM
160views Data Mining» more  KDD 2004»
14 years 8 months ago
k-TTP: a new privacy model for large-scale distributed environments
Secure multiparty computation allows parties to jointly compute a function of their private inputs without revealing anything but the output. Theoretical results [2] provide a gen...
Bobi Gilburd, Assaf Schuster, Ran Wolff
AI
2004
Springer
14 years 1 months ago
Distributed Data Mining vs. Sampling Techniques: A Comparison
To address the of mining a huge volume of geographically distributed databases, we propose two approaches. The first one is to download only a sample of each database. The second ...
Mohamed Aounallah, Sébastien Quirion, Guy W...