Sciweavers

388 search results - page 50 / 78
» Mining Frequent Itemsets Using Support Constraints
Sort
View
KDD
2007
ACM
165views Data Mining» more  KDD 2007»
14 years 8 months ago
Finding low-entropy sets and trees from binary data
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
Eino Hinkkanen, Hannes Heikinheimo, Heikki Mannila...
BIBM
2007
IEEE
171views Bioinformatics» more  BIBM 2007»
14 years 1 months ago
GenMiner: Mining Informative Association Rules from Genomic Data
GENMINER is a smart adaptation of closed itemsets based association rules extraction to genomic data. It takes advantage of the novel NORDI discretization method and of the CLOSE ...
Ricardo Martínez, Claude Pasquier, Nicolas ...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
KBSE
2009
IEEE
14 years 2 months ago
Alattin: Mining Alternative Patterns for Detecting Neglected Conditions
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...
Suresh Thummalapenta, Tao Xie
HAIS
2011
Springer
12 years 11 months ago
Evolving Temporal Fuzzy Association Rules from Quantitative Data with a Multi-Objective Evolutionary Algorithm
A novel method for mining association rules that are both quantitative and temporal using a multi-objective evolutionary algorithm is presented. This method successfully identifie...
Stephen G. Matthews, Mario A. Góngora, Adri...