6 research outputs found

    Hard Sample Aware Network for Contrastive Deep Graph Clustering

    Full text link
    Contrastive deep graph clustering, which aims to divide nodes into disjoint groups via contrastive mechanisms, is a challenging research spot. Among the recent works, hard sample mining-based algorithms have achieved great attention for their promising performance. However, we find that the existing hard sample mining methods have two problems as follows. 1) In the hardness measurement, the important structural information is overlooked for similarity calculation, degrading the representativeness of the selected hard negative samples. 2) Previous works merely focus on the hard negative sample pairs while neglecting the hard positive sample pairs. Nevertheless, samples within the same cluster but with low similarity should also be carefully learned. To solve the problems, we propose a novel contrastive deep graph clustering method dubbed Hard Sample Aware Network (HSAN) by introducing a comprehensive similarity measure criterion and a general dynamic sample weighing strategy. Concretely, in our algorithm, the similarities between samples are calculated by considering both the attribute embeddings and the structure embeddings, better revealing sample relationships and assisting hardness measurement. 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. In this way, our method can mine not only the hard negative samples but also the hard positive sample, thus improving the discriminative capability of the samples further. Extensive experiments and analyses demonstrate the superiority and effectiveness of our proposed method.Comment: 9 pages, 6 figure

    Graph Anomaly Detection via Multi-Scale Contrastive Learning Networks with Augmented View

    No full text
    Graph anomaly detection (GAD) is a vital task in graph-based machine learning and has been widely applied in many real-world applications. The primary goal of GAD is to capture anomalous nodes from graph datasets, which evidently deviate from the majority of nodes. Recent methods have paid attention to various scales of contrastive strategies for GAD, i.e., node-subgraph and node-node contrasts. However, they neglect the subgraph-subgraph comparison information which the normal and abnormal subgraph pairs behave differently in terms of embeddings and structures in GAD, resulting in sub-optimal task performance. In this paper, we fulfill the above idea in the proposed multi-view multi-scale contrastive learning framework with subgraph-subgraph contrast for the first practice. To be specific, we regard the original input graph as the first view and generate the second view by graph augmentation with edge modifications. With the guidance of maximizing the similarity of the subgraph pairs, the proposed subgraph-subgraph contrast contributes to more robust subgraph embeddings despite of the structure variation. Moreover, the introduced subgraph-subgraph contrast cooperates well with the widely-adopted node-subgraph and node-node contrastive counterparts for mutual GAD performance promotions. Besides, we also conduct sufficient experiments to investigate the impact of different graph augmentation approaches on detection performance. The comprehensive experimental results well demonstrate the superiority of our method compared with the state-of-the-art approaches and the effectiveness of the multi-view subgraph pair contrastive strategy for the GAD task. The source code is released at https://github.com/FelixDJC/GRADATE

    Integrating genome-wide DNA methylation and mRNA expression profiles identified different molecular features between Kashin-Beck disease and primary osteoarthritis

    No full text
    Abstract Background Kashin-Beck disease (KBD) is an endemic osteochondropathy of unknown etiology. Osteoarthritis (OA) is a form of degenerative joint disease sharing similar clinical manifestations and pathological changes to articular cartilage with KBD. Methods A genome-wide DNA methylation profile of articular cartilage from five KBD patients and five OA patients was first performed using the Illumina Infinium HumanMethylation450 BeadChip. Together with a previous gene expression profiling dataset comparing KBD cartilage with OA cartilage, an integrative pathway enrichment analysis of the genome-wide DNA methylation and the mRNA expression profiles conducted in articular cartilage was performed by InCroMAP software. Results We identified 241 common genes altered in both the DNA methylation profile and the mRNA expression profile of articular cartilage of KBD versus OA, including CHST13 (NM_152889, fold-change = 0.5979, P methy = 0.0430), TGFBR1 (NM_004612, fold-change = 2.077, P methy = 0.0430), TGFBR2 (NM_001024847, fold-change = 1.543, P methy = 0.037), TGFBR3 (NM_001276, fold-change = 0.4515, P methy = 6.04 × 10−4), and ADAM12 (NM_021641, fold-change = 1.9768, P methy = 0.0178). Integrative pathway enrichment analysis identified 19 significant KEGG pathways, including mTOR signaling (P = 0.0301), glycosaminoglycan biosynthesis-chondroitin sulfate/dermatan sulfate (P = 0.0391), glycosaminoglycan biosynthesis-keratan sulfate (P = 0.0278), and PI3K-Akt signaling (P = 0.0243). Conclusion This study identified different molecular features between Kashin-Beck disease and primary osteoarthritis and provided novel clues for clarifying the pathogenetic differences between KBD and OA
    corecore