Reliable Data Distillation on Graph Convolutional Network

In recent years, substantial progress has been made on Graph Convolutional Networks (GCNs). However, the computing of GCN usually requires a large memory space for keeping the entire graph. In consequence, GCN is not flexible enough, especially for large scale graphs in complex real-world applications. Fortunately, for transductive graph representation learning, methods based on Matrix Factorization (MF) naturally support constructing mini-batches, and thus are more friendly to distributed computing compared with GCN. Accordingly, in this paper, we analyze the connections between GCN and MF, and simplify GCN as matrix factorization with unitization and co-training. Furthermore, under the guidance of our analysis, we propose an alternative model to GCN named Unitized and Co-training Matrix Factorization (UCMF). Extensive experiments have been conducted on several real-world datasets. On the task of semi-supervised node classification, the experimental results illustrate that UCMF achieves similar or superior performances compared with GCN. Meanwhile, distributed UCMF significantly outperforms distributed GCN methods, which shows that UCMF can greatly benefit complex real-world applications.

This letter presents an adversarial knowledge distillation based on graph convolutional neural network. For knowledge distillation, many methods have been proposed in which the student model individually and independently imitates the output of the teacher model on the input data. Our method suggests the application of a similarity matrix to consider the relationship among output vectors, compared to the other existing approaches. The similarity matrix of the output vectors is calculated and converted into a graph structure, and a generative adversarial network using graph convolutional neural network is applied. We suggest similarity‐based knowledge distillation in which a student model simultaneously imitates both of output vector and similarity matrix of the teacher model. We evaluate our method on ResNet, MobileNet and Wide ResNet using CIFAR‐10 and CIFAR‐100 datasets, and our results outperform results of the baseline model and other existing knowledge distillations like KLD and DML.

Joint learning of feature and topology for multi-view graph convolutional network

Classification is a common task and can be achieved by learning a predictive model from a labeled training dataset. However, the imbalanced data distribution makes the model tend to favor the majority class, which reduces the classification performance. Unlike traditional classification models, graph convolutional networks (GCNs) can extract useful feature information from unlabeled data. In this paper, a novel framework for imbalanced classification named effective-aggregation graph convolutional network (EGCN) is proposed. First, a graph generator constructs graph-structured data using both labeled and unlabeled data. Then, an aggregation control unit (ACU) is performed to improve the effectiveness of aggregation. ACU uses local estimation density to limit the aggregation of inter-class edges from a local perspective, and it enhances the aggregation of the minority class from a global perspective based on the imbalance ratio. Finally, the prediction results are obtained by a graph convolutional network. Experimental results on several real-world datasets show that EGCN has promising performance.

Improving state-of-health estimation for lithium-ion batteries via unlabeled charging data

Drug repositioning framework using embedding drug-protein-disease similarities with graph convolution network and ensemble learning

Graph Convolutional Networks GCNs have shown great promise in semi-supervised node classification tasks. However, existing Graph Convolutional Networks GCNs face two key challenges: 1 While addressing the limitations of incomplete or noisy graph structures, the structural information of the graph remains underutilized 2 the scarcity of labeled data, limiting the ability to learn comprehensive embeddings. To address these issues, we propose a novel Multi-channel Fusion Graph Convolutional Networks with pseudo-label, which learn a connected embedding by fusing the multi-channel graphs information and node features. First, to explore the latent information within the original data, we design a graph generation module to extend and reconstruct the original data into multiple graphs. Meanwhile, a multi-channel approach is employed to embed and fuse these graphs, capturing the complementarity across different channels. Second, to address the issue of label sparsity, we design a confidence propagation-based information gain filtering module to generate high-quality pseudo-labels. Extensive experiments on three benchmark datasets demonstrate that our method outperforms other approaches.

A new ensemble deep graph reinforcement learning network for spatio-temporal traffic volume forecasting in a freeway network

In many real-world scenarios, labeled data for a specific machine learning task is costly to obtain. Semi-supervised training methods make use of abundantly available unlabeled data and a smaller number of labeled examples. We propose a new framework for semi-supervised training of deep neural networks inspired by learning in humans. Associations are made from embeddings of labeled samples to those of unlabeled ones and back. The optimization schedule encourages correct association cycles that end up at the same class from which the association was started and penalizes wrong associations ending at a different class. The implementation is easy to use and can be added to any existing end-to-end training setup. We demonstrate the capabilities of learning by association on several data sets and show that it can improve performance on classification tasks tremendously by making use of additionally available unlabeled data. In particular, for cases with few labeled data, our training scheme outperforms the current state of the art on SVHN.

Sample-weighted fused graph-based semi-supervised learning on multi-view data

Medical image annotations are prohibitively time-consuming and expensive to obtain. To alleviate annotation scarcity, many approaches have been developed to efficiently utilize extra information, e.g., semi-supervised learning further exploring plentiful unlabeled data, domain adaptation including multi-modality learning and unsupervised domain adaptation resorting to the prior knowledge from additional modality. In this paper, we aim to investigate the feasibility of simultaneously leveraging abundant unlabeled data and well-established cross-modality data for annotation-efficient medical image segmentation. To this end, we propose a novel semi-supervised domain adaptation approach, namely Dual-Teacher, where the student model not only learns from labeled target data (e.g., CT), but also explores unlabeled target data and labeled source data (e.g., MR) by two teacher models. Specifically, the student model learns the knowledge of unlabeled target data from intra-domain teacher by encouraging prediction consistency, as well as the shape priors embedded in labeled source data from inter-domain teacher via knowledge distillation. Consequently, the student model can effectively exploit the information from all three data resources and comprehensively integrate them to achieve improved performance. We conduct extensive experiments on MM-WHS 2017 dataset and demonstrate that our approach is able to concurrently utilize unlabeled data and cross-modality data with superior performance, outperforming semi-supervised learning and domain adaptation methods with a large margin.

The endpoint control of Basic Oxygen Furnace (BOF) steelmaking depends on the prediction of the endpoint carbon content and temperature. However, predicting these variables is challenging because of the numerous working conditions in the industrial field and the volatility of the sensor data collected during BOF steelmaking. The accuracy of prediction models in ensemble learning depends significantly on the initial distribution of data. However, the complex nature of BOF steelmaking data makes it challenging to generate diverse subsets, which ultimately affects the accuracy of predictions. This paper presents a new approach called Graph Convolutional Network Node Embedding Supervised Ensemble Clustering (GESupEC) for soft sensor modelling in ensemble learning to tackle these issues. GESupEC utilizes a similarity graph derived from a co-association matrix and employs graph convolutional networks to extract structural information among nodes. By optimising the clustering loss within the network, GESupEC learns compact node representations that are useful for the clustering task. Furthermore, it generates a reconstruction matrix based on the similarity of node embeddings. This matrix helps with the extraction of a suitable subset of data for BOF steelmaking through matrix decomposition. After that, the gradient boosting decision tree regression sub-model is established based on the data subset. An ensemble strategy called Gray Relational Analysis Weighted Average is proposed, which assigns weights based on the grey relation similarity between test samples and different data subsets. This weighted average strategy aims to enhance the accuracy of carbon content and temperature predictions. When tested with actual BOF steelmaking generation process data, the prediction accuracy of carbon content reached 88.6% within the error range of ±0.02%, and the prediction accuracy of temperature reached 92.6% within the error range of ±10 °C.

The performances of semisupervised clustering for unlabeled data are often superior to those of unsupervised learning, which indicates that semantic information attached to clusters can significantly improve feature representation capability. In a graph convolutional network (GCN), each node contains information about itself and its neighbors that is beneficial to common and unique features among samples. Combining these findings, we propose a deep clustering method based on GCN and semantic feature guidance (GFDC) in which a deep convolutional network is used as a feature generator, and a GCN with a softmax layer performs clustering assignment. First, the diversity and amount of input information are enhanced to generate highly useful representations for downstream tasks. Subsequently, the topological graph is constructed to express the spatial relationship of features. For a pair of datasets, feature correspondence constraints are used to regularize clustering loss, and clustering outputs are iteratively optimized. Three external evaluation indicators, i.e., clustering accuracy, normalized mutual information, and the adjusted Rand index, and an internal indicator, i.e., the Davidson-Bouldin index (DBI), are employed to evaluate clustering performances. Experimental results on eight public datasets show that the GFDC algorithm is significantly better than the majority of competitive clustering methods, i.e., its clustering accuracy is 20% higher than the best clustering method on the United States Postal Service dataset. The GFDC algorithm also has the highest accuracy on the smaller Amazon and Caltech datasets. Moreover, DBI indicates the dispersion of cluster distribution and compactness within the cluster.

Semi-supervised learning with a graph-based approach has gained prominence in machine learning, particularly in scenarios where labeling data involves substantial costs. Graph convolution networks (GCNs) have found widespread application in semi-supervised learning, predominantly on graph-structured data such as citation and social networks. However, a noticeable gap exists in the application of these methods to non-graph multi-view data, such as collections of images. In an effort to address this gap, we introduce two innovative deep semi-supervised multi-view classification models specifically tailored for non-graph data. Both models share a common architecture, leveraging GCNs and integrating a label smoothing constraint. The primary distinction lies in the construction of the consensus similarity graph. The first model directly reconstructs the consensus graph from different views using a specialized objective function designed for flexible graph-based semi-supervised classification. In contrast, the second model independently reconstructs individual graphs and subsequently adaptively merges them into a unified consensus graph. Our experiments encompass various multiple-view image datasets. The results consistently demonstrate the superior performance of our proposed approach compared to traditional fusion methods with GCNs. In this research, we present two approaches for tackling semi-supervised classification challenges involving multiple views. One method is named Semi-supervised Classification with a Unified Graph (SCUG), and the other is referred to as Semi-supervised Classification with a Fused Graph (SC-Fused). Both methods share a common semi-supervised classification process, utilizing the GCN framework and incorporating label smoothing. However, the key distinction lies in the construction of the similarity graph. Unlike traditional ad hoc graph construction approaches, our proposed methods, SCUG and SC-Fused, estimate the unified graph or individual graphs, respectively, alongside the labels. This results in more optimized graphs that benefit from data smoothing and the semi-supervised context.

Breast cancer remains one of the principal reasons of death among women worldwide, highlighting the critical requirement for primary and exact diagnosis to expand patient persistence rates. Manual clarification of histopathological slides is frequently subjective, time-consuming, and prone to inter-observer unpredictability. Recent developments in machine learning (ML) and deep learning (DL) techniques have renovated histopathological image analysis by qualifying automated, consistent, and reproducible diagnostic systems. This review analysis thoroughly observes research from 2018 to 2025, covering advanced methods for breast cancer detection based on histopathological images, with feature extraction, feature selection, and classification strategies, and medical image investigations. In this study compares existing ML methods, convolutional neural networks (CNN), vision transformers (ViT), graph convolutional networks (GCN), ensemble learning and hybrid frameworks across numerous standard and multiple benchmark datasets. Performance comparisons encompass filter-based, wrapper-based, hybrid, and ensemble learning models. In this study highlights the benefits of AI-driven diagnostic systems such as enhanced accuracy, scalability, and consistency, while addressing key challenges including data discrepancy, inadequate interpretability, and high computational cost. This comparative review highlights publicly accessible datasets, standard architectures, and emerging techniques in explainable artificial intelligence, ViT, and federated learning. Finally, potential directions for future research are drawn to guide researchers, clinicians, and developers in the direction of proceeding intelligent systems for breast cancer histopathological diagnosis.