Document-level Event Argument Extraction (DEAE) aims to identify arguments and their specific roles from an unstructured document. The advanced approaches on DEAE utilize prompt-based methods to guide pre-trained lang...
详细信息
A bilevel optimization problem consists of an upper-level and a lower-level optimization problem connected to each other hierarchically. Efficient methods exist for special cases, but in general solving these problems...
详细信息
Agriculture stands as a linchpin for national prosperity, especially in regions blessed with abundant water and fertile soil, capable of yielding a diverse range of food products crucial for human sustenance. However,...
详细信息
In the process of drawing architectural drawings with AutoCAD software, enterprises will produce a large number of CAD drawings in DWG format. The tables of these CAD drawings contain rich textual information. These t...
详细信息
The past few years have witnessed the immense development of small object detection, which is aimed at detecting size-limited targets in high-resolution images. The prevailing methods focus on extracting fine-grained ...
详细信息
In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising ...
详细信息
In this paper, we study semi-supervised graph classification, which aims at accurately predicting the categories of graphs in scenarios with limited labeled graphs and abundant unlabeled graphs. Despite the promising capability of graph neural networks (GNNs), they typically require a large number of costly labeled graphs, while a wealth of unlabeled graphs fail to be effectively utilized. Moreover, GNNs are inherently limited to encoding local neighborhood information using message-passing mechanisms, thus lacking the ability to model higher-order dependencies among nodes. To tackle these challenges, we propose a Hypergraph-Enhanced DuAL framework named HEAL for semi-supervised graph classification, which captures graph semantics from the perspective of the hypergraph and the line graph, respectively. Specifically, to better explore the higher-order relationships among nodes, we design a hypergraph structure learning to adaptively learn complex node dependencies beyond pairwise relations. Meanwhile, based on the learned hypergraph, we introduce a line graph to capture the interaction between hyperedges, thereby better mining the underlying semantic structures. Finally, we develop a relational consistency learning to facilitate knowledge transfer between the two branches and provide better mutual guidance. Extensive experiments on real-world graph datasets verify the effectiveness of the proposed method against existing state-of-the-art methods. Copyright 2024 by the author(s)
Predicting the best-quality of rice phenotypes is the priority among agricultural researchers to fulfill worldwide food security. Trend development of predictive models from statistics to machine learning is the subje...
详细信息
Open Government data (OGD) refers to the provision of data produced by the government to the general public, in a format that is readily readable and can be used by machines with ease. It can also promote transparency...
详细信息
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution,...
详细信息
Cross-network node classification aims to train a classifier for an unlabeled target network using a source network with rich labels. In applications, the degree of nodes mostly conforms to the long-tail distribution, i.e., most nodes in the network are tail nodes with sparse neighborhoods. The established methods focus on either the discrepancy cross network or the long tail in a single network. As for the cross-network node classification under long tail, the coexistence of sparsity of tail nodes and the discrepancy cross-network challenges existing methods for long tail or methods for the cross-network node classification. To this end, a multicomponent similarity graphs for cross-network node classification (MS-CNC) is proposed in this article. Specifically, in order to address the sparsity of the tail nodes, multiple component similarity graphs, including attribute and structure similarity graphs, are constructed for each network to enrich the neighborhoods of the tail nodes and alleviate the long-tail phenomenon. Then, multiple representations are learned from the multiple similarity graphs separately. Based on the multicomponent representations, a two-level adversarial model is designed to address the distribution difference across networks. One level is used to learn the invariant representations cross network in view of structure and attribute components separately, and the other level is used to learn the invariant representations in view of the fused structure and attribute graphs. Extensive experimental results show that the MS-CNC outperforms the state-of-the-art methods. Impact Statement-Node classification is an important task in graph mining. With the unavailability of labels, some researchers propose cross-network node classification, using one labeled network to assist the node classification of another unlabeled network. However, the long-tail of nodes leads to unsatisfactory performance and challenges the recent cross-network node classification m
A world model is essential for an agent to predict the future and plan in domains such as autonomous driving and robotics. To achieve this, recent advancements have focused on video generation, which has gained signif...
详细信息
暂无评论