Extracting generic basis of association rules from SAGE data
暂无分享,去创建一个
[1] Salvatore Orlando,et al. DCI Closed: A Fast and Memory Efficient Algorithm to Mine Frequent Closed Itemsets , 2004, FIMI.
[2] C. Becquet,et al. Strong-association-rule mining for large-scale gene-expression data analysis: a case study on human SAGE data , 2002, Genome Biology.
[3] Jean-François Boulicaut,et al. Using transposition for pattern discovery from microarray data , 2003, DMKD '03.
[4] Mohammed J. Zaki. Data Mining In Bioinformatics (Advanced Information and Knowledge Processing) , 2004 .
[5] Gerd Stumme,et al. Mining Minimal Non-redundant Association Rules Using Frequent Closed Itemsets , 2000, Computational Logic.
[6] Engelbert Mephu Nguifo,et al. Étude et conception d'algorithmes de génération de concepts formels , 2004, Ingénierie des Systèmes d Inf..
[7] Marzena Kryszkiewicz,et al. Representative Association Rules and Minimum Condition Maximum Consequence Association Rules , 1998, PKDD.
[8] Mohammed J. Zaki,et al. CHARM: An Efficient Algorithm for Closed Itemset Mining , 2002, SDM.
[9] Jean-François Boulicaut,et al. Constraint-based concept mining and its application to microarray data analysis , 2005, Intell. Data Anal..
[10] Yi-Ping Phoebe Chen,et al. Bioinformatics Technologies , 2005 .
[11] Sadok Ben Yahia,et al. Prince: An Algorithm for Generating Rule Bases Without Closure Computations , 2005, DaWaK.
[12] Engelbert Mephu Nguifo,et al. A new Informative Generic Base of Association Rules , 2005, CLA.
[13] Engelbert Mephu Nguifo,et al. Discovering "Factual" and "Implicative" generic association rules , 2005, CAP.
[14] Hiroki Arimura,et al. LCM ver. 2: Efficient Mining Algorithms for Frequent/Closed/Maximal Itemsets , 2004, FIMI.
[15] Mohammed J. Zaki. Generating non-redundant association rules , 2000, KDD '00.