Sciweavers

6388 search results - page 25 / 1278
» High Performance Data Mining
Sort
View
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
15 years 7 months ago
Memory Placement Techniques for Parallel Association Mining
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
Srinivasan Parthasarathy, Mohammed Javeed Zaki, We...
152
Voted
SBACPAD
2003
IEEE
180views Hardware» more  SBACPAD 2003»
15 years 8 months ago
New Parallel Algorithms for Frequent Itemset Mining in Very Large Databases
Frequent itemset mining is a classic problem in data mining. It is a non-supervised process which concerns in finding frequent patterns (or itemsets) hidden in large volumes of d...
Adriano Veloso, Wagner Meira Jr., Srinivasan Parth...
EDBT
2008
ACM
172views Database» more  EDBT 2008»
16 years 3 months ago
Distributed privacy preserving k-means clustering with additive secret sharing
Recent concerns about privacy issues motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. However, the curr...
Albert Levi, Erkay Savas, Mahir Can Doganay, Thoma...
124
Voted
FIMI
2004
212views Data Mining» more  FIMI 2004»
15 years 4 months ago
A Space Optimization for FP-Growth
Frequency mining problem comprises the core of several data mining algorithms. Among frequent pattern discovery algorithms, FP-GROWTH employs a unique search strategy using compac...
Eray Özkural, Cevdet Aykanat
132
Voted
ICDM
2003
IEEE
184views Data Mining» more  ICDM 2003»
15 years 8 months ago
Analyzing High-Dimensional Data by Subspace Validity
We are proposing a novel method that makes it possible to analyze high dimensional data with arbitrary shaped projected clusters and high noise levels. At the core of our method l...
Amihood Amir, Reuven Kashi, Nathan S. Netanyahu, D...