Cost-based Feature Selection for Network Model Choice

DOI10.1080/10618600.2022.2151453MaRDI QIDQ6180742zbMATH OpenFDO

Authors Louis Raynal, J.-P. Onnela

Publication date 22 January 2024

Published in Journal of Computational and Graphical Statistics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2101.07766

zbMATH Keywords

feature selectionclassificationapproximate Bayesian computationcost-based feature selectionmechanistic network models

Mathematics Subject Classification ID

Statistics (62-XX)

Abstract: Selecting a small set of informative features from a large number of possibly noisy candidates is a challenging problem with many applications in machine learning and approximate Bayesian computation. In practice, the cost of computing informative features also needs to be considered. This is particularly important for networks because the computational costs of individual features can span several orders of magnitude. We addressed this issue for the network model selection problem using two approaches. First, we adapted nine feature selection methods to account for the cost of features. We show for two classes of network models that the cost can be reduced by two orders of magnitude without considerably affecting classification accuracy (proportion of correctly identified models). Second, we selected features using pilot simulations with smaller networks. This approach reduced the computational cost by a factor of 50 without affecting classification accuracy. To demonstrate the utility of our approach, we applied it to three different yeast protein interaction networks and identified the best-fitting duplication divergence model.

Cites work

• scientific article; zbMATH DE number 3860199 (Why is no real title available?)
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• scientific article; zbMATH DE number 903777 (Why is no real title available?)
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• A Mathematical Theory of Communication
• A random forest guided tour
• Choosing the summary statistics and the acceptance rate in approximate Bayesian computation
• Conditional likelihood maximisation: a unifying framework for information theoretic feature selection
• Emergence of Scaling in Random Networks
• Handbook of approximate Bayesian computation
• Information theoretic measures for clusterings comparison: variants, properties, normalization and correction for chance
• New insights into approximate Bayesian computation
• Random forests
• Selection of relevant features and examples in machine learning

Cited in

(1)

• Unifying summary statistic selection for approximate Bayesian computation

This page was built for publication: Cost-based Feature Selection for Network Model Choice

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