Article
Management
Martine Labbe, Mercedes Landete, Marina Leal
Summary: This study introduces the problem of jointly determining a set of features and a dendrogram according to the single linkage method, proposing different formulations and studying different bounds on the objective function. The effectiveness of the different models is discussed through extensive computational study, comparing the model with valid inequalities to the decomposition algorithm. The computational results also demonstrate that integrating feature selection into the optimization model allows for a satisfactory percentage of information to be preserved.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
(2023)
Article
Computer Science, Artificial Intelligence
Dongdong Cheng, Qingsheng Zhu, Jinlong Huang, Quanwang Wu, Lijun Yang
Summary: The paper introduces a novel MST-based clustering algorithm LDP-MST, which utilizes local density peaks and a new distance measurement method to effectively discover clusters with complex structures. The experimental results demonstrate that the proposed algorithm is competitive with state-of-the-art methods in cluster discovery.
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
(2021)
Article
Computer Science, Artificial Intelligence
Yang Li, Wenju Zhou
Summary: This paper proposes a minimum spanning tree clustering algorithm based on fuzzy distance to address the shortcomings of the minimum spanning tree algorithm in handling unbalanced data. By introducing neighbourhood rough set theory to measure the distances between data points, and using the Prim algorithm to solve the minimum spanning tree problem, the algorithm achieves clustering by partitioning the minimum spanning tree. Experimental results show that the proposed algorithm performs well, especially in face recognition.
COGNITIVE COMPUTATION
(2022)
Article
Computer Science, Artificial Intelligence
Ali Senol
Summary: In this study, a novel clustering algorithm called MCMSTClustering is proposed to handle high-dimensional, imbalanced, and/or varying-density datasets. The algorithm defines micro-clusters using KD-Tree data structure, constructs macro-clusters using minimum spanning tree on micro-clusters, and regulates defined clusters to improve accuracy. Experimental results confirm the success of the proposed algorithm in terms of clustering quality and acceptable run-time, and its effectiveness in solving various clustering problems in the literature.
NEURAL COMPUTING & APPLICATIONS
(2023)
Article
Computer Science, Interdisciplinary Applications
Michael Segal, Oren Tzfaty
Summary: The bounded-diameter minimum spanning tree problem seeks to find a minimum weight spanning tree on a connected, weighted, undirected graph G with a diameter no more than D. A new algorithm has been developed that can handle graphs with non-negative weights and has been proven to have a certain performance ratio. The algorithm's performance has been evaluated empirically as well.
COMPUTERS & OPERATIONS RESEARCH
(2022)
Article
Computer Science, Artificial Intelligence
Prem Prakash Vuppuluri, Patvardhan Chellapilla
Summary: This article presents a two-phase memetic algorithm for the BDMST problem that combines a specialized recombination operator with good heuristics, showing superior solution quality and reduced computational effort in comparison to existing meta-heuristics in computational experiments.
Article
Physics, Multidisciplinary
Shufan Zhang, Jianlin Mao, Niya Wang, Dayan Li, Chengan Ju
Summary: This study proposes a clustering-enhanced memetic algorithm to solve the quadratic minimum spanning tree problem. By using a population initialization method, a tabu-based nearby exploration phase, a three-parent combination operator, and a mutation operator, the algorithm achieves competitive results compared to state-of-the-art approaches.
Article
Computer Science, Artificial Intelligence
Amna Habib, Muhammad Akram, Cengiz Kahraman
Summary: This paper proposes a graph theory-based agglomerative hierarchical clustering technique for Pythagorean fuzzy sets. By considering uncertain parameters and qualitative aspects in the expression, the algorithm demonstrates practicality and efficiency in clustering problems in complex networks.
EXPERT SYSTEMS WITH APPLICATIONS
(2022)
Article
Computer Science, Interdisciplinary Applications
Cesar Rego, Frank Mathew
Summary: We develop a scatter search algorithm to solve the classical capacitated minimum spanning tree problem, including both homogeneous and heterogeneous variants. This problem is central in network design applications in industrial engineering, routing and logistics, and communication networks. Since it is an NP-Complete problem, heuristic solution methods are necessary to find high-quality solutions within practical time limits. Our proposed algorithm competes with the best algorithms in the literature and avoids complicated artifacts.
ADVANCES IN ENGINEERING SOFTWARE
(2023)
Article
Mathematics
Zhuoran Wang, Dian Ouyang, Yikun Wang, Qi Liang, Zhuo Huang
Summary: Computing directed Minimum Spanning Tree (DMST) is a fundamental problem in graph theory, applied in various fields such as computer network, communication protocol design, revenue maximization in social networks, and syntactic parsing in Natural Language Processing. This paper proposes an indexed approach that reuses computation results for single and batch queries of DMST, achieving significant speedup while consuming minimal index size.
Article
Computer Science, Information Systems
Weixing Wang, Angyan Tu, Fredrik Bergholm
Summary: This study proposes a new method for image segmentation based on graph theory and guided feathering. It effectively addresses the challenges posed by intertwined objects and backgrounds, vague boundaries, and similar textures, resulting in improved segmentation accuracy for images with variable targets.
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS
(2022)
Article
Computer Science, Interdisciplinary Applications
Alexander V. Smirnov
Summary: This paper mainly studies undirected multiple graphs of any natural multiplicity, including properties of multiple trees and complete spanning trees.
JOURNAL OF COMBINATORIAL OPTIMIZATION
(2022)
Article
Mathematics
Yoshimi Egawa, Michitaka Furuya, Hajime Matsumura
Summary: In this paper, it is proven that for a sufficiently large integer d and a connected graph G, if the number of vertices in G is less than (d+2)(delta(G)+1)/3, then there exists a spanning tree T of G such that the diameter of T is at most d.
DISCRETE MATHEMATICS
(2021)
Article
Operations Research & Management Science
Francesco Carrabs, Raffaele Cerulli, Rosa Pentangelo, Andrea Raiconi
Summary: The paper presents a branch-and-cut approach to solve the minimum spanning tree problem with conflicting edge pairs, demonstrating its superiority over previous algorithms through computational tests on benchmark instances and newly proposed ones.
ANNALS OF OPERATIONS RESEARCH
(2021)
Article
Energy & Fuels
Nadia Nedjah, Kleber Hochwart Cardoso, Luiza Macedo Mourelle
Summary: This study proposes a distributed implementation of self-healing mechanism in smart grids, which can quickly find satisfactory reconfiguration solutions and enhance network intelligence. The results show that this implementation performs significantly better than the expected upper bounds in terms of reconfiguration time and communication cost, achieving substantial speedup in cases of single and multiple failures.
INTERNATIONAL JOURNAL OF ENERGY RESEARCH
(2021)