Feature selection based on the best-path algorithm in high dimensional graphical models

DOI10.1016/J.INS.2023.119601MaRDI QIDQ6488758zbMATH OpenFDO

Authors Luigi Riso, Maria Grazia Zoia, Consuelo Rubina Nava

Publication date 19 October 2023

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.INS.2023.119601

zbMATH Keywords

automatic feature selectionChow-Liu algorithmeconometric linear modelsgraphical modelsmutual information

Mathematics Subject Classification ID

Probabilistic graphical models (62H22) Applications of statistics to economics (62P20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• A Graph-Based Approach to Feature Selection
• A greedy feature selection algorithm for big data of high dimensionality
• Benchmark for filter methods for feature selection in high-dimensional classification data
• scientific article; zbMATH DE number 1927195
• scientific article; zbMATH DE number 1691504

Cites work

• 10.1162/153244303322753616
• A novel Chow-Liu algorithm and its application to gene differential analysis
• Approximating discrete probability distributions with dependence trees
• Approximating probability distributions to reduce storage requirements
• Entropy coefficient of determination for generalized linear models
• Entropy correlation coefficient for measuring predictive power of generalized linear models
• Generating the maximum spanning trees of a weighted graph
• Graphical models
• Graphical models with R.
• High-dimensional macroeconomic forecasting and variable selection via penalized regression
• scientific article; zbMATH DE number 5957250 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• scientific article; zbMATH DE number 2135362 (Why is no real title available?)
• Information theoretic inequalities
• Multivariate adaptive regression splines
• On over-fitting in model selection and subsequent selection bias in performance evaluation
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Regularization and Variable Selection Via the Elastic Net

Cited in

(2)

• Optimality of Graphlet Screening in High Dimensional Variable Selection
• Adaptive Feature Selection Based on the Most Informative Graph-Based Features

This page was built for publication: Feature selection based on the best-path algorithm in high dimensional graphical models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6488758)