arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2101.07766stat.MEstat.COstat.ML
收藏

基于代价的网络模型特征选择

Cost-based feature selection for network model choice

Louis Raynal, Till Hoffmann, Jukka-Pekka Onnela

摘要:

在机器学习和近似贝叶斯计算中,从大量可能有噪声的候选者中选择一小部分信息特征是一个具有挑战性的问题。在实践中,计算信息特征的成本也需要考虑。这对于网络来说尤其重要,因为单个特征的计算成本可以跨越几个数量级。我们使用两种方法来解决网络模型选择问题。首先,我们采用了九种特征选择方法来考虑特征的成本。我们证明了两类网络模型的成本可以降低两个数量级,而不会显着影响分类精度(正确识别模型的比例)。其次,我们使用较小网络的试点模拟来选择特征。这种方法将计算成本降低了50倍,而不影响分类精度。为了证明我们的方法的实用性,我们将其应用于三种不同的酵母蛋白质相互作用网络,并确定了最佳拟合的重复发散模型。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑