| 注册
首页|期刊导航|深圳大学学报(理工版)|MSHC:一种多阶段超图聚类算法

MSHC:一种多阶段超图聚类算法

张春英 王静 刘璐 兰思武 张庆达

深圳大学学报(理工版)2025,Vol.42Issue(1):68-76,9.
深圳大学学报(理工版)2025,Vol.42Issue(1):68-76,9.DOI:10.3724/SP.J.1249.2025.01068

MSHC:一种多阶段超图聚类算法

MSHC:a multi-stage hypergraph clustering algorithm

张春英 1王静 2刘璐 3兰思武 2张庆达2

作者信息

  • 1. 华北理工大学理学院,河北 唐山 063210||华北理工大学河北省数据科学与应用重点实验室,河北 唐山 063210||华北理工大学唐山市工程计算重点实验室,河北 唐山 063210||华北理工大学唐山市智能工业与图像处理技术创新中心,河北 唐山 063210||华北理工大学铁矿石优选与铁前工艺智能化河北省工程研究中心,河北 唐山 063210
  • 2. 华北理工大学理学院,河北 唐山 063210
  • 3. 华北理工大学理学院,河北 唐山 063210||华北理工大学河北省数据科学与应用重点实验室,河北 唐山 063210||华北理工大学铁矿石优选与铁前工艺智能化河北省工程研究中心,河北 唐山 063210
  • 折叠

摘要

Abstract

As a high-dimensional extension of ordinary graphs,hypergraphs can more flexibly reflect high-order complex relationships between nodes.Hypergraph clustering aims to discover complex high-order correlations in powerful hypergraph structures.In response to challenges faced by current hypergraph clustering algorithms,such as extremely high complexity,unstable clustering results,and the tendency to fall into local optima,a multi-stage hypergraph clustering algorithm denoted as MSHC is proposed based on the idea of hypergraph partitioning.This algorithm divides the hypergraph clustering process into three stages:hypergraph reduction,hypergraph initial clustering,and optimization migration.In the first stage,a fast reduction method that preserves the hypergraph structure is proposed to reduce the complexity of subsequent algorithms.In the second stage,a similarity measurement method between hypergraph nodes based on set pair analysis theory is introduced,and hierarchical clustering algorithm is applied for initial clustering.Four different cluster merging strategies are employed to increase the diversity of clustering schemes.In the final stage,the genetic algorithm is applied to obtain the optimal hypergraph clustering scheme.Comparative experiments are conducted with two traditional hypergraph clustering algorithms on three data sets with different sizes.Experimental results show that the hypergraph modularity index of the MSHC algorithm is improved by 0.079 and 0.077on the Songs_genres and Papers_keywords datasets respectively,and is only reduced by 0.006 on the Movies_genres dataset.

关键词

数据处理/超图聚类/遗传算法/集对分析理论/超图约简/多阶段聚类/超图模块度

Key words

data processing/hypergraph clustering/genetic algorithm/set pair analysis theory/hypergraph reduction/multi-stage clustering/hypergraph modularity

分类

信息技术与安全科学

引用本文复制引用

张春英,王静,刘璐,兰思武,张庆达..MSHC:一种多阶段超图聚类算法[J].深圳大学学报(理工版),2025,42(1):68-76,9.

基金项目

Basic Scientific Research Business Expenses of Hebei Provincial Universities(JST2022001) 河北省属高校基本科研业务费资助项目(JST2022001) (JST2022001)

深圳大学学报(理工版)

OA北大核心

1000-2618

访问量5
|
下载量0
段落导航相关论文