Sciweavers

32 search results - page 4 / 7
» Mining association rules with multiple Min-supports - Applic...
Sort
View
KDD
1998
ACM
122views Data Mining» more  KDD 1998»
13 years 11 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...
BMCBI
2006
109views more  BMCBI 2006»
13 years 7 months ago
Integrated analysis of gene expression by association rules discovery
Background: Microarray technology is generating huge amounts of data about the expression level of thousands of genes, or even whole genomes, across different experimental conditi...
Pedro Carmona-Saez, Monica Chagoyen, Andrés...
ICDE
1995
IEEE
139views Database» more  ICDE 1995»
14 years 8 months ago
Set-Oriented Mining for Association Rules in Relational Databases
We describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less escient than special-purpose...
Maurice A. W. Houtsma, Arun N. Swami
KDD
2002
ACM
145views Data Mining» more  KDD 2002»
14 years 7 months ago
Handling very large numbers of association rules in the analysis of microarray data
The problem of analyzing microarray data became one of important topics in bioinformatics over the past several years, and different data mining techniques have been proposed for ...
Alexander Tuzhilin, Gediminas Adomavicius
ICDM
2002
IEEE
145views Data Mining» more  ICDM 2002»
14 years 12 days ago
Mining Top-K Frequent Closed Patterns without Minimum Support
In this paper, we propose a new mining task: mining top-k frequent closed patterns of length no less than min , where k is the desired number of frequent closed patterns to be min...
Jiawei Han, Jianyong Wang, Ying Lu, Petre Tzvetkov