返回
Dendrograms, minimum spanning trees and feature selection
DOI:10.1016/j.ejor.2022.11.031.png)
摘要
En 中文
Feature selection is a fundamental process to avoid overfitting and to reduce the size of databases with-out significant loss of information that applies to hierarchical clustering. Dendrograms are graphical rep-resentations of hierarchical clustering algorithms that for single linkage clustering can be interpreted as minimum spanning trees in the complete network defined by the database. In this work, we introduce the problem that determines jointly a set of features and a dendrogram, according to the single linkage method. We propose different formulations that include the minimum spanning tree problem constraints as well as the feature selection constraints. Different bounds on the objective function are studied. For one of the models, several families of valid inequalities are proposed and the problem of separating them is studied. For another formulation, a decomposition algorithm is designed. In an extensive computa-tional study, the effectiveness of the different models is discussed, the model with valid inequalities is compared with the decomposition algorithm. The computational results also illustrate that the integration of feature selection to the optimization model allows to keep a satisfactory percentage of information.(c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )
Keyword:
Combinatorial optimization
Feature selection
Hierarchical clustering
Single linkage
Minimum spanning tree
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Spatial disparity and hierarchical cluster analysis of final energy consumption in China中国最终能源消费的空间差异与层次聚类分析
ENERGY
IF9.4

