Legal Judgment Prediction (LJP) aims to automatically predict a law case’s judgment results based on the text description of its facts. In practice, the confusing law articles (or charges) problem frequently occurs, reflecting that the law cases applicable to similar articles (or charges) tend to be misjudged. Although some recent works based on prior knowledge solve this issue well, they ignore that confusion also occurs between law articles with a high posterior semantic similarity due to the data imbalance problem instead of only between the prior highly similar ones, which is this work’s further finding. This article proposes an end-to-end model named D-LADAN to solve the above challenges. On the one hand, D-LADAN constructs a graph among law articles based on their text definition and proposes a graph distillation operator (GDO) to distinguish the ones with a high prior semantic similarity. On the other hand, D-LADAN presents a novel momentum-updated memory mechanism to dynamically sense the posterior similarity between law articles (or charges) and a weighted GDO to adaptively capture the distinctions for revising the inductive bias caused by the data imbalance problem. We perform extensive experiments to demonstrate that D-LADAN significantly outperforms state-of-the-art methods in accuracy and robustness.

Aiming to extrapolate missing facts in the future timestamp, temporal knowledge graph (TKG) reasoning has significant practical value across various applications. Most existing methods mainly rely on direct historical interactions to extract the temporal features of entities and have achieved promising performance in some specific scenes. However, these methods are constrained when it comes to predicting emerging events that lack such direct historical interaction information. To address this limitation, we propose a novel approach called the Homogeneous Entity Context Enhanced Representation Network (HECERN). Homogeneous entities are defined as entities with similar behavior patterns. HECERN takes advantage of the complex interaction connections among the relations of homogeneous entities, which contain rich and relevant context information for accurate prediction of emerging events. Specifically, we generate corresponding entity context subgraph for each history subgraph and extract dependencies for homogeneous entities and neighboring entities based on these two subgraphs, respectively. In addition, we introduce an attention-guided fusion mechanism that dynamically integrates information from neighbor-level dependencies and homogeneous-level dependencies to effectively generate the final entity representation. The effectiveness of HECERN is demonstrated through comprehensive experiments on three publicly available event-based TKG datasets. The results clearly indicate that our proposed approach significantly outperforms state-of-the-art methods in accurately predicting future events. (The source code is available at https://anonymous.4open.science/r/HECERN-2C6B.)

Structured text with plentiful hierarchical structure information is an important part in real-world complex texts. Structured text classification is attracting more attention in natural language processing due to the increasing complexity of application scenarios. Most existing methods treat structured text from a local hierarchy perspective, focusing on the semantics dependency and the graph structure of the structured text independently. However, structured text has global hierarchical structures with sophisticated dependency when compared to unstructured text. According to the variety of structured texts, it is not appropriate to use the existing methods directly. The function of distinction information within semantics dependency and graph structure for structured text, referred to as meta-information, should be stated more precisely. In this article, we propose HGMETA, a novel meta-information embedding frame network for structured text classification, to obtain the fusion embedding of hierarchical semantics dependency and graph structure in a structured text, and to distill the meta-information from fusion characteristics. To integrate the global hierarchical features with fused structured text information, we design a hierarchical LDA module and a structured text embedding module. Specially, we employ a multi-hop message passing mechanism to explicitly incorporate complex dependency into a meta-graph. The meta-information is constructed from meta-graph via neighborhood-based propagation to distill redundant information. Furthermore, using an attention-based network, we investigate the complementarity of semantics dependency and graph structure based on global hierarchical characteristics and meta-information. Finally, the fusion embedding and the meta-information can be straightforwardly incorporated for structured text classification. Experiments conducted on three real-world datasets show the effectiveness of meta-information and demonstrate the superiority of our method.

Network Representation Learning (NRL), which aims to embed nodes into a latent, low-dimensional vector space while preserving some network properties, facilitates the network analysis tasks. The goal of most NRL methods is to make similar nodes represented similarly in the embedding space. Many methods adopt the skip-gram model to achieve such goal by maximizing the predictive probability among the context nodes for each center node. The context nodes are usually determined based on the concept of \textit{proximity} which is defined based on some explicit network features. However, these proximities may result in a loss of training samples and have limited discriminative power. We propose a general and unified generative adversarial learning framework to address the problems. The proposed framework can handle almost all kinds of networks in a unified way, including homogeneous plain networks, attribute augmented networks and heterogeneous networks. It can improve the performances of the most of the state-of-the-art skip-gram based NRL methods. Moreover, another unified and general NRL method is extended from the framework. It can learn the network representation independently. Extensive experiments on proximity preserving evaluation and two network analysis tasks, i.e., link prediction and node classifications, demonstrate the superiority and versatility of our framework.

Modern learnable collaborative filtering recommendation models generate user and item representations by deep learning methods (e.g. graph neural networks) for modeling user-item interactions. However, most of them may still have unsatisfied performances due to two issues. Firstly, some models assume that the representations of users or items are fixed when modeling interactions with different objects. However, a user may have different interests in different items, and an item may also have different attractions to different users. Thus the representations of users and items should depend on their contexts to some extent. Secondly, existing models learn representations for user and item by symmetrical dual methods which have identical or similar operations. Symmetrical methods may fail to sufficiently and reasonably extract the features of user and item as their interaction data have diverse semantic properties. To address the above issues, a novel model called Asymmetrical context-awaRe modulation for collaBorative filtering REcommendation (ARBRE) is proposed. It adopts simplified GNNs on collaborative graphs to capture homogeneous user preferences and item attributes, then designs two asymmetrical context-aware modulation models to learn dynamic user interests and item attractions, respectively. The learned representations from user domain and item domain are input pair-wisely into 4 Multi-Layer Perceptrons in different combinations to model user-item interactions. Experimental results on three real-world datasets demonstrate the superiority of ARBRE over various state-of-the-arts.

Clustering is the basis of many complex network analysis and application tasks. Preserving the clustering properties in network representation space contributes to a better clustering performance. In this paper, an Attribute Network Embedding method based on Joint Clustering of representation and network (ANEJC) is proposed. Based on variational graph auto-encoder, ANEJC jointly reconstructs adjacency matrix and attribute matrix. In order to preserve the clustering property of the network, ANEJC clusters network structure and hidden layer representations of variational graph auto-encoder, simultaneously. Extensive experiments carried out on four synthetic datasets and three real-world datasets demonstrate a superior clustering performance of ANEJC over the state-of-art methods.

Despite its success in learning network node representations, network embedding is still relatively new for multiplex networks (MNs) with multiple types of edges. In such networks, the inter-layer anchor links are usually missing, which represent the alignment relations between nodes on different layers and are a crucial prerequisite for many cross-network applications like network alignment. For mining such anchor links between layers for MNs, multiplex network embedding (MNE) has become one of the most promising techniques. In this paper, we consider two problems for MNs: 1) edges can be missing to different extent, and data augmentation may mitigate this issue; 2) the known alignment anchor links between layers can be misleading since the behaviors of nodes on different layers are not always consistent, so the most informative ones should be emphasized compared with those misleading ones. However, most existing works neglect the two problems and simply 1) adopt one structural view for all the layers (e.g. random walk with the same window size) and 2) equally extract information from all the anchor links. We propose an end-to-end contrastive framework called cM2NE for MNE, utilizing multiple structural views for each layer and learning with several plug-in components for different scenarios. Through end-to-end optimization on three levels, the intra-view, inter-view, and inter-layer level, our framework achieves to select the fitted views for different layers and maximize the inter-layer mutual information by emphasizing those most informative anchor links. Extensive experimental results on real-world datasets for node classification and multi-network alignment show that our approach consistently outperforms peer methods.

Most of overlapping community detection algorithms cannot be applied to networks with highly overlapping community such as online social networks where individuals belong to many communities. One important reason is that many algorithms detect communities based on the explicit borders where nodes have more connections inside the communities, however, when the vertices' membership number gets large, the explicit borders between communities will fade away. To overcome this disadvantage, a new algorithm named MCNLPA is proposed by expanding the traditional Label Propagation Algorithm (LPA) based on the Maximal Clique Network for highly overlapping community detection. By finding all maximal cliques in networks and defining reasonable edges between them, the maximal clique network is established. Then the updated rule of classic LPA is modified to apply to the maximal network. Experiments show that MCNLPA has a relatively good performance in highly overlapping community detection and overlapping nodes identification.