applsci-logo

Journal Browser

Journal Browser

Graph-Based Methods in Artificial Intelligence and Machine Learning, 2nd Edition

A special issue of Applied Sciences (ISSN 2076-3417). This special issue belongs to the section "Computing and Artificial Intelligence".

Deadline for manuscript submissions: 20 July 2026 | Viewed by 31146

Special Issue Editors


E-Mail Website
Guest Editor
Institute of Applied Computers Science, Jagiellonian University, 30-348 Kraków, Poland
Interests: knowledge representation; CAD; machine learning; BIM; graph-based computing
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Institute of Applied Computers Science, Jagiellonian University, 30-348 Kraków, Poland
Interests: graph grammars; computer-aided graphic design; pattern recognition; diagrammatic reasoning; algorithm analysis
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

In recent years, graph structures have become an important issue in scientific research and have attracted significant attention in a range of domains. In addition, there is an increasing number of applications for the representation of data by means of well-structured and flexible graph models, mainly due to their ability to encode both topological and semantic information about artefacts. Data can be represented by graphs in many different domains, such as scene graph generation and understanding, object tracking, point cloud classification, proteinomic and genomic data representation, text classification, relationships between documents or words, natural language processing, traffic congestion models, anomalies in networks, buildings in civil engineering, ontologies in different domains, and scenes and action in computer game design. 

With these advances, graph structuers have become a new frontier in artificial intelligence and machine learning research. In many of the abovementioned domains, the adoption of graph neural network (GNN) models has been proven to be particularly effective, but other methods in AI and Ml have also been proven to be successful.

For this Special Issue, we invite the submission of papers dealing with both theoretical and applied research. The main subjects include, but are not limited to, the following:

  • Graph databases;
  • Graph-based versions of classic ML methods;
  • Graph neural networks (GNNs);
  • Advanced graph models;
  • Learning based on graphs;
  • Graph data management;
  • Graph mining;
  • Graph kernels;
  • Knowledge graphs;
  • Applications of graph models in engineering, computer vusion, graphics, architecture, arts, ecommerce, natural language processing (NLP), computer games, music, etc.

Prof. Dr. Barbara Strug
Prof. Dr. Grażyna Ślusarczyk
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-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Applied Sciences is an international peer-reviewed open access semimonthly 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 2400 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 representation
  • GNN
  • graph data mining
  • graph data management
  • graph databases
  • graph machine learning

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 (2 papers)

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

Research

46 pages, 3979 KB  
Article
GeoMIP: A Geometric-Topological and Dynamic Programming Framework for Enhanced Computational Tractability of Minimum Information Partition in Integrated Information Theory
by Jaime Díaz-Arancibia, Luz Enith Guerrero, Jeferson Arango-López, Luis Fernando Castillo and Ana Bustamante-Mora
Appl. Sci. 2026, 16(2), 809; https://doi.org/10.3390/app16020809 - 13 Jan 2026
Viewed by 204
Abstract
The computational tractability of Integrated Information Theory (IIT) is fundamentally constrained by the exponential cost of identifying the Minimum Information Partition (MIP), which is required to quantify integrated information (Φ). Existing approaches become impractical beyond ~15–20 variables, limiting IIT analyses on realistic neural [...] Read more.
The computational tractability of Integrated Information Theory (IIT) is fundamentally constrained by the exponential cost of identifying the Minimum Information Partition (MIP), which is required to quantify integrated information (Φ). Existing approaches become impractical beyond ~15–20 variables, limiting IIT analyses on realistic neural and complex systems. We introduce GeoMIP, a geometric–topological framework that recasts the MIP search as a graph-based optimization problem on the n-dimensional hypercube graph: discrete system states are modeled as graph vertices, and Hamming distance adjacency defines edges and shortest-path structures. Building on a tensor-decomposed representation of the transition probabilities, GeoMIP constructs a transition-cost (ground cost) structure by dynamic programming over graph neighborhoods and BFS-like exploration by Hamming levels, exploiting hypercube symmetries to reduce redundant evaluations. We validate GeoMIP against PyPhi, ensuring reliability of MIP identification and Φ computation. Across multiple implementations, GeoMIP achieves 165–326× speedups over PyPhi while maintaining 98–100% agreement in partition identification. Heuristic extensions further enable analyses up to ~25 variables, substantially expanding the practical IIT regime. Overall, by leveraging the hypercube’s explicit graph structure (vertices, edges, shortest paths, and automorphisms), GeoMIP turns an intractable combinatorial search into a scalable graph-based procedure for IIT partitioning. Full article
Show Figures

Figure 1

42 pages, 594 KB  
Article
Leveraging Network Analysis and NLP for Intelligent Data Mining of Taxonomies and Folksonomies of PornHub
by Jan Sawicki, Loizos Bitsikokos, Yulia Belinskaya, Maria Ganzha and Marcin Paprzycki
Appl. Sci. 2025, 15(17), 9250; https://doi.org/10.3390/app15179250 - 22 Aug 2025
Viewed by 30556
Abstract
This study explores graph-based methods to model and analyze the semantic interplay between editorial taxonomies and user-generated folksonomies on the PornHub platform, using a dataset of over 97,000 videos (2015–2024). We construct and examine a graph of user-assigned tags and platform-defined categories, applying [...] Read more.
This study explores graph-based methods to model and analyze the semantic interplay between editorial taxonomies and user-generated folksonomies on the PornHub platform, using a dataset of over 97,000 videos (2015–2024). We construct and examine a graph of user-assigned tags and platform-defined categories, applying the Leiden community detection algorithm to uncover latent semantic groupings. To enrich the graph structure, we embed textual metadata using state-of-the-art language models (Qwen3-Embedding-4B and all-MiniLM-L6-v2), enabling the integration of natural language processing within graph-based learning. Our analysis reveals that folksonomies partially align with taxonomies through synonymous structures but also diverge by capturing nuanced attributes such as body features and aesthetic styles. These asymmetries highlight how folksonomies introduce higher-resolution semantic layers absent from fixed-category systems. By fusing graph mining, NLP-driven embeddings, and network-based clustering, this work contributes a hybrid methodology for semantic knowledge extraction in large-scale, user-generated content. It offers implications for graph-based recommendation, content moderation, and metadata enrichment—demonstrating the utility of graph-centric AI techniques in real-world multimedia data settings. Full article
Show Figures

Figure 1

Back to TopTop