Auxiliary Graph for Attribute Graph Clustering.

Entropy (Basel)

School of Computer, National University of Defense Technology, Changsha 410000, China.

Published: October 2022

Attribute graph clustering algorithms that include topological structural information into node characteristics for building robust representations have proven to have promising efficacy in a variety of applications. However, the presented topological structure emphasizes local links between linked nodes but fails to convey relationships between nodes that are not directly linked, limiting the potential for future clustering performance improvement. To solve this issue, we offer the Auxiliary Graph for Attribute Graph Clustering technique (AGAGC). Specifically, we construct an additional graph as a supervisor based on the node attribute. The additional graph can serve as an auxiliary supervisor that aids the present one. To generate a trustworthy auxiliary graph, we offer a noise-filtering approach. Under the supervision of both the pre-defined graph and an auxiliary graph, a more effective clustering model is trained. Additionally, the embeddings of multiple layers are merged to improve the discriminative power of representations. We offer a clustering module for a self-supervisor to make the learned representation more clustering-aware. Finally, our model is trained using a triplet loss. Experiments are done on four available benchmark datasets, and the findings demonstrate that the proposed model outperforms or is comparable to state-of-the-art graph clustering models.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC9602437PMC
http://dx.doi.org/10.3390/e24101409DOI Listing

Publication Analysis

Top Keywords

auxiliary graph
16
graph clustering
16
attribute graph
12
graph
10
graph attribute
8
additional graph
8
model trained
8
clustering
7
auxiliary
5
attribute
4

Similar Publications

Re-locative guided search optimized self-sparse attention enabled deep learning decoder for quantum error correction.

Sci Rep

January 2025

Department of Mathematics, School of Advanced Sciences, VIT-AP University, Besides AP Secretariate, Amaravati, Andhra Pradesh, 522237, India.

Heavy hexagonal coding is a type of quantum error-correcting coding in which the edges and vertices of a low-degree graph are assigned auxiliary and physical qubits. While many topological code decoders have been presented, it is still difficult to construct the optimal decoder due to leakage errors and qubit collision. Therefore, this research proposes a Re-locative Guided Search optimized self-sparse attention-enabled convolutional Neural Network with Long Short-Term Memory (RlGS2-DCNTM) for performing effective error correction in quantum codes.

View Article and Find Full Text PDF

Few-Shot Graph Anomaly Detection via Dual-Level Knowledge Distillation.

Entropy (Basel)

January 2025

National Key Laboratory of Fundamental Science on Synthetic Vision, Sichuan University, Chengdu 610065, China.

Graph anomaly detection is crucial in many high-impact applications across diverse fields. In anomaly detection tasks, collecting plenty of annotated data tends to be costly and laborious. As a result, few-shot learning has been explored to address the issue by requiring only a few labeled samples to achieve good performance.

View Article and Find Full Text PDF

Cryo-electron tomography (cryo-ET) is confronted with the intricate task of unveiling novel structures. General class discovery (GCD) seeks to identify new classes by learning a model that can pseudo-label unannotated (novel) instances solely using supervision from labeled (base) classes. While 2D GCD for image data has made strides, its 3D counterpart remains unexplored.

View Article and Find Full Text PDF

User preference interaction fusion and swap attention graph neural network for recommender system.

Neural Netw

January 2025

School of Computer and Control Engineering, Yantai University, YanTai, 264005, China. Electronic address:

Recommender systems are widely used in various applications. Knowledge graphs are increasingly used to improve recommendation performance by extracting valuable information from user-item interactions. However, current methods do not effectively use fine-grained information within the knowledge graph.

View Article and Find Full Text PDF

We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes of the network are target nodes, and we focus on the statistics of first hitting of these nodes.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!