Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Towards data mining benchmarking: a test bed for performance study of frequent pattern mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Theoretical Computer Science - Selected papers in honour of Setsuo Arikawa
Mining confident co-location rules without a support threshold
Proceedings of the 2003 ACM symposium on Applied computing
Carpenter: finding closed patterns in long biological datasets
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
FARMER: finding interesting rule groups in microarray datasets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Cluster Analysis for Gene Expression Data: A Survey
IEEE Transactions on Knowledge and Data Engineering
Mining Frequent Closed Patterns in Microarray Data
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Mining top-K covering rule groups for gene expression data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
On discovery of maximal confident rules without support pruning in microarray data
Proceedings of the 5th international workshop on Bioinformatics
Identification of Co-regulated Signature Genes in Pancreas Cancer- A Data Mining Approach
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues
Association Analysis Techniques for Bioinformatics Problems
BICoB '09 Proceedings of the 1st International Conference on Bioinformatics and Computational Biology
An association analysis approach to biclustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
A novel hybrid feature selection method for microarray data analysis
Applied Soft Computing
A gene selection method for microarray data based on sampling
ICCCI'10 Proceedings of the Second international conference on Computational collective intelligence: technologies and applications - Volume Part II
Constructing gene regulatory networks from microarray data using GA/PSO with DTW
Applied Soft Computing
An efficient and scalable algorithm for mining maximal
MLDM'13 Proceedings of the 9th international conference on Machine Learning and Data Mining in Pattern Recognition
| Hi-index | 0.00 |
We present an association rule mining method for mining high confidence rules, which describe interesting gene relationships from microarray datasets. Microarray datasets typically contain an order of magnitude more genes than experiments, rendering many data mining methods impractical as they are optimised for sparse datasets. A new family of row-enumeration rule mining algorithms have emerged to facilitate mining in dense datasets. These algorithms rely on pruning infrequent relationships to reduce the search space by using the support measure. This major shortcoming results in the pruning of many potentially interesting rules with low support but high confidence. We propose a new row-enumeration rule mining method, MaxConf, to mine high confidence rules from microarray data. MaxConf is a support-free algorithm which directly uses the confidence measure to effectively prune the search space. Experiments on three microarray datasets show that MaxConf outperforms support-based rule mining with respect to scalability and rule extraction. Furthermore, detailed biological analyses demonstrate the effectiveness of our approach -- the rules discovered by MaxConf are substantially more interesting and meaningful compared with support-based methods.