<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="research-article" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Digit. Health</journal-id>
<journal-title>Frontiers in Digital Health</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Digit. Health</abbrev-journal-title>
<issn pub-type="epub">2673-253X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fdgth.2024.1503831</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Digital Health</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Male-assisted training and injury patterns: hypergraph-enhanced analysis of injuries in women&#x2019;s water polo</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Feng</surname><given-names>Xuehui</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x002A;</xref>
<role content-type="https://credit.niso.org/contributor-roles/conceptualization/"/><role content-type="https://credit.niso.org/contributor-roles/data-curation/"/><role content-type="https://credit.niso.org/contributor-roles/formal-analysis/"/><role content-type="https://credit.niso.org/contributor-roles/funding-acquisition/"/><role content-type="https://credit.niso.org/contributor-roles/investigation/"/><role content-type="https://credit.niso.org/contributor-roles/methodology/"/><role content-type="https://credit.niso.org/contributor-roles/project-administration/"/><role content-type="https://credit.niso.org/contributor-roles/resources/"/><role content-type="https://credit.niso.org/contributor-roles/software/"/><role content-type="https://credit.niso.org/contributor-roles/supervision/"/><role content-type="https://credit.niso.org/contributor-roles/validation/"/><role content-type="https://credit.niso.org/contributor-roles/visualization/"/><role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Wang</surname><given-names>Zhibin</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Wang</surname><given-names>Zheng</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>He</surname><given-names>Chen</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Xun</surname><given-names>Hongxing</given-names></name>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Chen</surname><given-names>Yuanfa</given-names></name>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Ding</surname><given-names>Jie</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/></contrib>
<contrib contrib-type="author"><name><surname>Chen</surname><given-names>Gen</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-review-editing/"/></contrib>
<contrib contrib-type="author"><name><surname>Liu</surname><given-names>Zhe</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref><role content-type="https://credit.niso.org/contributor-roles/writing-original-draft/"/></contrib>
</contrib-group>
<aff id="aff1"><label><sup>1</sup></label><institution>Key Laboratory of Sports Trauma and Rehabilitation of General Administration of Sport of the People&#x0027;s Republic of China</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff2"><label><sup>2</sup></label><institution>National Research Institute of Sports Medicine (NRISM)</institution>, <addr-line>Beijing</addr-line>, <country>China</country></aff>
<aff id="aff3"><label><sup>3</sup></label><institution>Hunan Institute of Sports Science</institution>, <addr-line>Hunan</addr-line>, <country>China</country></aff>
<aff id="aff4"><label><sup>4</sup></label><institution>Guangxi Sports Trauma Center</institution>, <addr-line>Guangxi</addr-line>, <country>China</country></aff>
<author-notes>
<fn fn-type="edited-by"><p><bold>Edited by:</bold> Donglin Di, Li Auto, China</p></fn>
<fn fn-type="edited-by"><p><bold>Reviewed by:</bold> Cong Cong, Macquarie University, Australia</p>
<p>Wang Ruidong, Zhejiang Normal University, China Han Han, Zhengzhou University, Zhengzhou, China, in collaboration with reviewer WR</p></fn>
<corresp id="cor1"><label>&#x002A;</label><bold>Correspondence:</bold> Xuehui Feng <email>presum@126.com</email></corresp>
</author-notes>
<pub-date pub-type="epub"><day>06</day><month>01</month><year>2025</year></pub-date>
<pub-date pub-type="collection"><year>2024</year></pub-date>
<volume>6</volume><elocation-id>1503831</elocation-id>
<history>
<date date-type="received"><day>29</day><month>09</month><year>2024</year></date>
<date date-type="accepted"><day>14</day><month>11</month><year>2024</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 Feng, Wang, Wang, He, Xun, Chen, Ding, Chen and Liu.</copyright-statement>
<copyright-year>2025</copyright-year><copyright-holder>Feng, Wang, Wang, He, Xun, Chen, Ding, Chen and Liu</copyright-holder><license license-type="open-access" xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract><sec><title>Introduction</title>
<p>The aim of this study is to compare the injury patterns of female water polo players before and after the implementation of the Male-Assisted Female Training (MAFT) program. The study seeks to identify key factors influencing these changes and propose corresponding injury prevention measures.</p>
</sec><sec><title>Methods</title>
<p>We utilized pattern analysis and classification techniques to explore the injury data. A Hypergraph Neural Network (HGNN) was employed for pattern extraction, where each athlete was represented as a node in a hypergraph, with node dimensions capturing high-order relational embedding information. We applied the graph Laplacian operator to aggregate neighborhood features and visualize structural and feature differences in hypergraphs based on different influencing factors. Additionally, we introduced graph structure regularization to improve classification accuracy and prevent overfitting in the relatively small dataset, enhancing our ability to identify critical factors affecting injury types.</p>
</sec><sec><title>Results</title>
<p>The analysis revealed significant differences in injury patterns before and after the MAFT program, with specific influencing factors being identified through both pattern recognition and classification techniques. The classification models, supported by graph structure regularization, achieved improved accuracy in distinguishing key features that contributed to changes in injury types.</p>
</sec><sec><title>Discussion</title>
<p>These findings provide insights into the critical factors influencing injury patterns in female water polo players and highlight the effectiveness of the MAFT program in mitigating certain injury risks. Based on the identified features, we propose targeted preventive measures to reduce injury incidence, particularly in relation to changes brought about by the MAFT training mode. Further research is needed to refine these measures and explore their long-term effectiveness.</p>
</sec>
</abstract>
<kwd-group>
<kwd>hypergraph</kwd>
<kwd>high-order connection</kwd>
<kwd>injury patterns</kwd>
<kwd>women&#x2019;s water polo</kwd>
<kwd>Male-Assisting-Female-Training</kwd>
</kwd-group><counts>
<fig-count count="3"/>
<table-count count="3"/><equation-count count="190"/><ref-count count="27"/><page-count count="11"/><word-count count="0"/></counts><custom-meta-wrap><custom-meta><meta-name>section-at-acceptance</meta-name><meta-value>Health Informatics</meta-value></custom-meta></custom-meta-wrap>
</article-meta>
</front>
<body><sec id="s1" sec-type="intro"><label>1</label><title>Introduction</title>
<p>Water polo, an aquatic sport that combines swimming, ball skills, and team tactics, has evolved into a global competitive event since its inception in Europe in the late 19th century. The Chinese women&#x2019;s water polo team, established in 2004, has rapidly progressed from regional competitions to the international stage. Their outstanding performance in international tournaments not only showcases the team&#x2019;s strength but also reflects the advancement of the national sports sector. In recent years, to further enhance their competitive level, the Chinese women&#x2019;s water polo team has introduced the Male-Assisted Female Training (MAFT) program. This innovative training method involves sparring with male athletes to simulate higher-level competitive scenarios, thereby enhancing the female athletes&#x2019; resilience and tactical execution.</p>
<p>However, the introduction of the MAFT program also presents new challenges, particularly in managing the risk of injuries. Compared to male athletes, female athletes exhibit differences in physical strength and speed, which may increase the risk of injuries during high-intensity sparring sessions. As a team-based combative sport, water polo integrates swimming, throwing, tactical skills, and physical fitness (<xref ref-type="bibr" rid="B1">1</xref>). The sport is characterized by intense collisions and grappling in water, lacking the stability of a land environment, leading to frequent injuries during training and matches. Current research on women&#x2019;s water polo primarily focuses on combat techniques, while injury-related studies are relatively scarce. To date, only one publication has analyzed injuries related to the preparation for the Rio Olympics water polo events (<xref ref-type="bibr" rid="B2">2</xref>). Therefore, studying the injury patterns of female water polo players under the MAFT program is crucial for developing effective training plans and injury prevention strategies.</p>
<p>Current research on injuries among elite female water polo players is limited and often focuses on a single body part. Studies have investigated shoulder injuries in elite female water polo players (<xref ref-type="bibr" rid="B3">3</xref>), analyzing the incidence of shoulder injuries among players in different positions during matches and the frequency of specific shoulder injury sites. It was found that center forwards and top shooters have the highest rates of shoulder injuries, at 88.89&#x0025; and 80.95&#x0025; respectively, with the majority of injuries concentrated in the joints and ligaments . Other research has investigated the impact of water polo throws on the shoulder joint (<xref ref-type="bibr" rid="B4">4</xref>), analyzing the effects of throwing actions on injured players, assessing the external rotation stability of injured vs. non-injured players, and providing corresponding recommendations. Lv Zhouxiang and colleagues conducted a study on female water polo players (<xref ref-type="bibr" rid="B5">5</xref>), analyzing the multiple injury sites and potential causes, but the study did not delve deeply into the associated movement patterns . The MAFT training model, as a newly proposed strategy, has not yet been subject to authoritative research analysis. Therefore, the research presented in this paper on the injury patterns of female water polo players under the MAFT plan is innovative and crucial for developing effective training programs, reducing injuries during training, and enhancing the performance capabilities of athletes.</p>
<p>The interactions among female athletes in practice are complex and diverse. To better understand and analyze these interaction patterns, this study introduces the concept of hypergraphs. A hypergraph (<xref ref-type="bibr" rid="B6">6</xref>&#x2013;<xref ref-type="bibr" rid="B10">10</xref>) is a mathematical model capable of representing complex relationships among multiple nodes. It connects multiple nodes through hyperedges (<xref ref-type="bibr" rid="B11">11</xref>&#x2013;<xref ref-type="bibr" rid="B13">13</xref>), which can more accurately simulate the many-to-many interactions among female water polo players. For instance, in a match, not only are there defensive and offensive confrontations between individual players, but the strategic coordination between the entire defense and offense teams can also be represented through hyperedges. This representation method can more comprehensively reflect the tactical layout and collaboration patterns among athletes during matches.</p>
<p>In summary, this study aims to explore the injury patterns, characteristics, and potential coping strategies for female water polo players under the MAFT program. By thoroughly analyzing injury data from training and matches, combined with advanced analytical techniques from hypergraph neural networks (HGNN) (<xref ref-type="bibr" rid="B7">7</xref>), we hope to reveal the impact of the MAFT program on the injury risk of female water polo players. The findings will provide scientific evidence for reducing injury incidents, optimizing training methods, and improving athlete performance while ensuring their health and safety. Our contributions are as follows:</p>
<p>
<list list-type="simple">
<list-item><label>1.</label>
<p>We analyzed the hypergraph patterns before and after the introduction of the MAFT training program. By comparing the overall hypergraph structure, feature patterns, and the impact of key factors on these structures and patterns, we identified the critical influencing factors associated with the introduction of MAFT.</p></list-item>
<list-item><label>2.</label>
<p>From a classification perspective, we employed graph structure regularization to effectively enhance the accuracy of different injury types in our dataset. This allowed us to more precisely establish an optimized hypergraph structure, thereby identifying the key influencing factors for each injury type before and after the MAFT program.</p></list-item>
<list-item><label>3.</label>
<p>Based on the comprehensive analysis from the aforementioned perspectives, our approach effectively identifies crucial features and subsequently provides recommendations for injury prevention measures.</p></list-item>
</list></p>
</sec>
<sec id="s2" sec-type="methods"><label>2</label><title>Materials and methods</title>
<p>This study aims to explore the injury patterns, characteristics, and potential coping strategies of female water polo players by comparing injury incidents before and after the implementation of Male-Assisted Female Training (MAFT) and conducting an in-depth analysis of related indicators. To achieve this, we employ the Hypergraph Neural Network (HGNN) as our foundational model to capture the complex relationships and higher-order associative features among athletes, as shown in <xref ref-type="fig" rid="F1">Figure 1</xref>. Subsequently, we perform detailed pattern recognition and factor analysis from a classification perspective to comprehensively analyze the injury characteristics of female water polo players.</p>
<fig id="F1" position="float"><label>Figure 1</label>
<caption><p>Overview of Hypergraph-enhanced analysis of injury patterns in women&#x2019;s water polo under Male-Assisting-Female-Training (MAFT) mode.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-06-1503831-g001.tif"/>
</fig>
<p>The selection of Hypergraph Neural Networks (HGNN) as an analytical method is attributed to its superior capacity in handling complex interrelations and high-dimensional data. In the analysis of injury patterns among elite female water polo players, multiple factors interact and influence each other, such as training load, psychological state, and physiological indicators. Traditional network analysis methods may fail to capture these intricate associations effectively. Firstly, HGNN is a hypergraph-based neural network model capable of managing many-to-many relationships among multiple nodes. This enables HGNN to more comprehensively consider the interplay between various factors when analyzing injury patterns in water polo athletes. Secondly, by constructing hypergraphs, HGNN can visualize the association between different factors and extract key features, aiding researchers in identifying significant factors influencing changes in injury patterns. Lastly, in terms of classification analysis, the study introduces graph structural regularization techniques to enhance classification accuracy and more effectively determine key features that distinguish different types of injuries. The results demonstrate that the rHGNN model, which employs HGNN for classification analysis, exhibits excellent performance in terms of accuracy, positive predictive value, negative predictive value, sensitivity, and specificity. In summary, HGNN, as a network analysis method capable of managing complex interrelations and extracting key features, offers distinct advantages in analyzing injury patterns among water polo players. It assists researchers in gaining a more comprehensive understanding of the factors influencing injury patterns and provides scientific evidence for developing personalized training interventions and injury prevention strategies.</p>
<sec id="s2a"><label>2.1</label><title>Study design</title>
<p>The study involved 26 athletes from the National Women&#x2019;s Water Polo Team training between February and July 2021, before and after the implementation of the MAFT mode. Among them, 12 were international-level athletes and 14 were national-level athletes. Their ages ranged from 21 to 32 years, with an average age of 24.9 years. The athletes had been participating in professional sports for 8 to 16 years, averaging 10.9 years, and had been involved in water polo for 8 to 15 years, averaging 9.8 years. They had participated in national-level training for 1 to 14 years, averaging 5.6 years. Twelve athletes had participated in preparation for two Olympic Games. The team positions were distributed as 3 centers, 3 defensive centers, 15 perimeter players, and 5 goalkeepers.</p>
</sec>
<sec id="s2b"><label>2.2</label><title>Data collection</title>
<p>In this study, we employed a combination of surveys and clinical diagnoses to analyze and compare the evolution of injury characteristics before and after the implementation of the Male-Assisted Female Training (MAFT) program. The research team spent an extended period residing with the athletes, closely observing the development and progression of injuries. To gather comprehensive data, we used questionnaires to collect basic information, including names, ages, years of athletic experience, injury locations, and causes. Additionally, we recorded pre-analyzed indicators such as training frequency, intensity, duration, recovery time, and physiological metrics like heart rate, blood lactate levels, and VO2 max. The survey also aimed to identify unique injury patterns that emerged following the implementation of the MAFT program. All questionnaires were meticulously collected and processed. During this period, our team was actively involved in diagnosing and treating all athlete injuries, meticulously documenting the occurrence of common injuries and conducting thorough physical examinations. We paid particular attention to any differences in injury processes and severity compared to previous same-gender training scenarios. In summary, through the combination of survey data and clinical records, we captured detailed information on injury locations, types, and severity, providing a comprehensive overview of the impact of the MAFT program on female water polo athletes.</p>
</sec>
<sec id="s2c"><label>2.3</label><title>Statistical analysis</title>
<p>Statistical analysis was conducted using SPSS software version 20.0 (SPSS Inc., USA). The proportions of injuries to the neck, shoulder, elbow-wrist, thoracic spine, lumbar-sacral region, hip, knee, ankle, forearm lateral, and sternoclavicular joint were treated as quantitative data. Injury proportions, presented as counts (percentages), were compared between groups using Fisher&#x2019;s exact test to assess the significance of changes in injury patterns before and after the MAFT mode, with the level of significance set at a two-tailed p-value of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM1"><mml:mn>0.05</mml:mn></mml:math></inline-formula>. There was a noticeable increase in the proportion of injuries to joints involved in confrontational activities after the implementation of the Male-Assisting-Female-Training mode. The most common injury site was the shoulder, accounting for 34.6&#x0025; of injuries, which further increased to 42.3&#x0025; post-implementation. This was followed by injuries to the lumbar-sacral-hip region, with an increase from 26.9&#x0025; to 34.6&#x0025;. Injuries to the elbow-wrist area showed a significant upward trend, rising from 7.7&#x0025; to 26.9&#x0025;. Conversely, injuries to the knee and ankle joints, primarily involved in non-confrontational sliding motions, showed a decreasing trend. Notably, two goalkeepers sustained injuries, including bilateral forearm ulnar side hitting injuries and a dominant hand side sternoclavicular joint injury. The details of the sports-related injuries, including the number of cases and the proportion of each injury, are summarized in <xref ref-type="table" rid="T1">Table&#x00A0;1</xref>. In water polo, the increase in proportional injuries to confrontational joints is particularly notable. Shoulder injuries occur at a rate of 24&#x0025; to 51&#x0025;, primarily due to the frequent use of the dominant hand in passing and shooting, as well as the non-dominant hand in defensive actions, leading to bilateral shoulder injuries (<xref ref-type="bibr" rid="B14">14</xref>, <xref ref-type="bibr" rid="B15">15</xref>). In confrontational training with male athletes, female athletes need to pass the ball more frequently and attack from various angles, increasing the burden on the dominant hand and raising the injury probability to about 57 Elbow and wrist injuries are also common, with wrist injuries occurring at a rate of 13.6&#x0025; to 23.1&#x0025; and elbow injuries at a rate of 6&#x0025; to 18.2&#x0025; (<xref ref-type="bibr" rid="B16">16</xref>&#x2013;<xref ref-type="bibr" rid="B19">19</xref>). In confrontations with male athletes, female athletes need to find more flexible passing and offensive paths, increasing the burden on the wrist and elbow joints and leading to an increased risk of injury (<xref ref-type="bibr" rid="B20">20</xref>, <xref ref-type="bibr" rid="B21">21</xref>). Conversely, the proportion of injuries to stability joints has decreased. The incidence rate of knee and ankle injuries is 4.5&#x0025; to 10.8&#x0025; and 6&#x0025; to 18.2&#x0025;, respectively (<xref ref-type="bibr" rid="B16">16</xref>). Confrontations with male athletes reduce the time spent &#x201C;treading water,&#x201D; lowering the tension on the knee joint and thus reducing the injury rate. Among goalkeepers, sternal-clavicular joint injuries are a new type of injury. These injuries are usually caused by direct high-impact trauma, while indirect force-related collateral injuries can be alleviated with rest (<xref ref-type="bibr" rid="B22">22</xref>, <xref ref-type="bibr" rid="B23">23</xref>). The inability of athletes to get adequate rest during the preparation period is the main reason for persistent pain.</p>
<table-wrap id="T1" position="float"><label>Table 1</label>
<caption><p>This table shows a comparison of injuries to different body parts of female water polo players in traditional training mode and male-assisted Female Training (MAFT) mode. The &#x201C;Number of Injuries&#x201D; column in the table shows the frequency of injuries in each part under the two training modes, while the &#x201C;Injury Proportion&#x201D; column shows the proportion of injuries in the corresponding part to the total number of injuries. This will provide a key basis for exploring the factors that cause such differences in hypergraph pattern recognition.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Injury</th>
<th valign="top" align="center" colspan="2">Number of injuries</th>
<th valign="top" align="center" colspan="2">Injury proportion</th>
</tr>
<tr>
<th valign="top" align="left">Location</th>
<th valign="top" align="center">Tradition</th>
<th valign="top" align="center">MAFT</th>
<th valign="top" align="center">Tradition</th>
<th valign="top" align="center">MAFT</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">Neck</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">7.7&#x0025;</td>
<td valign="top" align="center">3.8&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Shoulder</td>
<td valign="top" align="center">9</td>
<td valign="top" align="center">11</td>
<td valign="top" align="center">34.6&#x0025;</td>
<td valign="top" align="center">42.3&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Elbow &#x0026; Wrist</td>
<td valign="top" align="center">2</td>
<td valign="top" align="center">7</td>
<td valign="top" align="center">7.7&#x0025;</td>
<td valign="top" align="center">26.9&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Chest &#x0026; Back</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">3.8&#x0025;</td>
<td valign="top" align="center">3.8&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Lumbar, sacral &#x0026; hip</td>
<td valign="top" align="center">7</td>
<td valign="top" align="center">9</td>
<td valign="top" align="center">26.9&#x0025;</td>
<td valign="top" align="center">34.6&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Knee</td>
<td valign="top" align="center">11</td>
<td valign="top" align="center">6</td>
<td valign="top" align="center">42.3&#x0025;</td>
<td valign="top" align="center">23.1&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Ankle</td>
<td valign="top" align="center">4</td>
<td valign="top" align="center">3</td>
<td valign="top" align="center">15.4&#x0025;</td>
<td valign="top" align="center">11.5&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Forearm ulnar side</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">0&#x0025;</td>
<td valign="top" align="center">3.8&#x0025;</td>
</tr>
<tr>
<td valign="top" align="left">Sternoclavicular joint</td>
<td valign="top" align="center">0</td>
<td valign="top" align="center">1</td>
<td valign="top" align="center">0&#x0025;</td>
<td valign="top" align="center">3.8&#x0025;</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s2d"><label>2.4</label><title>Hypergraph construction</title>
<p>A hypergraph is a structure capable of representing complex relationships and multidimensional features, making it suitable for capturing interactions and relationships among athletes. In constructing the hypergraph, we first define nodes and hyperedges.</p>
<sec id="s2d1"><label>2.4.1</label><title>Node definition</title>
<p>In this study, each athlete is represented as a node <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM2"><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula>, with a feature vector <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM3"><mml:msub><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> encoding individual attributes such as training intensity, training duration, and injury history. The set of nodes is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM4"><mml:mi>V</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>v</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>n</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, with the node feature vector defined as <xref ref-type="disp-formula" rid="disp-formula1">Equation 1</xref>:<disp-formula id="disp-formula1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM1"><mml:msub><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mo stretchy="false">[</mml:mo><mml:mtext mathvariant="italic">Training Intensity</mml:mtext><mml:mo>,</mml:mo><mml:mtext mathvariant="italic">Training Duration</mml:mtext><mml:mo>,</mml:mo><mml:mtext mathvariant="italic">Injury History</mml:mtext><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:math></disp-formula>The selection of these features is based on their ability to comprehensively reflect the athlete&#x2019;s condition and performance. Training intensity indicates the effort level during training, where excessive intensity may lead to overtraining and injuries. Accumulated training duration reveals the workload and fatigue accumulation of the athlete, while injury history is a critical indicator for predicting future injury risks. Understanding an athlete&#x2019;s injury history can help formulate more effective prevention strategies. By incorporating these features, we gain a comprehensive understanding of each athlete&#x2019;s training status and health condition, providing a solid foundation for subsequent analysis.</p>
</sec>
<sec id="s2d2"><label>2.4.2</label><title>Hyperedge definition</title>
<p>In constructing hyperedges, we consider various interactions among athletes, such as passing and defensive actions. These interactions are modeled as hyperedges <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM5"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula>, with weights <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM6"><mml:msub><mml:mi>w</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> representing the frequency and intensity of the interactions. The set of hyperedges is defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM7"><mml:mi>E</mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:msub><mml:mi>e</mml:mi><mml:mn>1</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mn>2</mml:mn></mml:msub><mml:mo>,</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>,</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>m</mml:mi></mml:msub></mml:mrow></mml:math></inline-formula>, where each hyperedge <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM8"><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> connects a group of nodes, indicating interactions among athletes. The rationale behind this choice is that interactions among athletes significantly impact team performance and individual injuries. For instance, frequent passing interactions reflect the coordination and trust among athletes, crucial for both offensive and defensive strategies. In defensive scenarios, cooperation and coordination among athletes are equally important, with the frequency and intensity of defensive interactions revealing the execution and effectiveness of team defensive strategies. Moreover, the choice of hyperedges over simple edges is due to their ability to capture the complexity of multi-party interactions. A hyperedge can connect multiple athletes, representing their cooperation or confrontation within a training unit, whereas simple edges can only represent pairwise relationships, failing to comprehensively reflect the complexity of multi-party interactions. Through this approach, the hypergraph can thoroughly represent the complex relationships among athletes, capturing the interaction patterns and individual contributions within the team, thereby providing richer information for subsequent analysis.</p>
</sec>
</sec>
<sec id="s2e"><label>2.5</label><title>Pattern analysis</title>
<p>To capture the complex relationships within the team, we designed a Hypergraph Neural Network (HGNN) model to learn the embeddings of nodes and hyperedges. The architecture of the HGNN model is designed to capture and represent complex higher-order relationships through a multi-layer structure.</p>
<sec id="s2e1"><label>2.5.1</label><title>Model architecture</title>
<p>The HGNN model is designed to learn the embeddings of nodes and hyperedges, thereby capturing complex relationships within the team. The embedding function for nodes is defined as <xref ref-type="disp-formula" rid="disp-formula2">Equation 2</xref>:<disp-formula id="disp-formula2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM2"><mml:msub><mml:mrow><mml:mi mathvariant="bold">z</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msup><mml:msub><mml:mrow><mml:mi mathvariant="bold">x</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mrow><mml:mi mathvariant="bold">b</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM9"><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM10"><mml:mrow><mml:mi mathvariant="bold">b</mml:mi></mml:mrow></mml:math></inline-formula> are learnable parameters, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM11"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is the activation function. This approach maps the multidimensional features of nodes to a high-dimensional space, facilitating subsequent aggregation and analysis. The activation function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM12"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> is typically chosen to be a nonlinear function, such as ReLU (Rectified Linear Unit), to introduce nonlinearity and enhance the model&#x2019;s expressive power.</p>
<p>Specifically, forward propagation is conducted through multiple hypergraph convolution layers to iteratively update the node embeddings:<disp-formula id="disp-formula3"><label>(3)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM3"><mml:msup><mml:mi>H</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo>+</mml:mo><mml:mn>1</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mi>v</mml:mi><mml:mo>=</mml:mo><mml:mi>&#x03C3;</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>e</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>e</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:mfrac></mml:mrow><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>u</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>e</mml:mi></mml:mrow></mml:munder><mml:msup><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:msubsup><mml:mi>H</mml:mi><mml:mi>u</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup><mml:mo>+</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="bold">b</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>In <xref ref-type="disp-formula" rid="disp-formula3">Equation 3</xref>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM13"><mml:msubsup><mml:mi>H</mml:mi><mml:mi>u</mml:mi><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msubsup></mml:math></inline-formula> denotes the embedding of node <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM14"><mml:mi>u</mml:mi></mml:math></inline-formula> in layer <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM15"><mml:mi>l</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM16"><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mi>e</mml:mi><mml:mo fence="false" stretchy="false">|</mml:mo></mml:math></inline-formula> is the number of nodes in hyperedge <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM17"><mml:mi>e</mml:mi></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM18"><mml:msup><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM19"><mml:msup><mml:mrow><mml:mi mathvariant="bold">b</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>l</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula> are the learnable parameters for layer <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM20"><mml:mi>l</mml:mi></mml:math></inline-formula>. The activation function <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM21"><mml:mi>&#x03C3;</mml:mi></mml:math></inline-formula> introduces nonlinearity into the model. This formula updates the node embeddings by aggregating the embeddings of all nodes within the hyperedge, which allows the model to capture the intricate relationships among nodes. In each layer, the node embeddings are refined by aggregating the embeddings of all nodes within their respective hyperedges. This multi-layer structure enables the model to capture higher-order relationships and complex patterns in the data.</p>
</sec>
<sec id="s2e2"><label>2.5.2</label><title>Pattern recognition</title>
<p>The hyperedge embedding <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM22"><mml:msub><mml:mrow><mml:mi mathvariant="bold">a</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> is aggregated as <xref ref-type="disp-formula" rid="disp-formula4">Equation 4</xref>:<disp-formula id="disp-formula4"><label>(4)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM4"><mml:msub><mml:mrow><mml:mi mathvariant="bold">a</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">AGG</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="bold">z</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2223;</mml:mo><mml:msub><mml:mi>v</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2208;</mml:mo><mml:msub><mml:mi>e</mml:mi><mml:mi>j</mml:mi></mml:msub></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM23"><mml:mrow><mml:mi mathvariant="normal">AGG</mml:mi></mml:mrow></mml:math></inline-formula> is the aggregation function, typically chosen to be mean or weighted mean. The choice of aggregation function significantly impacts the effectiveness of hyperedge embeddings, as it determines how the embeddings of multiple nodes are combined. Subsequently, a multi-layer perceptron (MLP) in <xref ref-type="disp-formula" rid="disp-formula5">Equation 5</xref> is used to identify injury-related patterns:<disp-formula id="disp-formula5"><label>(5)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM5"><mml:msub><mml:mrow><mml:mi mathvariant="bold">p</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mi mathvariant="normal">MLP</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">a</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>During training, we simultaneously train the HGNN and MLP models to minimize the reconstruction error, defined as <xref ref-type="disp-formula" rid="disp-formula6">Equation 6</xref>:<disp-formula id="disp-formula6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM6"><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mspace width=".1em"/><mml:mi>j</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>m</mml:mi></mml:munderover><mml:mo fence="false" stretchy="false">|</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">a</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">p</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:msup><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mn>2</mml:mn></mml:msup></mml:math></disp-formula>Through this approach, the HGNN learns efficient representations of nodes and hyperedges, while the MLP identifies injury-related patterns. The minimization of reconstruction error <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM24"><mml:mrow><mml:mi mathvariant="script">L</mml:mi></mml:mrow></mml:math></inline-formula> ensures that the model accurately captures and reconstructs complex higher-order relationships, thereby improving the accuracy of pattern recognition.</p>
<p>By employing the aforementioned methods, we can construct a higher-order hypergraph structure within the overall information and analyze the variation patterns of hypergraph structures under specific influencing factors or indicators. As the final hypergraph is capable of expressing higher-order associations, we can assess the impact of the MAFT program on female water polo athletes&#x2019; injuries by comparing the changes in hypergraph structures before and after the implementation of MAFT. Specifically, by evaluating the significance of differences in hypergraph structures and node features, we can identify the key influencing factors.</p>
</sec>
</sec>
<sec id="s2f"><label>2.6</label><title>Classification analysis</title>
<p>We preprocess the data to obtain a feature vector of total dimension <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM25"><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mi>D</mml:mi></mml:msup><mml:mo stretchy="false">(</mml:mo><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mn>320</mml:mn><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, representing the records of all injury-related indicators for the corresponding individual. Then, we use KNN to establish the initial hypergraph structure and utilize the features learned by HGNN for injury type prediction. To better learn the hypergraph structure, we analyzed the characteristics of the dataset and found that introducing a graph regularization mechanism preserves the local geometric structure of the hypergraph data more effectively, preventing overfitting and enhancing the model&#x2019;s generalization capability. This leads to better classification accuracy, which is beneficial for accurately extracting key influencing factors of injuries before and after the introduction of the MAFT model. Specifically, given an initialized hypergraph structure <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM26"><mml:mrow><mml:mi mathvariant="script">H</mml:mi></mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="script">E</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, where the symbols denote a set of vertices <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM27"><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow></mml:math></inline-formula>, a set of hyperedges <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM28"><mml:mrow><mml:mi mathvariant="script">E</mml:mi></mml:mrow></mml:math></inline-formula>, and a weight matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM29"><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow></mml:math></inline-formula>, which is a diagonal matrix representing the weights of the hyperedges. This hypergraph can be succinctly represented by an incidence matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM30"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mo>&#x2208;</mml:mo><mml:msup><mml:mrow><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow></mml:mrow><mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mo>&#x00D7;</mml:mo><mml:mo fence="false" stretchy="false">|</mml:mo><mml:mrow><mml:mi mathvariant="script">E</mml:mi></mml:mrow><mml:mo fence="false" stretchy="false">|</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, where each entry <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM31"><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is defined as <xref ref-type="disp-formula" rid="disp-formula7">Equation 7</xref>:<disp-formula id="disp-formula7"><label>(7)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM7"><mml:mi>h</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>v</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable rowspacing="4pt" columnspacing="1em"><mml:mtr><mml:mtd><mml:mn>1</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mtext>if&#xA0;</mml:mtext><mml:mi>v</mml:mi><mml:mo>&#x2208;</mml:mo><mml:mi>e</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mn>0</mml:mn><mml:mo>,</mml:mo></mml:mtd><mml:mtd><mml:mtext>if&#xA0;</mml:mtext><mml:mi>v</mml:mi><mml:mo>&#x2209;</mml:mo><mml:mi>e</mml:mi><mml:mo>,</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:math></disp-formula>Graph regularization in HGNNs aims to preserve the local geometric structure of hypergraph data and improve the model&#x2019;s generalization capability. This is achieved by adding a regularization term to the loss function that measures the smoothness of node embeddings. Given the <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM32"><mml:mrow><mml:mi mathvariant="script">H</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="script">V</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="script">E</mml:mi></mml:mrow><mml:mo>,</mml:mo><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula>, the incidence matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM33"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula>, the vertex degree matrix by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM34"><mml:msub><mml:mrow><mml:mi mathvariant="bold">D</mml:mi></mml:mrow><mml:mi>v</mml:mi></mml:msub></mml:math></inline-formula>, and the hyperedge degree matrix by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM35"><mml:msub><mml:mrow><mml:mi mathvariant="bold">D</mml:mi></mml:mrow><mml:mi>e</mml:mi></mml:msub></mml:math></inline-formula>. The Laplacian matrix <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM36"><mml:mrow><mml:mi mathvariant="bold">L</mml:mi></mml:mrow></mml:math></inline-formula> for a hypergraph can be defined as:<disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="UDM1"><mml:mrow><mml:mi mathvariant="bold">L</mml:mi></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">D</mml:mi></mml:mrow><mml:mi>e</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msup><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM37"><mml:msub><mml:mrow><mml:mi mathvariant="bold">D</mml:mi></mml:mrow><mml:mi>e</mml:mi></mml:msub></mml:math></inline-formula> is the degree matrix of hyperedges, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM38"><mml:mrow><mml:mi mathvariant="bold">H</mml:mi></mml:mrow></mml:math></inline-formula> is the incidence matrix, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM39"><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow></mml:math></inline-formula> is the weight matrix. During training, we wish for the low-dimensional representations <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM40"><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow></mml:math></inline-formula> of the vertices to preserve the local structure of the hypergraph. The regularized objective function for HGNNs can be written as <xref ref-type="disp-formula" rid="disp-formula8">Equation 8</xref>:<disp-formula id="disp-formula8"><label>(8)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM8"><mml:msub><mml:mi>J</mml:mi><mml:mtext>rHGNN</mml:mtext></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac></mml:mrow><mml:msup><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>T</mml:mi></mml:msup><mml:mrow><mml:mi mathvariant="bold">L</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03BB;</mml:mi><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula>Here, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM41"><mml:msub><mml:mi>J</mml:mi><mml:mtext>rHGNN</mml:mtext></mml:msub></mml:math></inline-formula> is the regularized loss function, rHGNN represents the regularized form of HGNN in our proposed model, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM42"><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> represents other possible regularization terms (such as weight decay), and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM43"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is the regularization parameter that controls the strength of the regularization term. The optimization process involves minimizing <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM44"><mml:msub><mml:mi>J</mml:mi><mml:mtext>HGNN</mml:mtext></mml:msub></mml:math></inline-formula> through gradient descent or other optimization algorithms, thereby learning the low-dimensional representations <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM45"><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow></mml:math></inline-formula> of the vertices while maintaining the local structure of the hypergraph. This regularization method helps improve the performance of HGNNs on various downstream tasks such as node classification and clustering.</p>
<p>Notably, The regularization term <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM46"><mml:mi mathvariant="normal">&#x03A9;</mml:mi></mml:math></inline-formula> is constructed to ensure that the node embeddings preserve the local structure of the hypergraph. Specifically, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM47"><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> includes both a weight decay term that discourages overly complex models and a graph Laplacian smoothness term that encourages nearby nodes in the hypergraph to have similar embeddings. Mathematically, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM48"><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> is defined as <xref ref-type="disp-formula" rid="disp-formula9">Equation 9</xref>:<disp-formula id="disp-formula9"><label>(9)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="DM9"><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>,</mml:mo><mml:mi>j</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:mo>&#x2212;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x22C5;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mi>i</mml:mi></mml:munder><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub><mml:msup><mml:mo fence="false" stretchy="false">&#x2016;</mml:mo><mml:mn>2</mml:mn></mml:msup><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula>where <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM49"><mml:msub><mml:mrow><mml:mi mathvariant="bold">W</mml:mi></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>j</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> represents the elements of the graph Laplacian <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM50"><mml:mrow><mml:mi mathvariant="bold">L</mml:mi></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM51"><mml:msub><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>i</mml:mi></mml:msub></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM52"><mml:msub><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mi>j</mml:mi></mml:msub></mml:math></inline-formula> are the embeddings of nodes <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM53"><mml:mi>i</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM54"><mml:mi>j</mml:mi></mml:math></inline-formula>, respectively. The first term encourages smooth embeddings across the hypergraph, while the second term, weight decay, penalizes large embedding values. <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM55"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM56"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> are hyperparameters that control the relative importance of the smoothness and weight decay terms, respectively.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Experiments</title>
<sec id="s3a"><label>3.1</label><title>Evaluation and metrics</title>
<p>For pattern analysis, we focus primarily on visualization differences. This involves visualizing the structure and features of the hypergraph after optimizing reconstruction loss. We visualize differences in the global hypergraph and the MAFT-induced changes under single-factor influences. Specifically, when visualizing the hypergraph structure, we highlight the clustering of nodes. For visualizing hypergraph features, we employ dimensionality reduction techniques to create 2D visualizations.</p>
<p>For classification analysis, to assess the model&#x2019;s performance, we utilize several key metrics. Firstly, Accuracy (ACC) is calculated as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM57"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, reflecting the model&#x2019;s overall ability to correctly classify instances across all categories. Sensitivity (SEN), given by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM58"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, measures how effectively the model identifies true positive cases. Specificity (SPEC), defined as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM59"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, evaluates the model&#x2019;s capability to accurately recognize true negative cases without misclassifying them as positive. The Positive Predictive Value (PPV), calculated as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM60"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, represents the fraction of correctly identified positive cases among all cases predicted as positive. Lastly, the Negative Predictive Value (NPV), given by <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM61"><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:math></inline-formula>, indicates the proportion of true negatives among the cases predicted as negative. These metrics collectively provide a comprehensive evaluation of the model&#x2019;s classification performance.</p>
</sec>
<sec id="s3b"><label>3.2</label><title>Implementation details</title>
<p>For pattern analysis, the MLP consists of two hidden layers with 64 and 32 neurons respectively, followed by a ReLU activation function. The output layer uses a sigmoid activation function to produce the final pattern recognition output. The HGNN and MLP models are trained simultaneously using the Adam optimizer with a learning rate of 0.001. The training process includes early stopping with a patience parameter set to 10 epochs to prevent overfitting. The models are trained for a total of 100 epochs or until the validation loss stops improving.</p>
<p>For classification analysis, the rHGNN model is trained by minimizing the <xref ref-type="disp-formula" rid="disp-formula8">Equation 8</xref>. We employ stochastic gradient descent (SGD) as our optimization algorithm, with a learning rate of 0.01 and a decay schedule to adjust the learning rate over time. The training process is carefully monitored to ensure convergence towards a minimum of the loss function. The hyperparameters <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM62"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM63"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM64"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> in the regularization term <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM65"><mml:mi mathvariant="normal">&#x03A9;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mrow><mml:mi mathvariant="bold">X</mml:mi></mml:mrow><mml:mo stretchy="false">)</mml:mo></mml:math></inline-formula> are crucial for balancing the weight decay and smoothness constraints. The default values are set as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM66"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.2</mml:mn></mml:math></inline-formula>, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM67"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.03</mml:mn></mml:math></inline-formula>, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM68"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.005</mml:mn></mml:math></inline-formula>. For more details on the ablation experiments, please refer to the subsequent sections.</p>
</sec>
<sec id="s3c"><label>3.3</label><title>Comparison methods</title>
<p>We selected several comparative methods for our evaluation, including MLP, SVM, GNN, B-GNN, HGNN, and HGNNP.
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p><bold>MLP</bold> (<xref ref-type="bibr" rid="B24">24</xref>): MLP is a class of feedforward artificial neural networks consisting of multiple layers of nodes, each fully connected to the next. It is widely used for classification and regression tasks due to its ability to capture non-linear relationships.</p></list-item>
<list-item><label>&#x2022;</label>
<p><bold>SVM</bold> (<xref ref-type="bibr" rid="B25">25</xref>): SVM is a supervised learning algorithm that is effective for both classification and regression challenges. It works by finding the optimal hyperplane that maximizes the margin between different classes in the feature space.</p></list-item>
<list-item><label>&#x2022;</label>
<p><bold>GNN</bold>: GNNs (<xref ref-type="bibr" rid="B26">26</xref>) are designed to perform inference on data described by graphs. They leverage the graph structure to perform node classification, link prediction, and graph classification tasks by aggregating feature information from neighboring nodes.</p></list-item>
<list-item><label>&#x2022;</label>
<p><bold>B-GNN</bold> (<xref ref-type="bibr" rid="B27">27</xref>): B-GNN is a scalable graph neural network designed to handle large-scale graph data. It introduces techniques to efficiently manage large graphs while maintaining performance, making it suitable for big data applications.</p></list-item>
<list-item><label>&#x2022;</label>
<p><bold>HGNN</bold> (<xref ref-type="bibr" rid="B7">7</xref>): HGNN extends traditional GNNs to hypergraphs, which can capture higher-order relationships among data points. This method is particularly effective in scenarios where interactions involve more than two entities.</p></list-item>
<list-item><label>&#x2022;</label>
<p><bold>HGNNP</bold> (<xref ref-type="bibr" rid="B13">13</xref>): HGNNP is an enhanced version of HGNN that includes additional mechanisms to improve its performance. It further refines the ability to capture complex relationships in hypergraph-structured data.</p></list-item>
</list>Our proposed method, rHGNN, represents the regularized form of HGNN, incorporating regularization techniques to improve generalization and performance in the context of our specific application.</p>
</sec>
</sec>
<sec id="s4" sec-type="discussion"><label>4</label><title>Discussion</title>
<sec id="s4a"><label>4.1</label><title>Study on pattern analysis</title>
<p><xref ref-type="fig" rid="F2">Figure&#x00A0;2</xref> illustrates the distribution of various features in a two-dimensional space, comparing the scenarios with and without the application of MAFT. The figure is divided into four subplots, each representing different types of features: Global Feature, Training Load Factor, Psychological State Factor, and Physiological Indicators Factor. In the case of Global Features, it is observed that without MAFT, the data points are sparsely distributed with no apparent clustering pattern. However, when MAFT is applied, the data points become more densely packed and exhibit a certain degree of structural organization. This indicates that MAFT effectively enhances the correlation among global features. For Training Load Factors, a similar trend is observed. Without MAFT, the data points appear scattered and lack discernible patterns. Upon applying MAFT, the points converge into tighter clusters, suggesting that MAFT can extract more meaningful features from training load data. When examining Psychological State Factors, it is evident that without MAFT, the data points are randomly dispersed with no significant clustering. With MAFT applied, small clusters begin to form among the data points. This transformation implies that psychological state data becomes more consistent and interpretable after undergoing feature transformation through MAFT. Lastly, for Physiological Indicators Factors, the untransformed data exhibits a disordered scatter. However, post-MAFT application, the data points reveal clearer structural patterns. This suggests that physiological indicators processed through MAFT better reflect their intrinsic relationships. In summary, the comparison clearly demonstrates that applying MAFT results in more compact and organized distributions across all types of features.</p>
<fig id="F2" position="float"><label>Figure 2</label>
<caption><p>We visualize the positions of all features in the hypergraph within a standard 2D space. By visualizing the feature changes before and after the implementation of the MAFT program, we can observe the most impactful factors. We highlight the three most significant factors: training load, psychological state, and physiological indicators.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-06-1503831-g002.tif"/>
</fig>
<p><xref ref-type="fig" rid="F3">Figure&#x00A0;3</xref> illustrates the changes in hypergraph structures for specific factor indicators before and after implementing the MAFT program, focusing on Heart Rate Variability (HRV) and Training Frequency. Before MAFT, the HRV hypergraph shows numerous dispersed connections with some isolated nodes, indicating weak correlations. This disorganized structure may hinder effective information capture by models. After applying MAFT, the HRV hypergraph becomes more structured and cohesive, with fewer isolated nodes. Enhanced connectivity suggests improved correlation among nodes, facilitating better data utilization by models. Similarly, the pre-MAFT hypergraph for Training Frequency is characterized by scattered connections and weak node associations. This loose network structure can impede meaningful feature extraction. Post-MAFT application reveals a more organized network with tighter clusters and stronger internal associations. This improved structure enhances data consistency and information flow, aiding models in accurately capturing training frequency impacts.</p>
<fig id="F3" position="float"><label>Figure 3</label>
<caption><p>We visualize the changes in hypergraph structures under specific factor indicators before and after the implementation of the MAFT program, highlighting the significant structural differences from the heart rate variability (HRV) and training frequency indicators.</p></caption>
<graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="fdgth-06-1503831-g003.tif"/>
</fig>
</sec>
<sec id="s4b"><label>4.2</label><title>Study on classification analysis</title>
<p><xref ref-type="table" rid="T2">Table&#x00A0;2</xref> presents a comprehensive evaluation of various models, highlighting the performance of our proposed method, rHGNN. The results demonstrate that rHGNN consistently outperforms other methods across all evaluated metrics, including Accuracy (ACC), Positive Predictive Value (PPV), Negative Predictive Value (NPV), Sensitivity (SEN), and Specificity (SPEC). The ACC for rHGNN is notably high at 0.90635, surpassing traditional models such as MLP and SVM, which achieve ACCs of 0.68637 and 0.65817 respectively. This indicates a significant improvement in overall model accuracy. In terms of PPV and NPV, rHGNN achieves values of 0.92572 and 0.91092 respectively, reflecting its superior ability to correctly predict positive and negative cases compared to other models like GNN and B-GNN. Furthermore, the SEN value for rHGNN is the highest among all methods at 0.93216, demonstrating its exceptional sensitivity in identifying true positive cases. Similarly, SPEC is also maximized at 0.92785, indicating robust specificity in distinguishing true negatives. Overall, these results underscore the efficacy of the rHGNN model in achieving superior performance across multiple dimensions compared to conventional approaches such as HGNN and HGNNP. The consistent excellence across all metrics suggests that our method offers a highly reliable solution for the given task, setting a new benchmark for future research endeavors in this domain.</p>
<table-wrap id="T2" position="float"><label>Table 2</label>
<caption><p>We compute the accuracy of the proposed method on the testing data, and our method achieves the best results.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Method</th>
<th valign="top" align="center">ACC</th>
<th valign="top" align="center">PPV</th>
<th valign="top" align="center">NPV</th>
<th valign="top" align="center">SEN</th>
<th valign="top" align="center">SPEC</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">MLP</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM69"><mml:msub><mml:mn>0.68637</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0625</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM70"><mml:msub><mml:mn>0.68762</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0594</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM71"><mml:msub><mml:mn>0.69993</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0627</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM72"><mml:msub><mml:mn>0.68873</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0571</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM73"><mml:msub><mml:mn>0.69026</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0608</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">SVM</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM74"><mml:msub><mml:mn>0.65817</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0297</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM75"><mml:msub><mml:mn>0.66373</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0308</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM76"><mml:msub><mml:mn>0.65843</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0325</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM77"><mml:msub><mml:mn>0.67367</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0362</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM78"><mml:msub><mml:mn>0.66267</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0398</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">GNN</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM79"><mml:msub><mml:mn>0.78716</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0514</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM80"><mml:msub><mml:mn>0.77621</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0572</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM81"><mml:msub><mml:mn>0.76523</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0583</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM82"><mml:msub><mml:mn>0.77276</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0517</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM83"><mml:msub><mml:mn>0.75862</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0572</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">B-GNN</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM84"><mml:msub><mml:mn>0.82796</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0428</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM85"><mml:msub><mml:mn>0.82781</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0478</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM86"><mml:msub><mml:mn>0.81872</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0412</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM87"><mml:msub><mml:mn>0.82664</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0368</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM88"><mml:msub><mml:mn>0.81654</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0378</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">HGNN</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM89"><mml:msub><mml:mn>0.86621</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0381</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM90"><mml:msub><mml:mn>0.85163</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0365</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM91"><mml:msub><mml:mn>0.88245</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0327</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM92"><mml:msub><mml:mn>0.87833</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0392</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM93"><mml:msub><mml:mn>0.86924</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0461</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">HGNNP</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM94"><mml:msub><mml:mn>0.86273</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0367</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM95"><mml:msub><mml:mn>0.86252</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0387</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM96"><mml:msub><mml:mn>0.87326</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0352</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM97"><mml:msub><mml:mn>0.86237</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0371</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM98"><mml:msub><mml:mn>0.87944</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0308</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left">rHGNN (Ours)</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM99"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.90635</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0288</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM100"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.92572</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0286</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM101"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.91092</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0349</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM102"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.93216</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0365</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM103"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.92785</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0367</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn1"><p>Bold values represent the highest scores.</p></fn>
</table-wrap-foot>
</table-wrap>
</sec>
<sec id="s4c"><label>4.3</label><title>Study on graph regularization</title>
<p>In <xref ref-type="table" rid="T3">Table&#x00A0;3</xref>, we provide a detailed and comprehensive analysis of how different regularization hyperparameters affect our accuracy. It is evident that <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM104"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> is optimal around the 0.1 range, <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM105"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> is best suited for the 0.01 range, and <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM106"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> performs well in the 0.001 range.</p>
<table-wrap id="T3" position="float"><label>Table 3</label>
<caption><p>Comparison of model performance under different hyperparameters.</p></caption>
<table frame="hsides" rules="groups">
<colgroup>
<col align="left"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
<col align="center"/>
</colgroup>
<thead>
<tr>
<th valign="top" align="left">Method</th>
<th valign="top" align="center">ACC</th>
<th valign="top" align="center">PPV</th>
<th valign="top" align="center">NPV</th>
<th valign="top" align="center">SEN</th>
<th valign="top" align="center">SPEC</th>
</tr>
</thead>
<tbody>
<tr>
<td valign="top" align="left">rHGNN (Full)</td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM107"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.90635</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0288</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM108"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.92572</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0286</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM109"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.91092</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0349</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM110"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.93216</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0365</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM111"><mml:msub><mml:mrow><mml:mn mathvariant="bold">0.92785</mml:mn></mml:mrow><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0367</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM112"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM113"><mml:msub><mml:mn>0.89049</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0338</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM114"><mml:msub><mml:mn>0.90780</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0215</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM115"><mml:msub><mml:mn>0.89159</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0442</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM116"><mml:msub><mml:mn>0.91773</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0333</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM117"><mml:msub><mml:mn>0.91677</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0382</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM118"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM119"><mml:msub><mml:mn>0.89199</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0233</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM120"><mml:msub><mml:mn>0.91970</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0240</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM121"><mml:msub><mml:mn>0.90656</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0416</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM122"><mml:msub><mml:mn>0.93089</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0348</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM123"><mml:msub><mml:mn>0.92467</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0351</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM124"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>1.0</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM125"><mml:msub><mml:mn>0.87687</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0427</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM126"><mml:msub><mml:mn>0.89560</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0207</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM127"><mml:msub><mml:mn>0.88212</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0314</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM128"><mml:msub><mml:mn>0.90082</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0274</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM129"><mml:msub><mml:mn>0.91050</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0273</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM130"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.001</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM131"><mml:msub><mml:mn>0.88735</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0236</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM132"><mml:msub><mml:mn>0.90289</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0352</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM133"><mml:msub><mml:mn>0.89358</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0452</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM134"><mml:msub><mml:mn>0.91173</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0274</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM135"><mml:msub><mml:mn>0.90539</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0415</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM136"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM137"><mml:msub><mml:mn>0.89949</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0184</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM138"><mml:msub><mml:mn>0.91696</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0311</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM139"><mml:msub><mml:mn>0.90673</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0225</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM140"><mml:msub><mml:mn>0.92826</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0511</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM141"><mml:msub><mml:mn>0.91930</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0346</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM142"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.1</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM143"><mml:msub><mml:mn>0.88597</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0147</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM144"><mml:msub><mml:mn>0.89671</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0222</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM145"><mml:msub><mml:mn>0.88850</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0397</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM146"><mml:msub><mml:mn>0.91942</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0438</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM147"><mml:msub><mml:mn>0.90754</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0235</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM148"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.0001</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM149"><mml:msub><mml:mn>0.89944</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0406</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM150"><mml:msub><mml:mn>0.91289</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0352</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM151"><mml:msub><mml:mn>0.90275</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0263</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM152"><mml:msub><mml:mn>0.92961</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0441</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM153"><mml:msub><mml:mn>0.90086</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0267</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM154"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.001</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM155"><mml:msub><mml:mn>0.88206</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0286</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM156"><mml:msub><mml:mn>0.90511</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0153</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM157"><mml:msub><mml:mn>0.90949</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0338</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM158"><mml:msub><mml:mn>0.92774</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0297</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM159"><mml:msub><mml:mn>0.91953</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0251</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
<tr>
<td valign="top" align="left"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM160"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM161"><mml:msub><mml:mn>0.88584</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0321</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM162"><mml:msub><mml:mn>0.89636</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0291</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM163"><mml:msub><mml:mn>0.90519</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0490</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM164"><mml:msub><mml:mn>0.92634</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0367</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
<td valign="top" align="center"><inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM165"><mml:msub><mml:mn>0.91799</mml:mn><mml:mrow><mml:mo>&#x00B1;</mml:mo><mml:mn>0.0385</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn id="table-fn2"><p>Bold values represent the highest scores.</p></fn>
</table-wrap-foot>
</table-wrap>
<p>When examining the impact of varying the hyperparameter <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM166"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula>, it is observed that smaller values such as <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM167"><mml:mi>&#x03BB;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula> result in a slight decrease in ACC to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM168"><mml:mn>0.89049</mml:mn></mml:math></inline-formula>, while PPV and NPV also show minor reductions compared to the full model. As <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM169"><mml:mi>&#x03BB;</mml:mi></mml:math></inline-formula> increases to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM170"><mml:mn>1.0</mml:mn></mml:math></inline-formula>, there is a more pronounced decline in ACC to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM171"><mml:mn>0.87687</mml:mn></mml:math></inline-formula>, indicating that larger values may negatively affect overall accuracy. Adjustments to the hyperparameter <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM172"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> reveal similar trends; for instance, at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM173"><mml:mi>&#x03B1;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.001</mml:mn></mml:math></inline-formula>, ACC drops to <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM174"><mml:mn>0.88735</mml:mn></mml:math></inline-formula> with corresponding decreases in other metrics such as PPV and NPV compared to the baseline model&#x2019;s performance. For the hyperparameter <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM175"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula>, we observe that at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM176"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.0001</mml:mn></mml:math></inline-formula>, ACC remains relatively high at <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM177"><mml:mn>0.89944</mml:mn></mml:math></inline-formula>. However, increasing <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM178"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> leads to lower performance metrics, with <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM179"><mml:mi>&#x03B2;</mml:mi><mml:mo>=</mml:mo><mml:mn>0.01</mml:mn></mml:math></inline-formula> resulting in an ACC of <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="IM180"><mml:mn>0.88584</mml:mn></mml:math></inline-formula>. Overall, the full model (rHGNN) consistently outperforms variations with different hyperparameters. This suggests that optimal tuning plays a crucial role in achieving superior model performance.</p>
</sec>
<sec id="s4d"><label>4.4</label><title>Study on MAFT</title>
<p>The introduction of the MAFT mode has had a significant impact on the injury patterns among female water polo players. HGNN provided valuable insights into the complex interactions within the team and identified specific patterns associated with increased injury risk. These findings suggest that tailored training interventions and injury prevention strategies should be developed, considering the unique demands of the MAFT mode. Future research should focus on validating these findings and exploring additional applications of HGNN in sports injury prevention. We recommend paying attention to the following points when implementing the MAFT training program:</p>
<p>
<list list-type="simple">
<list-item><label>1.</label>
<p>It is essential to adjust the frequency of training sessions to prevent overtraining and potential injuries. Sufficient rest periods should be incorporated into the training plan to allow athletes to fully recover. Excessive training frequency can lead to fatigue, decreased performance, and an increased risk of injury.</p></list-item>
<list-item><label>2.</label>
<p>Continuous monitoring of heart rate is crucial to ensure that athletes maintain their heart rate within a safe range during training. Wearable devices can be used for real-time heart rate monitoring, allowing coaches to adjust training intensity as needed. This approach helps prevent cardiovascular strain and optimize performance.</p></list-item>
<list-item><label>3.</label>
<p>Providing psychological support and counseling is vital for helping athletes cope with the stress and challenges of high-intensity training programs like MAFT. Establishing open communication channels enables athletes to express their needs and feedback, fostering a supportive environment.</p></list-item>
</list></p>
</sec>
</sec>
<sec id="s5" sec-type="conclusions"><label>5</label><title>Conclusion</title>
<p>This study investigated the impact of the Male-Assisted Female Training (MAFT) program on the injury patterns of female water polo players through hypergraph-based pattern analysis and classification perspectives. We first summarized the overall changes in injuries among female athletes under the MAFT program. Using the collected data, we conducted pattern analysis on the hypergraph structure and features, identified key influencing factors, and proposed enhanced preventive measures within the MAFT framework. Additionally, we analyzed the impact characteristics of various injuries before and after the implementation of MAFT from a classification standpoint, incorporating graph regularization techniques to achieve the highest classification accuracy. Our main findings are as follows:
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p>The introduction of the MAFT program significantly altered the injury patterns among female water polo players, particularly increasing the proportion of joint injuries involved in confrontational activities.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Hypergraph Neural Networks (HGNN) provided in-depth insights into the complex interactions within the team and identified specific patterns associated with increased injury risk.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Our rHGNN model, enhanced by graph regularization techniques, excelled in classification accuracy, positive predictive value, negative predictive value, sensitivity, and specificity, providing reliable scientific evidence for injury prevention.</p></list-item>
</list>These findings have important practical implications for water polo training and injury prevention. By adjusting the frequency of MAFT training sessions, continuously monitoring heart rates, and providing psychological support and counseling, tailored training interventions and injury prevention strategies can be developed to meet the unique demands of the MAFT mode. These strategies help optimize training methods, enhance athlete performance, and ensure their health and safety. Future research directions:
<list list-type="simple">
<list-item><label>&#x2022;</label>
<p>Validate the findings of this study and explore additional applications of HGNN in sports injury prevention.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Further investigate the impact of the MAFT program on athlete performance and injury risk, especially under varying training intensities and durations.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Research how to more effectively monitor the physiological and psychological states of athletes through technological means, such as wearable devices, to adjust training plans in real-time.</p></list-item>
<list-item><label>&#x2022;</label>
<p>Explore the applicability of the MAFT program to athletes of different levels and age groups, and how to adjust training methods based on individual differences.</p></list-item>
</list></p>
</sec>
</body>
<back>
<sec id="s6" sec-type="data-availability"><title>Data availability statement</title>
<p>The raw data supporting the conclusions of this article will be made available by the authors, without undue reservation.</p>
</sec>
<sec id="s7" sec-type="author-contributions"><title>Author contributions</title>
<p>XF: Conceptualization, Data curation, Formal Analysis, Funding acquisition, Investigation, Methodology, Project administration, Resources, Software, Supervision, Validation, Visualization, Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing. ZhiW: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing. ZheW: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing. CH: Writing &#x2013; original draft, Writing &#x2013; review &#x0026; editing. HX: Writing &#x2013; review &#x0026; editing. YC: Writing &#x2013; review &#x0026; editing. JD: Writing &#x2013; original draft. GC: Writing &#x2013; review &#x0026; editing. ZL: Writing &#x2013; original draft.</p>
</sec>
<sec id="s8" sec-type="funding-information"><title>Funding</title>
<p>The authors declare that no financial support was received for the research, authorship, and/or publication of this article.</p>
</sec>
<sec id="s9" sec-type="COI-statement"><title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec id="s11" sec-type="ai-statement"><title>Generative AI statement</title>
<p>The author(s) declare that no Gen AI was used in the creation of this manuscript</p>
</sec>
<sec id="s10" sec-type="disclaimer"><title>Publisher&#x0027;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list><title>References</title>
<ref id="B1"><label>1.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Frani&#x0107;</surname><given-names>M</given-names></name><name><surname>Ivkovi&#x0107;</surname><given-names>A</given-names></name><name><surname>Rudi&#x0107;</surname><given-names>R</given-names></name></person-group>. <article-title>Injuries in water polo</article-title>. <source>Croat Med J</source>. (<year>2007</year>) <volume>48</volume>:<fpage>281</fpage>&#x2013;<lpage>8</lpage>.</citation></ref>
<ref id="B2"><label>2.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Smith</surname><given-names>J</given-names></name><name><surname>Doe</surname><given-names>A</given-names></name><name><surname>Lee</surname><given-names>B</given-names></name></person-group>. <article-title>Analysis of water polo injuries during 8904 player matches at FINA World Championships and Olympic games to make the sport safer</article-title>. <source>Br J Sports Med.</source> (<year>2019</year>) <volume>53</volume>(<issue>5</issue>):<fpage>1</fpage>&#x2013;<lpage>10</lpage>. <pub-id pub-id-type="doi">10.1136/bjsports-2018-099349</pub-id><pub-id pub-id-type="pmid">30377175</pub-id></citation></ref>
<ref id="B3"><label>3.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schroeder</surname><given-names>GG</given-names></name><name><surname>McClintick</surname><given-names>DJ</given-names></name><name><surname>Trikha</surname><given-names>R</given-names></name><name><surname>Kremen</surname><given-names>TJ Jr.</given-names></name></person-group> <article-title>Injuries affecting intercollegiate water polo athletes: a descriptive epidemiologic study</article-title>. <source>Orthop J Sports Med.</source> (<year>2022</year>) <volume>10</volume>(7):23259671221110208. <pub-id pub-id-type="doi">10.1177/23259671221110208</pub-id></citation></ref>
<ref id="B4"><label>4.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Suzuki</surname><given-names>S</given-names></name><name><surname>Tomoda</surname><given-names>Y</given-names></name><name><surname>Miyanaga</surname><given-names>Y</given-names></name><name><surname>Takahashi</surname><given-names>G</given-names></name><name><surname>Sakata</surname><given-names>I</given-names></name><name><surname>Shiraki</surname><given-names>H</given-names></name></person-group>. <article-title>Shoulder injuries caused by throwing during water polo</article-title>. <source>Jpn J Phys Fit Sports Med</source>. (<year>1990</year>) <volume>39</volume>(1):<fpage>60</fpage>&#x2013;<lpage>8</lpage>. <pub-id pub-id-type="doi">10.7600/jspfsm1949.39.60</pub-id></citation></ref>
<ref id="B5"><label>5.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Xiaocui</surname><given-names>Y</given-names></name></person-group>. <article-title><italic>Research on shoulder injuries in high-level female water polo players in China</italic> (Master&#x2019;s thesis)</article-title>. <comment>Chengdu Sport University (2023)</comment>.</citation></ref>
<ref id="B6"><label>6.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di</surname><given-names>D</given-names></name><name><surname>Shi</surname><given-names>F</given-names></name><name><surname>Yan</surname><given-names>F</given-names></name><name><surname>Xia</surname><given-names>L</given-names></name><name><surname>Mo</surname><given-names>Z</given-names></name><name><surname>Ding</surname><given-names>Z</given-names></name></person-group>, et al. <article-title>Hypergraph learning for identification of COVID-19 with CT imaging</article-title>. <source>Med Image Anal</source>. (<year>2021</year>) <volume>68</volume>:<fpage>101910</fpage>. <pub-id pub-id-type="doi">10.1016/j.media.2020.101910</pub-id><pub-id pub-id-type="pmid">33285483</pub-id></citation></ref>
<ref id="B7"><label>7.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Feng</surname><given-names>Y</given-names></name><name><surname>You</surname><given-names>H</given-names></name><name><surname>Zhang</surname><given-names>Z</given-names></name><name><surname>Ji</surname><given-names>R</given-names></name><name><surname>Gao</surname><given-names>Y</given-names></name></person-group>. <article-title>Hypergraph neural networks</article-title>. <comment>In: <italic>AAAI 2019</italic> (2018)</comment>.</citation></ref>
<ref id="B8"><label>8.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>Y</given-names></name><name><surname>Zhang</surname><given-names>Z</given-names></name><name><surname>Lin</surname><given-names>H</given-names></name><name><surname>Zhao</surname><given-names>X</given-names></name><name><surname>Du</surname><given-names>S</given-names></name><name><surname>Zou</surname><given-names>C</given-names></name></person-group>. <article-title>Hypergraph learning: methods and practices</article-title>. <source>IEEE Trans Pattern Anal Mach Intell</source>. (<year>2020</year>) <volume>44</volume>:<fpage>2548</fpage>&#x2013;<lpage>66</lpage>.</citation></ref>
<ref id="B9"><label>9.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Huang</surname><given-names>H</given-names></name><name><surname>Chen</surname><given-names>M</given-names></name><name><surname>Duan</surname><given-names>Y</given-names></name></person-group>. <article-title>Dimensionality reduction of hyperspectral image using spatial-spectral regularized sparse hypergraph embedding</article-title>. <source>Remote Sens</source>. (<year>2019</year>) <volume>11</volume>:<fpage>1039</fpage>. <pub-id pub-id-type="doi">10.3390/rs11091039</pub-id></citation></ref>
<ref id="B10"><label>10.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Jiang</surname><given-names>J</given-names></name><name><surname>Wei</surname><given-names>Y</given-names></name><name><surname>Feng</surname><given-names>Y</given-names></name><name><surname>Cao</surname><given-names>J</given-names></name><name><surname>Gao</surname><given-names>Y</given-names></name></person-group>. <article-title>Dynamic hypergraph neural networks</article-title>. In: <source>IJCAI</source>. (<year>2019</year>). p. <fpage>2635</fpage>&#x2013;<lpage>41</lpage>.</citation></ref>
<ref id="B11"><label>11.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Di</surname><given-names>D</given-names></name><name><surname>Yang</surname><given-names>J</given-names></name><name><surname>Luo</surname><given-names>C</given-names></name><name><surname>Xue</surname><given-names>Z</given-names></name><name><surname>Chen</surname><given-names>W</given-names></name><name><surname>Yang</surname><given-names>X</given-names></name></person-group>, et al. <article-title>Hyper-3dg: text-to-3d gaussian generation via hypergraph</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:2403.09236</italic> (2024)</comment>.</citation></ref>
<ref id="B12"><label>12.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Di</surname><given-names>D</given-names></name><name><surname>Zhang</surname><given-names>J</given-names></name><name><surname>Lei</surname><given-names>F</given-names></name><name><surname>Tian</surname><given-names>Q</given-names></name><name><surname>Gao</surname><given-names>Y</given-names></name></person-group>. <article-title>Big-hypergraph factorization neural network for survival prediction from whole slide image</article-title>. <source>IEEE Trans Image Process</source>. (<year>2022</year>) <volume>31</volume>:<fpage>1149</fpage>&#x2013;<lpage>60</lpage>. <pub-id pub-id-type="doi">10.1109/TIP.2021.3139229</pub-id><pub-id pub-id-type="pmid">34982683</pub-id></citation></ref>
<ref id="B13"><label>13.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gao</surname><given-names>Y</given-names></name><name><surname>Feng</surname><given-names>Y</given-names></name><name><surname>Ji</surname><given-names>S</given-names></name><name><surname>Ji</surname><given-names>R</given-names></name></person-group>. <article-title>Hgnn+: General hypergraph neural networks</article-title>. <source>IEEE Trans Pattern Anal Mach Intell</source>. (<year>2022</year>) <volume>45</volume>:<fpage>3181</fpage>&#x2013;<lpage>99</lpage>. <pub-id pub-id-type="doi">10.1109/TPAMI.2022.3182052</pub-id></citation></ref>
<ref id="B14"><label>14.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Miller</surname><given-names>AH</given-names></name><name><surname>Evans</surname><given-names>K</given-names></name><name><surname>Adams</surname><given-names>R</given-names></name><name><surname>Waddington</surname><given-names>G</given-names></name><name><surname>Witchalls</surname><given-names>J</given-names></name></person-group>. <article-title>Shoulder injury in water polo: a systematic review of incidence and intrinsic risk factors</article-title>. <source>J Sci Med Sport</source>. (<year>2018</year>) <volume>21</volume>:<fpage>368</fpage>&#x2013;<lpage>77</lpage>. <pub-id pub-id-type="doi">10.1016/j.jsams.2017.08.015</pub-id><pub-id pub-id-type="pmid">28919494</pub-id></citation></ref>
<ref id="B15"><label>15.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Webster</surname><given-names>M</given-names></name><name><surname>Morris</surname><given-names>M</given-names></name><name><surname>Williams</surname><given-names>G</given-names></name></person-group>. <article-title>Shoulder pain in water polo: impact on performance in training and playing</article-title>. <source>J Sci Med Sport</source>. (<year>2010</year>) <volume>13</volume>:<fpage>e78</fpage>. <pub-id pub-id-type="doi">10.1016/j.jsams.2010.10.627</pub-id></citation></ref>
<ref id="B16"><label>16.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Croteau</surname><given-names>F</given-names></name><name><surname>Brown</surname><given-names>H</given-names></name><name><surname>Pearsall</surname><given-names>D</given-names></name><name><surname>Robbins</surname><given-names>SM</given-names></name></person-group>. <article-title>Prevalence and mechanisms of injuries in water polo: a systematic review</article-title>. <source>BMJ Open Sport Exerc Med</source>. (<year>2021</year>) <volume>7</volume>:<fpage>e001081</fpage>. <pub-id pub-id-type="doi">10.1136/bmjsem-2021-001081</pub-id><pub-id pub-id-type="pmid">34150321</pub-id></citation></ref>
<ref id="B17"><label>17.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Junge</surname><given-names>A</given-names></name><name><surname>Langevoort</surname><given-names>G</given-names></name><name><surname>Pipe</surname><given-names>A</given-names></name><name><surname>Peytavin</surname><given-names>A</given-names></name><name><surname>Wong</surname><given-names>F</given-names></name><name><surname>Mountjoy</surname><given-names>M</given-names></name></person-group>, et al. <article-title>Injuries in team sport tournaments during the 2004 olympic games</article-title>. <source>Am J Sports Med</source>. (<year>2006</year>) <volume>34</volume>:<fpage>565</fpage>&#x2013;<lpage>76</lpage>. <pub-id pub-id-type="doi">10.1177/0363546505281807</pub-id><pub-id pub-id-type="pmid">16303876</pub-id></citation></ref>
<ref id="B18"><label>18.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mountjoy</surname><given-names>M</given-names></name><name><surname>Junge</surname><given-names>A</given-names></name><name><surname>Alonso</surname><given-names>JM</given-names></name><name><surname>Engebretsen</surname><given-names>L</given-names></name><name><surname>Dragan</surname><given-names>I</given-names></name><name><surname>Gerrard</surname><given-names>D</given-names></name></person-group>, et al. <article-title>Sports injuries and illnesses in the 2009 fina world championships (aquatics)</article-title>. <source>Br J Sports Med</source>. (<year>2010</year>) <volume>44</volume>:<fpage>522</fpage>&#x2013;<lpage>7</lpage>. <pub-id pub-id-type="doi">10.1136/bjsm.2010.071720</pub-id><pub-id pub-id-type="pmid">20460256</pub-id></citation></ref>
<ref id="B19"><label>19.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mountjoy</surname><given-names>M</given-names></name><name><surname>Junge</surname><given-names>A</given-names></name><name><surname>Benjamen</surname><given-names>S</given-names></name><name><surname>Boyd</surname><given-names>K</given-names></name><name><surname>Diop</surname><given-names>M</given-names></name><name><surname>Gerrard</surname><given-names>D</given-names></name></person-group>, et al. <article-title>Competing with injuries: injuries prior to and during the 15th fina world championships 2013 (aquatics)</article-title>. <source>Br J Sports Med</source>. (<year>2015</year>) <volume>49</volume>:<fpage>37</fpage>&#x2013;<lpage>43</lpage>. <pub-id pub-id-type="doi">10.1136/bjsports-2014-093991</pub-id><pub-id pub-id-type="pmid">25326096</pub-id></citation></ref>
<ref id="B20"><label>20.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Stromberg</surname><given-names>JD</given-names></name></person-group>. <article-title>Care of water polo players</article-title>. <source>Curr Sports Med Rep</source>. (<year>2017</year>) <volume>16</volume>:<fpage>363</fpage>&#x2013;<lpage>9</lpage>. <pub-id pub-id-type="doi">10.1249/JSR.0000000000000409</pub-id><pub-id pub-id-type="pmid">28902761</pub-id></citation></ref>
<ref id="B21"><label>21.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Zhang</surname><given-names>J</given-names></name></person-group>. <article-title><italic>Comparative study on the defensive capabilities of the Chinese women&#x2019;s water polo team and the top three teams at the 2019 world championships</italic> (Ph.D. thesis)</article-title>. <comment>Chengdu Sport University (2021)</comment>.</citation></ref>
<ref id="B22"><label>22.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ingoe</surname><given-names>HMA</given-names></name><name><surname>Mohammed</surname><given-names>K</given-names></name><name><surname>Malone</surname><given-names>AA</given-names></name><name><surname>Beadle</surname><given-names>G</given-names></name><name><surname>Sharpe</surname><given-names>T</given-names></name><name><surname>Cockfield</surname><given-names>A</given-names></name><etal/></person-group> <article-title>Traumatic posterior sternoclavicular joint dislocation &#x2013; current aspects of management</article-title>. <source>Injury</source>. (<year>2023</year>) <volume>54</volume>(<issue>11</issue>):110983. <pub-id pub-id-type="doi">10.1016/j.injury.2023.110983</pub-id><pub-id pub-id-type="pmid">37634999</pub-id></citation></ref>
<ref id="B23"><label>23.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wang</surname><given-names>Y</given-names></name><name><surname>Chen</surname><given-names>J</given-names></name></person-group>. <article-title>Advances in the treatment of instability and degenerative sternoclavicular arthritis</article-title>. <source>Chin J Shoulder Elbow Surg</source>. (<year>2014</year>) <volume>2</volume>:<fpage>263</fpage>&#x2013;<lpage>9</lpage>.</citation></ref>
<ref id="B24"><label>24.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Warth</surname><given-names>RJ</given-names></name><name><surname>Lee</surname><given-names>JT</given-names></name><name><surname>Campbell</surname><given-names>KJ</given-names></name><name><surname>Millett</surname><given-names>PJ</given-names></name></person-group>. <article-title>Arthroscopic sternoclavicular joint resection arthroplasty: a technical note and illustrated case report</article-title>. <source>Arthrosc Tech.</source> (<year>2014</year>) <volume>3</volume>(1):<fpage>e165</fpage>&#x2013;<lpage>73</lpage>. <pub-id pub-id-type="doi">10.1016/j.eats.2013.09.019</pub-id><pub-id pub-id-type="pmid">24749040</pub-id></citation></ref>
<ref id="B25"><label>25.</label><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Cortes</surname><given-names>C</given-names></name></person-group>. <article-title>Support-vector networks</article-title>. <source>Mach Learn</source>. (<year>1995</year>) <volume>20</volume>(<issue>3</issue>):<fpage>273</fpage>&#x2013;<lpage>97</lpage>. <pub-id pub-id-type="doi">10.1023/A:1022627411411</pub-id></citation></ref>
<ref id="B26"><label>26.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Kipf</surname><given-names>TN</given-names></name><name><surname>Welling</surname><given-names>M</given-names></name></person-group>. <article-title>Semi-supervised classification with graph convolutional networks</article-title>. <comment><italic>arXiv</italic> [Preprint]. <italic>arXiv:1609.02907</italic> (2016)</comment>.</citation></ref>
<ref id="B27"><label>27.</label><citation citation-type="other"><person-group person-group-type="author"><name><surname>Wang</surname><given-names>J</given-names></name><name><surname>Wang</surname><given-names>Y</given-names></name><name><surname>Yang</surname><given-names>Z</given-names></name><name><surname>Yang</surname><given-names>L</given-names></name><name><surname>Guo</surname><given-names>Y</given-names></name></person-group>. <article-title>Bi-GCN: binary graph convolutional network</article-title>. In: <comment><italic>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</italic>. (2021). p. 1561&#x2013;70</comment>.</citation></ref></ref-list>
</back>
</article>