Wrappers for feature subset selection
Artificial Intelligence - Special issue on relevance
Microarrays for an Integrative Genomics
Microarrays for an Integrative Genomics
Time and sample efficient discovery of Markov blankets and direct causal relations
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A theoretical characterization of linear SVM-based feature selection
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
Feature Extraction: Foundations and Applications (Studies in Fuzziness and Soft Computing)
A comparison of novel and state-of-the-art polynomial Bayesian network learning algorithms
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
Learning graphical model structure using L1-regularization paths
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The Journal of Machine Learning Research
Algorithms for discovery of multiple markov boundaries: application to the molecular signature multiplicity problem
Learning bayesian network structure from massive datasets: the «sparse candidate« algorithm
UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
Strong completeness and faithfulness in Bayesian networks
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
The Journal of Machine Learning Research
Learning patient-specific predictive models from clinical data
Journal of Biomedical Informatics
Introduction to Causal Inference
The Journal of Machine Learning Research
Learning Instance-Specific Predictive Models
The Journal of Machine Learning Research
International Journal of Bioinformatics Research and Applications
International Journal of Bioinformatics Research and Applications
Analysis of nasopharyngeal carcinoma risk factors with Bayesian networks
Artificial Intelligence in Medicine
Editorial: Occupation inference through detection and classification of biographical activities
Data & Knowledge Engineering
Towards integrative causal analysis of heterogeneous data sets and studies
The Journal of Machine Learning Research
Learning from mixture of experimental data: a constraint---based approach
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
A Bayesian stochastic search method for discovering Markov boundaries
Knowledge-Based Systems
Learning the local Bayesian network structure around the ZNF217 oncogene in breast tumours
Computers in Biology and Medicine
Artificial Intelligence in Medicine
Algorithms for discovery of multiple Markov boundaries
The Journal of Machine Learning Research
Sub-local constraint-based learning of Bayesian networks using a joint dependence criterion
The Journal of Machine Learning Research
Intelligent Data Analysis
Profit optimizing customer churn prediction with Bayesian network classifiers
Intelligent Data Analysis - Business Analytics and Intelligent Optimization
Hi-index | 0.00 |
In part I of this work we introduced and evaluated the Generalized Local Learning (GLL) framework for producing local causal and Markov blanket induction algorithms. In the present second part we analyze the behavior of GLL algorithms and provide extensions to the core methods. Specifically, we investigate the empirical convergence of GLL to the true local neighborhood as a function of sample size. Moreover, we study how predictivity improves with increasing sample size. Then we investigate how sensitive are the algorithms to multiple statistical testing, especially in the presence of many irrelevant features. Next we discuss the role of the algorithm parameters and also show that Markov blanket and causal graph concepts can be used to understand deviations from optimality of state-of-the-art non-causal algorithms. The present paper also introduces the following extensions to the core GLL framework: parallel and distributed versions of GLL algorithms, versions with false discovery rate control, strategies for constructing novel heuristics for specific domains, and divide-and-conquer local-to-global learning (LGL) strategies. We test the generality of the LGL approach by deriving a novel LGL-based algorithm that compares favorably to the state-of-the-art global learning algorithms. In addition, we investigate the use of non-causal feature selection methods to facilitate global learning. Open problems and future research paths related to local and local-to-global causal learning are discussed.