Search Results for author:
Found 21 papers, 9 papers with code
A Survey of Knowledge Graph Reasoning on Graph Types: Static, Dynamic, and Multimodal
According to the graph types, existing KGR models can be roughly divided into three categories, i. e., static models, temporal models, and multi-modal models.
Deep Graph Clustering via Dual Correlation Reduction
To address this issue, we propose a novel self-supervised deep graph clustering method termed Dual Correlation Reduction Network (DCRN) by reducing information correlation in a dual manner.
Hard Sample Aware Network for Contrastive Deep Graph Clustering
Moreover, under the guidance of the carefully collected high-confidence clustering information, our proposed weight modulating function will first recognize the positive and negative samples and then dynamically up-weight the hard sample pairs while down-weighting the easy ones.
Cluster-guided Contrastive Graph Clustering Network
Then, guided by the high-confidence clustering information, we carefully select and construct the positive samples from the same high-confidence cluster in two views.
Deep Fusion Clustering Network
Specifically, in our network, an interdependency learning-based Structure and Attribute Information Fusion (SAIF) module is proposed to explicitly merge the representations learned by an autoencoder and a graph autoencoder for consensus representation learning.
Highly-Efficient Incomplete Large-Scale Multi-View Clustering With Consensus Bipartite Graph
Multi-view clustering has received increasing attention due to its effectiveness in fusing complementary information without manual annotations.
Align then Fusion: Generalized Large-scale Multi-view Clustering with Anchor Matching Correspondences
Under multi-view scenarios, generating correct correspondences could be extremely difficult since anchors are not consistent in feature dimensions.
Deep Temporal Graph Clustering
To solve the problem, we propose a general framework for deep Temporal Graph Clustering called TGC, which introduces deep clustering techniques to suit the interaction sequence-based batch-processing pattern of temporal graphs.
TMac: Temporal Multi-Modal Graph Learning for Acoustic Event Classification
We observe that these audiovisual data naturally have temporal attributes, such as the time information for each frame in the video.
Context-Integrated and Feature-Refined Network for Lightweight Object Parsing
The core components of CIFReNet are the Long-skip Refinement Module (LRM) and the Multi-scale Context Integration Module (MCIM).
Deep Distribution-preserving Incomplete Clustering with Optimal Transport
Clustering is a fundamental task in the computer vision and machine learning community.
Multi-view Clustering with Deep Matrix Factorization and Global Graph Refinement
Multi-view clustering is an important yet challenging task in machine learning and data mining community.
Foreground Object Structure Transfer for Unsupervised Domain Adaptation
In practice, since the label of the target domain is not available, we use the clustering information of the source domain to assign pseudo labels to the target domain samples, and then according to the source domain data prior knowledge guides those positive features to maximum the inter-class distance between different classes and mimimum the intra-class distance.
Siamese Attribute-missing Graph Auto-encoder
First, we entangle the attribute embedding and structure embedding by introducing a siamese network structure to share the parameters learned by both processes, which allows the network training to benefit from more abundant and diverse information.
Improved Dual Correlation Reduction Network
Deep graph clustering, which aims to reveal the underlying graph structure and divide the nodes into different clusters without human annotations, is a fundamental yet challenging task.
Knowledge Graph Contrastive Learning Based on Relation-Symmetrical Structure
To this end, we propose a knowledge graph contrastive learning framework based on relation-symmetrical structure, KGE-SymCL, which mines symmetrical structure information in KGs to enhance the discriminative ability of KGE models.
Revisiting Initializing Then Refining: An Incomplete and Missing Graph Imputation Network
With the development of various applications, such as social networks and knowledge graphs, graph data has been ubiquitous in the real world.
Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment
To solve this issue, by extracting both temporal and structural information to learn more informative node representations, we propose a self-supervised method termed S2T for temporal graph learning.
GANN: Graph Alignment Neural Network for Semi-Supervised Learning
Graph neural networks (GNNs) have been widely investigated in the field of semi-supervised graph machine learning.
RARE: Robust Masked Graph Autoencoder
To address this issue, we propose a novel SGP method termed Robust mAsked gRaph autoEncoder (RARE) to improve the certainty in inferring masked data and the reliability of the self-supervision mechanism by further masking and reconstructing node samples in the high-order latent feature space.
Message Intercommunication for Inductive Relation Reasoning
However, the uni-directional message-passing mechanism hinders such models from exploiting hidden mutual relations between entities in directed graphs.
