Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Feature selection for high-dimensional genomic microarray data
ICML '01 Proceedings of the Eighteenth International Conference on Machine Learning
FARMER: finding interesting rule groups in microarray datasets
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Mining Frequent Closed Patterns in Microarray Data
ICDM '04 Proceedings of the Fourth IEEE International Conference on Data Mining
Cancer classification and prediction using logistic regression with Bayesian gene selection
Journal of Biomedical Informatics - Special issue: Biomedical machine learning
Mining top-K covering rule groups for gene expression data
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Predictive neural networks for gene expression data analysis
Neural Networks
Computers and Operations Research
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
The Minimum Description Length Principle (Adaptive Computation and Machine Learning)
ACM Transactions on Knowledge Discovery from Data (TKDD)
A study of cross-validation and bootstrap for accuracy estimation and model selection
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Nonparametric multivariate density estimation: a comparative study
IEEE Transactions on Signal Processing
Grammatical inference with bioinformatics criteria
Neurocomputing
Graph embedding based feature selection
Neurocomputing
Translation Invariance in the Polynomial Kernel Space and Its Applications in kNN Classification
Neural Processing Letters
Hi-index | 0.01 |
Association rules have been widely used in gene expression data analysis. However, there is no systematical way to select interesting rules from the millions of rules generated from high dimensional gene expression data. In this study, a kernel density estimation based measurement is proposed to evaluate the interestingness of the association rules. Several pruning strategies are also devised to efficiently discover the approximate top-k interesting patterns. Finally, over-fitting problem of the classification model is addressed by using conditional independence test to eliminate redundant rules. Experimental results show the effectiveness of the proposed interestingness measure and classification model.