Sciweavers

114 search results - page 1 / 23
» Generating an informative cover for association rules
Sort
View
ICDM
2002
IEEE
153views Data Mining» more  ICDM 2002»
13 years 9 months ago
Generating an informative cover for association rules
Mining association rules may generate a large numbers of rules making the results hard to analyze manually. Pasquier et al. have discussed the generation of GuiguesDuquenne–Luxe...
Laurentiu Cristofor, Dan A. Simovici
RSFDGRC
2005
Springer
110views Data Mining» more  RSFDGRC 2005»
13 years 9 months ago
A Rough Set Based Model to Rank the Importance of Association Rules
Abstract. Association rule algorithms often generate an excessive number of rules, many of which are not significant. It is difficult to determine which rules are more useful, int...
Jiye Li, Nick Cercone
CIKM
2001
Springer
13 years 8 months ago
Efficient Runtime Generation of Association Rules
Richard Relue, Xindong Wu, Hao Huang
SIGMOD
2005
ACM
161views Database» more  SIGMOD 2005»
14 years 4 months ago
Mining Top-k Covering Rule Groups for Gene Expression Data
In this paper, we propose a novel algorithm to discover the topk covering rule groups for each row of gene expression profiles. Several experiments on real bioinformatics datasets...
Gao Cong, Kian-Lee Tan, Anthony K. H. Tung, Xin Xu
BIBM
2007
IEEE
171views Bioinformatics» more  BIBM 2007»
13 years 10 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 ...