Higher-order Relations Research Articles

Integrating higher-order relations for enhanced twitter bot detection

AbstractBot detection is a critical task in preserving the integrity of social networks and mitigating online disinformation. Despite advances in graph-based methods for detecting bots, these models often rely on follow relations, assuming that users sharing similar characteristics are more likely to connect. However, these methods often fail to address complex behavioral patterns indicative of coordinated bot activities, allowing bot developers to avoid detection more easily. We investigate the potential of integrating behavioral and higher-order relations, focusing on Retweet, Co-Retweet (where two users retweet the same tweet) and Co-Hashtag (where two users frequently use the same hashtag), and compare these against conventional follower and following relations. We further explore the process of relation creation, particularly highlighting the Co-Hashtag relation’s robustness against data collection flaws and its ability to mitigate shortcomings in the collection of datasets. Our experiments not only contribute to the ongoing efforts to address challenges in bot detection, but also open up new avenues for exploring how complex network patterns can be employed for social network analysis.

A Review of Hypergraph Neural Networks

In recent years, Graph Neural Networks (GNNs) have seen notable success in fields such as recommendation systems and natural language processing, largely due to the availability of vast amounts of data and powerful computational resources. GNNs are primarily designed to work with graph data that involve pairwise relationships. However, in many real-world networks, the relationships between entities are complex and go beyond simple pairwise connections, as seen in scientific collaboration networks, protein networks, and similar domains. If these complex relationships are directly represented as pairwise relationships using graph structures, it can lead to information loss. A hypergraph, as a special kind of graph-structured data, can represent higher-order relationships that cannot be fully captured by graphs, thereby addressing the limitations of graphs. In light of this, researchers have begun to focus on how to design neural networks on hypergraphs, leading to the proposal of hypergraph neural network (HGNN) models for downstream tasks. Therefore, this paper reviews the existing hypergraph neural network models. The review is conducted from two perspectives: spectral analysis methods and neural network methods on hypergraphs, discussing both unfolded and non-unfolded methods, and further subdividing them based on their algorithm characteristics and application scenarios. Subsequently, the design concepts of various algorithms are analyzed and compared, and the advantages and disadvantages of each type of algorithm are summarized based on experimental results. Finally, potential future research directions in hypergraph learning are discussed.

Trustworthiness-Driven Graph Convolutional Networks for Signed Network Embedding

The problem of representing nodes in a signed network as low-dimensional vectors, known as signed network embedding (SNE), has garnered considerable attention in recent years. While several SNE methods based on graph convolutional networks (GCNs) have been proposed for this problem, we point out that they significantly rely on the assumption that the decades-old balance theory always holds in the real-world. To address this limitation, we propose a novel GCN-based SNE approach, named as TrustSGCN, which corrects for incorrect embedding propagation in GCN by utilizing the trustworthiness on edge signs for high-order relationships inferred by the balance theory. The proposed approach consists of three modules: (M1) generation of each node’s extended ego-network; (M2) measurement of trustworthiness on edge signs; and (M3) trustworthiness-aware propagation of embeddings. Specifically, TrustSGCN leverages topological information to measure trustworthiness on edge sign for high-order relationships inferred by balance theory. It then considers structural properties inherent to an input network, such as the ratio of triads, to correct for incorrect embedding propagation. Furthermore, TrustSGCN learns the node embeddings by leveraging two well-known social theories, i.e., balance and status, to jointly preserve the edge sign and direction between nodes connected by existing edges in the embedding space. The experiments on six real-world signed network datasets demonstrate that TrustSGCN consistently outperforms six state-of-the-art GCN-based SNE methods. The code is available at https://github.com/kmj0792/TrustSGCN .

Domain Transfer-Based Hypergraph Convolutional Network for Posture Anomaly Detection in Physical Education Teaching

Human skeleton-based posture anomaly detection has been widely applied in the field of physical education teaching. The existing spatio-temporal graph convolutional networks (ST-GCN) can fully utilize the local and global information of the human skeleton for action recognition, but the entire model requires a large amount of computation and the modeling of high-order relationships between joint points of the human skeleton is insufficient. To this end, this paper proposes a novel domain adaptive hypergraph convolutional network for basketball posture anomaly analysis by exploiting 2D skeleton information. First, we designed an effective hypergraph convolution feature extraction network to improve the high-order dependency modeling. To further improve the performance of the hypergraph convolutional network, we introduce domain adaptive learning technology to supervise the feature extraction learning of the target domain (2D skeleton) through the source domain (3D skeleton). At last, we construct a basketball action teaching analysis dataset for model evaluation. We conducted a large number of comparative experiments on the public dataset NTU RGB+D and our self-built dataset. All the results showed that our proposed hypergraph convolutional model effectively extracts features of 2D human skeletons, and by introducing domain adaptive learning, the performance of basketball anomaly detection is further improved.

Enhanced tensor based embedding anchor learning for multi-view clustering

Existing anchor graph based multi-view clustering methods can overcome the problem of high computational cost in traditional multi-view clustering methods. However, the anchor points selected from high-dimensional data often contain irrelevant noise and outliers, which would affect the clustering performance. To address this issue, we propose an embedding anchor based multi-view clustering method, called enhanced tensor based embedding anchor learning (ETEAL). Specifically, we unify the learning process of latent embedding space, anchor points, and anchor graphs into a common framework, which eliminates noise and redundant data in the original space and enhances the synergistic optimization between the components. Meanwhile, we employ an enhanced tensor strategy to constrain the embedding anchor graphs, which exploits the higher-order relationships between views and recovers the global low-rank property of the embedding anchor graphs. Finally, we develop an anchor graph fusion strategy, which significantly reduces the huge overhead of traditional graph fusion that requires the construction of complete graphs. Experimental results on eight benchmark datasets show that the proposed method significantly outperforms other state-of-the-art methods in terms of scalability and clustering accuracy.

Learning accurate neighborhood- and self-information for higher-order relation prediction in Heterogeneous Information Networks

Heterogeneous Information Networks (HINs) are commonly employed to model complex real-world scenarios with diverse node and edge types. However, due to constraints in data collection and processing, constructed networks often lack certain relations. Consequently, various methods have emerged, particularly recently, leveraging heterogeneous graph neural networks (HGNNs) to predict missing relations. Nevertheless, these methods primarily focus on pairwise relations between two nodes. Real-world interactions, however, often involve multiple nodes and diverse types, extending beyond simple pairwise relations. For instance, academic collaboration networks may entail interactions among authors, papers, and conferences simultaneously. Despite their prevalence, higher-order relations are often overlooked. While HGNNs are effective at learning network structures, they may suffer from over-smoothing, resulting in similar representations for nodes and their neighbors. The learned inaccurate proximity among nodes impedes the discernment of higher-order relations. Furthermore, observed edges among a target group of nodes can provide valuable evidence for predicting higher-order relations. To address these challenges, we propose a novel model called Accurate Neighborhood- and Self-information Enhanced Heterogeneous Graph Neural Network (ANSE-HGN). Building upon HGNNs to encode network structure and attributes, we introduce a relation-based neighborhood encoder to capture information within multi-hop neighborhoods in heterogeneous higher-order relations. This enables the calculation of accurate proximity among target groups of nodes, thereby enhancing prediction accuracy. Additionally, we leverage self-information from observed higher-order relations as an auxiliary loss to reinforce the learning process. Extensive experiments on four real-world datasets demonstrate the superiority of our proposed method in higher-order relation prediction tasks.

Dual semi-supervised hypergraph regular multi-view NMF with anchor graph embedding

Graph regularized nonnegative matrix factorization (GNMF) has been widely used in multi-view clustering tasks due to its good clustering properties. However, it uses a simple graph to describe the complex data relationship of multiple views and tries to obtain a consistent low-dimensional representation, which undoubtedly brings challenges to its clustering performance. In addition, clustering a large amount of high-dimensional data from multiple views undoubtedly faces a huge computational burden. In order to effectively improve the performance and efficiency of GNMF based multi-view clustering algorithm, this paper proposes a dual semi-supervised hypergraph regular multi-view clustering method with anchor graph embedding (DSSHMNMFAE). Specifically, DSSHMNMFAE develops a new anchor selection method to generate anchors and the anchor bipartite graph is constructed to embed the matrix factorization process. DSSHMNMFAE constructs a hypergraph to effectively learn the high-order relationship between data from multiple views. In order to perform semi-supervised learning more efficiently, DSSHMNMFAE integrates pairwise constraint information and label constraint information into the clustering process as dual label information. In addition, DSSHMNMFAE considers the learning of both consistency information and complementarity information, and adopts adaptive measures to distinguish the contributions of different views. We use the alternating iterative algorithm to optimize the objective function of DSSHMNMFAE. The experimental results on eight real datasets show that the performance of DSSHMNMFAE is comparable to other algorithms.

Bias in O-Information Estimation.

Higher-order relationships are a central concept in the science of complex systems. A popular method of attempting to estimate the higher-order relationships of synergy and redundancy from data is through the O-information. It is an information-theoretic measure composed of Shannon entropy terms that quantifies the balance between redundancy and synergy in a system. However, bias is not yet taken into account in the estimation of the O-information of discrete variables. In this paper, we explain where this bias comes from and explore it for fully synergistic, fully redundant, and fully independent simulated systems of n=3 variables. Specifically, we explore how the sample size and number of bins affect the bias in the O-information estimation. The main finding is that the O-information of independent systems is severely biased towards synergy if the sample size is smaller than the number of jointly possible observations. This could mean that triplets identified as highly synergistic may in fact be close to independent. A bias approximation based on the Miller-Maddow method is derived for the O-information. We find that for systems of n=3 variables the bias approximation can partially correct for the bias. However, simulations of fully independent systems are still required as null models to provide a benchmark of the bias of the O-information.

HyperCLR: A Personalized Sequential Recommendation Algorithm Based on Hypergraph and Contrastive Learning

Sequential recommendations aim to predict users’ next interactions by modeling their interaction sequences. Most existing work concentrates on user preferences within these sequences, overlooking the complex item relationships across sequences. Additionally, these studies often fail to address the diversity of user interests, thus not capturing their varied latent preferences effectively. To tackle these problems, this paper develops a novel recommendation algorithm based on hypergraphs and contrastive learning named HyperCLR. It dynamically incorporates the time and location embeddings of items to model high-order relationships in user preferences. Moreover, we developed a graph construction approach named IFDG, which utilizes global item visit frequencies and spatial distances to discern item relevancy. By sampling subgraphs from IFDG, HyperCLR can align the representations of identical interaction sequences closely while distinguishing them from the broader global context on IFDG. This approach enhances the accuracy of sequential recommendations. Furthermore, a gating mechanism is designed to tailor the global context information to individual user preferences. Extensive experiments on Taobao, Books and Games datasets have shown that HyperCLR consistently surpasses baselines, demonstrating the effectiveness of the method. In particular, in comparison to the best baseline methods, HyperCLR demonstrated a 29.1% improvement in performance on the Taobao dataset.

B - 93 The Role of ex-Gaussian Parameters and Apathy in Reward Sensitivity Using a Modified Probabilistic Learning Task

Abstract Objective The current study examined the associations of apathy with attentional processes, indicated by ex-Gaussian (Ex-G) parameters of sensorimotor response speed and reward learning. Methods One hundred college-aged participants (M age = 20.32; SD = 3.69; 69 female) completed self-report measures of depression, apathy, and attentional control. Laboratory tasks included a choice reaction time (RT) task and a modified probabilistic learning task to assess sensorimotor processing and reward sensitivity. In the probabilistic learning task, participants selected the symbol associated with a high probability of gaining a monetary reward. Choice RT data were fit with Ex-G models, from which the parameter τ (bootstrapped sampling, 1000 iterations) was derived and used as the index of attentional lapses. Results A non-linear relationship was found between apathy and reward learning. Hierarchical regression was used to examine linear and higher-order relationships between apathy and behavioral indices (Ex-G τ and reward sensitivity). Results show that apathy explained none of the variance in reward learning (β = −0.005, p = 0.792, [bootstrapCI = −0.037, 0.026]). Incorporating apathy2 into the model led to significant R2 change (0.086), F(2, 89) = 0.4.142, p = 0.019, suggesting that as apathy increases, reward learning increases (β =0.006, p = 0.002, bootstrapCI = 0.002, 0.010]). Moreover, when controlling for depression, τ significantly contributes to the model, F(3, 89) = 4.142, p = 0.019, R2 = 0.17. Interactive effects revealed that at higher levels of apathy, higher Ex-G τ significantly decreases reward sensitivity (β = −0.003, p = 0.037, 95% bootstrapCI = [−0.006, −002]). Conclusions Higher levels of apathy and attentional lapses jointly reduced reward sensitivity, highlighting the role of task disengagement in apathy.

Distance Enhanced Hypergraph Learning for Dynamic Node Classification

Dynamic node classification aims to predict the labels of nodes in the dynamic networks. Existing methods primarily utilize the graph neural networks to acquire the node features and original graph structure features. However, these approaches ignore the high-order relationships between nodes and may lead to the over-smoothing issue. To address these issues, we propose a distance enhanced hypergraph learning (DEHL) method for dynamic node classification. Specifically, we first propose a time-adaptive pre-training component to generate the time-aware representations of each node. Then we utilize a dual-channel convolution module to construct the local and global hypergraphs which contain the corresponding local and global high-order relationships. Moreover, we adopt the K-nearest neighbor algorithm to construct the global hypergraph in the embedding space. After that, we adopt the node convolution and hyperedge convolution to aggregate the features of neighbors on the hypergraphs to the target node. Finally, we combine the temporal representations and the distance enhanced representations of the target node to predict its label. In addition, we conduct extensive experiments on two public dynamic graph datasets, i.e., Wikipedia and Reddit. The experimental results show that DEHL outperforms the state-of-the-art baselines in terms of AUC.

Hypergraph-Based Influence Maximization in Online Social Networks

Influence maximization in online social networks is used to select a set of influential seed nodes to maximize the influence spread under a given diffusion model. However, most existing proposals have huge computational costs and only consider the dyadic influence relationship between two nodes, ignoring the higher-order influence relationships among multiple nodes. It limits the applicability and accuracy of existing influence diffusion models in real complex online social networks. To this end, in this paper, we present a novel information diffusion model by introducing hypergraph theory to determine the most influential nodes by jointly considering adjacent influence and higher-order influence relationships to improve diffusion efficiency. We mathematically formulate the influence maximization problem under higher-order influence relationships in online social networks. We further propose a hypergraph sampling greedy algorithm (HSGA) to effectively select the most influential seed nodes. In the HSGA, a random walk-based influence diffusion method and a Monte Carlo-based influence approximation method are devised to achieve fast approximation and calculation of node influences. We conduct simulation experiments on six real datasets for performance evaluations. Simulation results demonstrate the effectiveness and efficiency of the HSGA, and the HSGA has a lower computational cost and higher seed selection accuracy than comparison mechanisms.

Modeling High-Order Relationships: Brain-Inspired Hypergraph-Induced Multimodal-Multitask Framework for Semantic Comprehension.

Semantic comprehension aims to reasonably reproduce people's real intentions or thoughts, e.g., sentiment, humor, sarcasm, motivation, and offensiveness, from multiple modalities. It can be instantiated as a multimodal-oriented multitask classification issue and applied to scenarios, such as online public opinion supervision and political stance analysis. Previous methods generally employ multimodal learning alone to deal with varied modalities or solely exploit multitask learning to solve various tasks, a few to unify both into an integrated framework. Moreover, multimodal-multitask cooperative learning could inevitably encounter the challenges of modeling high-order relationships, i.e., intramodal, intermodal, and intertask relationships. Related research of brain sciences proves that the human brain possesses multimodal perception and multitask cognition for semantic comprehension via decomposing, associating, and synthesizing processes. Thus, establishing a brain-inspired semantic comprehension framework to bridge the gap between multimodal and multitask learning becomes the primary motivation of this work. Motivated by the superiority of the hypergraph in modeling high-order relations, in this article, we propose a hypergraph-induced multimodal-multitask (HIMM) network for semantic comprehension. HIMM incorporates monomodal, multimodal, and multitask hypergraph networks to, respectively, mimic the decomposing, associating, and synthesizing processes to tackle the intramodal, intermodal, and intertask relationships accordingly. Furthermore, temporal and spatial hypergraph constructions are designed to model the relationships in the modality with sequential and spatial structures, respectively. Also, we elaborate a hypergraph alternative updating algorithm to ensure that vertices aggregate to update hyperedges and hyperedges converge to update their connected vertices. Experiments on the dataset with two modalities and five tasks verify the effectiveness of HIMM on semantic comprehension.

Robustness study of hybrid hypergraphs

Recently, researchers have used the pairwise networks (lower-order) or hypergraphs (higher-order) to separately model different real systems. However, some real systems may simultaneously exist lower-order and higher-order relationships, for example, in scientist collaboration networks, there exist lower-order relationships, representing whether scientists know each other, as well as higher-order relationships, indicating shared research tasks among multiple scientists, such as co-authors of papers. In light of this, a hybrid hypergraph model that considers both lower-order and higher-order relationships is firstly considered in this work. And then, we focus on studying the robustness of hybrid hypergraphs owing to the importance of this issue. Specifically, we first introduce a collaboration efficiency (CE) metric to measure the robustness of hybrid hypergraphs. We further propose a novel edge removal strategy, termed EIHED (Edge-Included Hyperedge Efficiency Discrepancy), to study its impact on the robustness of hybrid hypergraphs. Finally, we further validate the effectiveness of our proposed strategy from both node attacking strategy and edge protection strategy.

Incomplete multi-view clustering via confidence graph completion based tensor decomposition

In recent years, extensive incomplete multi-view clustering models have been proposed to solve the problem of real-world multi-view data with missing views. However, they still have the following two drawbacks: (1) They ignore the harmful effects of outliers in data and the noise generated during graph recovery. (2) They do not fully explore the high-order relationships among views. To this end, we design a novel graph learning model called confidence graph completion based tensor decomposition (CGCTD) for incomplete multi-view clustering. Specifically, we use the confidence graphs to guide the learning of the complete graphs, which reduces the detrimental effects of outliers and missing samples in the data. Then, we stack the complete graphs of each view into an original tensor to explore high-order relationships and correlations between views. To reduce the negative effects of noise, we decompose the original tensor into an essential tensor and a noise tensor. The essential tensor is introduced to recover the accurate affinity graphs, and the noise tensor aims to model the noise contained in the corrupted graphs. Furthermore, we impose the tensor Schatten p-norm constraint on the essential tensor, which can enhance the low-rank property of the graphs and explore the similarity structure between views. Through extensive experiments on eight benchmark datasets, we demonstrate that the proposed CGCTD outperforms several existing state-of-the-art methods.

Sparse feature selection using hypergraph Laplacian-based semi-supervised discriminant analysis

Feature selection, as a dimension reduction technique in data mining and pattern recognition, aims to select the most discriminative features and improve the learning performance. With an abundance of unlabeled data readily available across various applications, semi-supervised feature selection has emerged as a promising approach. While most semi-supervised feature selection methods rely on simple graphs to preserve the geometrical structure of data, this approach often fails in capturing the high-order relationships present in many real-world applications. In contrast, hypergraphs offer the ability to encode more complex structures of data beyond what a simple graph can achieve. In this paper, we propose a feature selection method formulated in the trace ratio form, integrating hypergraph Laplacian-based semi-supervised discriminant analysis (SDA) and the mixed convex and non-convex ℓ2,p-norm (0<p≤1) regularization. The proposed trace ratio-based method, called HSDAFS, leverages the discriminative information from labeled data to maximize class separability while also utilizing the hypergraph Laplacian to capture the geometrical structure and high-order relationships within both labeled and unlabeled data. The ℓ2,p-norm regularization in the proposed HSDAFS provides improved sparsity over the ℓ2,1-norm. It ensures that the projection matrix is row-sparse, enabling the effective joint selection of discriminative features across all data. To solve the trace ratio-based HSDAFS method, we convert it into a trace difference method and propose an iterative algorithm. Experiments on several datasets demonstrate that HSDAFS is more effective in selecting the most discriminative features compared to other methods.

DualSyn: A dual-level feature interaction method to predict synergistic drug combinations

Drug combination therapy can reduce drug resistance and improve treatment efficacy, making it an increasingly promising cancer treatment method. Although existing computational methods have achieved significant success, predictions on unseen data remain a challenge. There are complex associations between drug pairs and cell lines, and existing models cannot capture more general feature interaction patterns among them, which hinders the ability of models to generalize from seen samples to unseen samples. To address this problem, we propose a dual-level feature interaction model called DualSyn to efficiently predict the synergy of drug combination therapy. This model first achieves interaction at the drug pair level through the drugs feature extraction module. We also designed two modules to further deepen the interaction at the drug pair and cell line level from two different perspectives. The high-order relation module is used to capture the high-order relationships among the three features, and the global information module focuses on preserving global information details. DualSyn not only improves the AUC by 2.15% compared with the state-of-the-art methods in the transductive task of the benchmark dataset, but also surpasses them in all four tasks under the inductive setting. Overall, DualSyn shows great potential in predicting and explaining drug synergistic therapies, providing a powerful new tool for future clinical applications.

Origins of biological teleology: how constraints represent ends

To naturalize the concept of teleological causality in biology it is not enough to avoid assuming backward causation or positing the existence of an inscrutable teleological essence like the élan vital. We must also specify how the causality of organisms is distinct from the causality of designed artifacts like thermostats or asymmetrically oriented processes like the ubiquitous increase of entropy. Historically, the concept of teleological causality in biology has been based on an analogy to the familiar experience of purposeful action. This is experienced by us as a disposition to achieve a general type of end that is represented in advance, and which regulates the selection of efficient means to achieve it. Inspired by this analogy, to bridge the gap between biology and human agency we describe a simple molecular process called autogenesis that shows how two linked complementary self-organizing processes can give rise to higher-order relations that resemble purposeful dispositions, though expressed in terms of constraints on molecular processes. Because the autogenic model is described in sufficient detail to be empirically realizable, it provides a proof of principle demonstrating a simple form of teleological causality.

Hypergraph clustering based multi-label cross-modal retrieval

Most existing cross-modal retrieval methods face challenges in establishing semantic connections between different modalities due to inherent heterogeneity among them. To establish semantic connections between different modalities and align relevant semantic features across modalities, so as to fully capture important information within the same modality, this paper considers the superiority of hypergraph in representing higher-order relationships, and proposes an image-text retrieval method based on hypergraph clustering. Specifically, we construct hypergraphs to capture feature relationships within image and text modalities, as well as between image and text. This allows us to effectively model complex relationships between features of different modalities and explore the semantic connectivity within and across modalities. To compensate for potential semantic feature loss during the construction of the hypergraph neural network, we design a weight-adaptive coarse and fine-grained feature fusion module for semantic supplementation. Comprehensive experimental results on three common datasets demonstrate the effectiveness of the proposed method.

Heterogeneous Meta-Path Graph Learning for Higher-Order Social Recommendation

Recommendation systems have become an indispensable part of daily life. Social recommendation systems, which utilize social relationships and past behaviors to infer users’ preferences, have gained popularity in recent years. Exploring the inherent characteristics implied by higher-order relationships offers a new approach to social recommendation. However, it is challenging due to sparse social networks, influence heterogeneity, and noisy feedback. In this article, we propose a Heterogeneous Meta-path Graph Learning model for Higher-order Social Recommendation (HEAL). Within HEAL, we introduce a heterogeneous graph in social recommendation and utilize a meta-path-guided random walk to generate higher-order relationships. By encoding higher-order structures and semantics along different meta-graphs, HEAL can mitigate the limitation of data sparsity. Moreover, HEAL exploits aspect-aware and semantic-aware attentions to adaptively propagate and aggregate useful features from different meta-neighbors and higher-order relations. These attention-based aggregation layers allow HEAL to suppress the heterogeneity of social influences. Furthermore, HEAL adopts contrastive learning as a supplemental task to the recommendation task by maximizing the consistency between the self-discriminating objectives. This auxiliary task enables the model to learn more differentiated representations, further reducing its sensitivity to noisy feedback. We evaluate the performance of HEAL through extensive experiments on public datasets. The results demonstrate that leveraging higher-order relations can enhance the quality of social recommendations by better capturing the complexity and diversity of users’ preferences and interactions.