Mathematics, Volume 11, Issue 11
2023 June-1 - 183 articles
Cover Story: Graphical log-linear models are effective for modeling complex interactions between discrete variables; however, model selection for high-dimensional data is a difficult task. Many existing model selection methods are stepwise methods that rely on the properties of decomposable graphs. These methods restrict the pool of candidate models that they can search from, and they are difficult to scale. It can be shown that a non-decomposable model can be approximated by a decomposable model, thus extending the convenient computational properties of decomposable models to any model. This paper proposes a local genetic algorithm with a crossover hill-climbing operator, adapted for log-linear graphical models, showing that the graphical local genetic algorithm can be used successfully to fit non-decomposable models for both a low number of variables and a high number of variables. View this paper - Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
- You may sign up for email alerts to receive table of contents of newly released issues.
- PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.