Strong Association Rules Mining Without Using Frequent Items for Microarray Analysis

被引：0

作者：

Wang, Miao ^{[1
]}

Shang, Xuequn ^{[1
]}

Zhao, Qian ^{[1
]}

Li, Zhanhuai ^{[1
]}

机构：

[1] Northwestern Polytech Univ, Sch Comp Sci & Engn, Xian 710072, Peoples R China

来源：

2009 3RD INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING, VOLS 1-11 | 2009年

关键词：

strong association rules; forward combined; backward combined; closed rules;

D O I：

暂无

中图分类号：

R318 [生物医学工程];

学科分类号：

0831 ;

摘要：

Microarray technology has created a revolution in the field of biological research. Association rules can not only group the similarly expressed genes but also discern relationships among genes. However, the efficiency of traditional method to generate association rules is not very well. We develop a novel algorithm, SAW, to generate strong association rules by combining the paired rules, which can avoid lots of unnecessary computing that traditional method often encounter. The experiments show our method is more efficiently than FARMER.

引用

页码：618 / 622

页数：5

共 50 条

[31] Mining Interesting Disjunctive Association Rules from Unfrequent Items
Hilali, Ines
Jen, Tao-Yuan
Laurent, Dominique
Marinica, Claudia
Ben Yahia, Sadok
INFORMATION SEARCH, INTEGRATION, AND PERSONALIZATION, 2014, 421 : 84 - 99
[32] A Framework for Mining Fuzzy Association Rules from Composite Items
Muyeba, Maybin
Khan, M. Sulaiman
Coenen, Frans
NEW FRONTIERS IN APPLIED DATA MINING, 2009, 5433 : 62 - +
[33] Efficient association rule mining among both frequent and infrequent items
Zhou, Ling
Yau, Stephen
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2007, 54 (06) : 737 - 749
[34] Negative and Positive Association Rules Mining from Text Using Frequent and Infrequent Itemsets
Mahmood, Sajid
Shahbaz, Muhammad
Guergachi, Aziz
SCIENTIFIC WORLD JOURNAL, 2014,
[35] Mining minimal non-redundant association rules using frequent closed itemsets
Bastide, I
Pasquier, N
Taouil, R
Stumme, G
Lakhal, L
COMPUTATIONAL LOGIC - CL 2000, 2000, 1861 : 972 - 986
[36] Closed frequent itemsets mining and structuring association rules based on Q-analysis
Boulmakoul, Azedine
Idri, Abdelfatah
Marghoubi, Rabia
2007 IEEE INTERNATIONAL SYMPOSIUM ON SIGNAL PROCESSING AND INFORMATION TECHNOLOGY, VOLS 1-3, 2007, : 126 - 131
[37] Mining Association Rules in Graphs Based on Frequent Cohesive Itemsets
Hendrickx, Tayena
Cule, Boris
Meysman, Pieter
Naulaerts, Stefan
Laukens, Kris
Goethals, Bart
ADVANCES IN KNOWLEDGE DISCOVERY AND DATA MINING, PART II, 2015, 9078 : 637 - 648
[38] Efficiently mining maximal frequent sets for discovering association rules
Srikumar, K
Bhasker, B
SEVENTH INTERNATIONAL DATABASE ENGINEERING AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2003, : 104 - 110
[39] Exploding number of frequent itemsets in the mining of negative association rules
Ma, Zhanxin
Lu, Yuchang
Qinghua Daxue Xuebao/Journal of Tsinghua University, 2007, 47 (07): : 1212 - 1215
[40] Mining generalized association rules based on frequent pattern tree
Li, Nai-Qian
Shen, Jun-Yi
Song, Qin-Bao
2002, Shenyang Institute of Computing Technology (23):

← 1 2 3 4 5 →