学习选择最大团算法:从传统机器学习到双通道混合神经架构
Instance-Aware Algorithm Selection for Maximum Clique via a Dual-Channel Graph Neural Architecture
AI总结:
针对最大团问题(MCP)无单一算法普遍最优的挑战,提出基于传统机器学习和图神经网络的算法选择框架,构建基准数据集并开发GAT-MLP双通道模型,实现90.43%的最优求解器选择准确率。
摘要:
最大团问题(MCP)是一个NP难问题,在生物信息学、网络科学和社会计算等领域有广泛应用,但没有任何单一算法能在所有不同图实例上始终优于其他算法。这凸显了实例感知算法选择的迫切需求,而该领域在MCP上仍基本未被探索。为填补这一空白,我们提出了一种新颖的基于学习框架,该框架融合了传统机器学习与图神经网络。我们首先通过在多样化的图集合上执行四种最先进的精确MCP求解器并提取结构特征,构建了一个基准数据集。对传统分类器的评估表明,随机森林是一个强基线,并揭示了连通性和拓扑特征是性能的关键预测因子。基于这些见解,我们开发了GAT-MLP,一种双通道模型,结合了图注意力网络(GAT)编码局部图结构和多层感知器(MLP)建模全局特征。实验表明,GAT-MLP优于所有基线,且我们的选择器显著优于单一最佳求解器。我们的结果凸显了双通道架构的有效性以及图神经网络在组合算法选择中的前景,在选取最优求解器上达到了90.43%的准确率。代码和模型可在以下网址获取:this https URL。
英文摘要:
Although the Maximum Clique Problem (MCP) has been extensively studied and features a rich ecosystem of exact solvers, empirical evidence shows that solver performance varies substantially across graph families. Consequently, selecting an appropriate algorithm for a given instance remains an open and practically important challenge that has received little systematic attention. We address this gap by developing an instance-aware selection framework that systematically combines global statistical descriptors with learned topological representations. We construct a comprehensive benchmark by evaluating four state-of-the-art exact solvers on a diverse collection of graph instances and deriving both global statistical and local structural features. An evaluation of conventional classifiers establishes Random Forest as a strong baseline and reveals that connectivity and topological features are key predictors of performance. Motivated by these observations, we introduce a dual-channel architecture that jointly leverages a Graph Attention Network for capturing local neighborhood patterns and a Multilayer Perceptron for modeling global statistical features. Extensive experiments show that the proposed dual-channel model consistently surpasses classical baselines and the single-best solver, achieving 90.43% test accuracy. These findings demonstrate the value of integrating local topological encoding with global statistical cues for combinatorial algorithm selection. Code and models are available at: https://anonymous.4open.science/r/GAT-MLP-7E5F.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。