Theories and Applications on Data Mining in Graph Neural Networks

A special issue of Big Data and Cognitive Computing (ISSN 2504-2289). This special issue belongs to the section "Data Mining and Machine Learning".

Deadline for manuscript submissions: 21 April 2027 | Viewed by 421

Editors


E-Mail Website
Guest Editor
Kumoh National Institute of Technology, Daegu, Republic of Korea
Interests: geospatial AI (GeoAI); neural network optimization; edge AI; evolutionary AI; multi-objective optimization; federated learning; computer vision
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
DMC Mining Services, Laurentian University, Greater Sudbury, ON, Canada
Interests: evolutionary computation; multi-objective optimization; energy disaggregation; data mining; machine learning

Special Issue Information

Dear Colleagues,

Graph neural networks (GNNs) have emerged as a powerful paradigm for learning representations from graph-structured data, enabling breakthroughs across a wide range of domains including social network analysis, molecular property prediction, recommendation systems, natural language processing and computer vision. The intersection of data mining with GNNs offers transformative opportunities to extract meaningful patterns, relationships and knowledge from complex, interconnected datasets that traditional approaches cannot adequately capture.

This Special Issue aims to bring together cutting-edge theoretical advances and practical applications at the confluence of data mining and graph neural networks. We invite original research articles, comprehensive reviews and case studies that address fundamental challenges such as the scalability of GNN-based mining algorithms, the interpretability of learned graph representations, the robustness and generalization of GNN models and novel architectures tailored for specific data mining tasks.

By consolidating recent advances and fostering dialogue between theorists and practitioners, this Special Issue seeks to advance the state of the art and identify promising future research directions in GNN-based data mining. This Special Issue welcomes submissions on, but not limited to, the following topics:

  • Novel GNN architectures for graph-based data mining tasks
  • Scalable graph neural network algorithms for large-scale data
  • Graph-based anomaly and fraud detection
  • Knowledge graph construction, completion and reasoning with GNNs
  • Dynamic and temporal graph mining using neural approaches
  • Heterogeneous graph learning and multi-relational data mining
  • Explainability and interpretability of GNN-based data mining models
  • GNN-driven recommendation systems and link prediction
  • Graph representation learning for molecular and biological data
  • Applications of GNNs in social network analysis and community detection
  • Transfer learning and domain adaptation in graph neural networks
  • Benchmark datasets and evaluation methodologies for GNN-based mining

We look forward to receiving your contributions. 

Dr. Vikas Palakonda
Dr. Samira Ghorbanpour
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 250 words) can be sent to the Editorial Office for assessment.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-anonymized peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Big Data and Cognitive Computing is an international peer-reviewed open access monthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 1800 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • graph neural networks
  • data mining
  • graph representation learning
  • knowledge graphs
  • anomaly detection
  • dynamic graph learning
  • heterogeneous graphs
  • scalable graph algorithms
  • graph-based recommendation systems
  • explainable GNNs

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

26 pages, 1796 KB  
Article
SETTA: Parameter-Free Test-Time Adaptation for Graph Neural Networks via Spectral-Energy-Guided Semantic Refinement
by Dongyang Yu, Xia Cui and Rong Xiao
Big Data Cogn. Comput. 2026, 10(8), 260; https://doi.org/10.3390/bdcc10080260 - 4 Aug 2026
Abstract
Node classification is a central graph data mining task, yet repeated message passing can over-smooth representations and degrade frozen graph neural network (GNN) predictions after deployment. We present SETTA (Spectral-Energy Test-Time Adaptation), a prediction-level graph test-time adaptation framework that refines frozen outputs without [...] Read more.
Node classification is a central graph data mining task, yet repeated message passing can over-smooth representations and degrade frozen graph neural network (GNN) predictions after deployment. We present SETTA (Spectral-Energy Test-Time Adaptation), a prediction-level graph test-time adaptation framework that refines frozen outputs without test labels, gradients, parameter updates, or learnable adaptation parameters. SETTA denoises features for semantic-neighbor construction, adds complementary semantic routes while preserving observed edges, monitors a smoothness-energy proxy during diffusion, and accepts refinements through entropy-based gating. Configurations are fixed by a dataset-level protocol or selected using validation data only. Across six mostly homophilic benchmarks with 2708–19,717 nodes, SETTA improved a frozen two-layer GCN on every dataset and achieved the highest mean accuracy among the evaluated methods on five, with gains of 4.61, 3.08, and 2.01 percentage points on Cora, CiteSeer, and PubMed, respectively. Positive mean gains were also observed across all 30 dataset–backbone settings. Ablations and transition analyses indicate that semantic injection is most beneficial on sparse citation graphs and that selective refinement limits harmful changes. The current dense implementation supports benchmark-scale, amortized refinement; scalability and robustness on heterophilic graphs remain open. Full article
(This article belongs to the Special Issue Theories and Applications on Data Mining in Graph Neural Networks)
Show Figures

Figure 1

Back to TopTop