Sciweavers

62 search results - page 2 / 13
» Efficient Data Structures and Parallel Algorithms for Associ...
Sort
View
SIGMOD
1997
ACM
134views Database» more  SIGMOD 1997»
13 years 9 months ago
Scalable Parallel Data Mining for Association Rules
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
Eui-Hong Han, George Karypis, Vipin Kumar
DMIN
2006
103views Data Mining» more  DMIN 2006»
13 years 6 months ago
Modeling of the counter-examples and association rules interestingness measures behavior
Association rules discovery is one of the most important tasks in Knowledge Discovery in Data Bases. Since the initial APRIORI algorithm, many efforts have been done in order to de...
Benoît Vaillant, Stéphane Lallich, Ph...
DAWAK
1999
Springer
13 years 9 months ago
Implementation of Multidimensional Index Structures for Knowledge Discovery in Relational Databases
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
Stefan Berchtold, Christian Böhm, Hans-Peter ...
KDD
1997
ACM
208views Data Mining» more  KDD 1997»
13 years 8 months ago
Metarule-Guided Mining of Multi-Dimensional Association Rules Using Data Cubes
In this paper, we employ a novel approach to metarule-guided, multi-dimensional association rule mining which explores a data cube structure. We propose algorithms for metarule-gu...
Micheline Kamber, Jiawei Han, Jenny Chiang
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 9 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...