{"title":"Hypergraph-Based Organizers’ Behavior Scheduling Optimization: High-Order Relationships Discovery","authors":"Ziqi Xu;Huiqi Zhang","doi":"10.1109/ACCESS.2025.3528651","DOIUrl":null,"url":null,"abstract":"In the context of organizers’ behavior scheduling optimization, accurately assessing and optimizing scheduling programs is essential. This paper introduces HyperFusion, a framework designed to enhance scheduling efficiency through hypergraph learning techniques and an adaptive feature fusion model tailored to organizers’ behavioral patterns. The model categorizes and evaluates scheduling methods by identifying peer groups of organizers who share similar behavioral and operational attributes. Addressing challenges such as variability in scheduling approaches across different environments and the availability of diverse behavioral data, HyperFusion utilizes hypergraph-based feature fusion to identify high-quality scheduling and behavioral features that reflect each organizer’s unique scheduling style and operational impact. Employing a probabilistic model, the framework represents each organizer’s attributes in a latent space, enabling a nuanced understanding of their contributions. A large-scale hypergraph is constructed to map relationships and similarities among organizers, identifying dense subgraphs or “circles” of organizers with shared attributes. By mining these high-order relationships within these “organizer circles”, HyperFusion enhances scheduling quality and provides adaptive fusion of behavioral features, optimizing the scheduling process to meet the objectives of high-order relationship discovery. Experiments conducted on a dataset of organizers from 36 prominent institutions (our complied data set) demonstrate the model’s effectiveness in improving scheduling programs, underscoring its capability to align scheduling practices with adaptive, data-driven optimization and fostering a responsive and efficient scheduling system.","PeriodicalId":13079,"journal":{"name":"IEEE Access","volume":"13 ","pages":"10277-10288"},"PeriodicalIF":3.4000,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10838518","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Access","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10838518/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
In the context of organizers’ behavior scheduling optimization, accurately assessing and optimizing scheduling programs is essential. This paper introduces HyperFusion, a framework designed to enhance scheduling efficiency through hypergraph learning techniques and an adaptive feature fusion model tailored to organizers’ behavioral patterns. The model categorizes and evaluates scheduling methods by identifying peer groups of organizers who share similar behavioral and operational attributes. Addressing challenges such as variability in scheduling approaches across different environments and the availability of diverse behavioral data, HyperFusion utilizes hypergraph-based feature fusion to identify high-quality scheduling and behavioral features that reflect each organizer’s unique scheduling style and operational impact. Employing a probabilistic model, the framework represents each organizer’s attributes in a latent space, enabling a nuanced understanding of their contributions. A large-scale hypergraph is constructed to map relationships and similarities among organizers, identifying dense subgraphs or “circles” of organizers with shared attributes. By mining these high-order relationships within these “organizer circles”, HyperFusion enhances scheduling quality and provides adaptive fusion of behavioral features, optimizing the scheduling process to meet the objectives of high-order relationship discovery. Experiments conducted on a dataset of organizers from 36 prominent institutions (our complied data set) demonstrate the model’s effectiveness in improving scheduling programs, underscoring its capability to align scheduling practices with adaptive, data-driven optimization and fostering a responsive and efficient scheduling system.
IEEE AccessCOMPUTER SCIENCE, INFORMATION SYSTEMSENGIN-ENGINEERING, ELECTRICAL & ELECTRONIC
CiteScore
9.80
自引率
7.70%
发文量
6673
审稿时长
6 weeks
期刊介绍:
IEEE Access® is a multidisciplinary, open access (OA), applications-oriented, all-electronic archival journal that continuously presents the results of original research or development across all of IEEE''s fields of interest.
IEEE Access will publish articles that are of high interest to readers, original, technically correct, and clearly presented. Supported by author publication charges (APC), its hallmarks are a rapid peer review and publication process with open access to all readers. Unlike IEEE''s traditional Transactions or Journals, reviews are "binary", in that reviewers will either Accept or Reject an article in the form it is submitted in order to achieve rapid turnaround. Especially encouraged are submissions on:
Multidisciplinary topics, or applications-oriented articles and negative results that do not fit within the scope of IEEE''s traditional journals.
Practical articles discussing new experiments or measurement techniques, interesting solutions to engineering.
Development of new or improved fabrication or manufacturing techniques.
Reviews or survey articles of new or evolving fields oriented to assist others in understanding the new area.