- Article
Mean-field games (MFGs) are developed to model the decision-making processes of a large number of interacting agents in multi-agent systems. This paper studies mean-field games on graphs (
Mean-field games (MFGs) are developed to model the decision-making processes of a large number of interacting agents in multi-agent systems. This paper studies mean-field games on graphs (
Anti-money laundering (AML) in cryptocurrency networks presents significant challenges due to complex transactional relationships, severe class imbalance, and limited labeled data, which severely constrain the scalability and label efficiency of exis...
Task allocation plays an important role in multi-robot systems regarding team efficiency. Conventional heuristic or meta-heuristic methods face difficulties in generating satisfactory solutions in a reasonable computational time, particularly for lar...
Most previous studies on multi-agent systems aim to coordinate agents to achieve a common goal, but the lack of scalability and transferability prevents them from being applied to large-scale multi-agent tasks. To deal with these limitations, we prop...
The alternating current (AC) optimal power flow (AC-OPF) problem is crucial for efficient power system operation, yet it remains challenging due to its nonlinear, nonconvex structure and numerous operational constraints. This paper introduces a Physi...
The scalability of coordination policies is a critical challenge in swarm robotics, where agent numbers may vary substantially between deployment scenarios. Reinforcement learning (RL) offers a promising avenue for learning decentralized policies fro...
Node embedding refers to techniques that generate low-dimensional vector representations of nodes in a graph while preserving specific node properties and is widely used in applied domains such as fraud detection and social network analysis. A key ch...
Recently, many models based on the combination of graph convolutional networks and deep learning have attracted extensive attention for their superior performance in graph clustering tasks. However, the existing models have the following limitations:...
Unmanned aerial vehicles (UAVs) are widely used in Internet-of-Things (IoT) networks, especially in remote areas where communication infrastructure is unavailable, due to flexibility and low cost. However, the joint optimization of locations of UAVs...
Multidimensional datapoint clouds representing large datasets are frequently characterized by non-trivial low-dimensional geometry and topology which can be recovered by unsupervised machine learning approaches, in particular, by principal graphs. Pr...
This study presents a comparative evaluation of Dijkstra’s algorithm, A*, Bellman-Ford, AI-Augmented A* and a neural AI-based model for shortest-path computation across diverse graph topologies, with a focus on time efficiency and memory consum...
Due to the explosive growth of graph data, attributed graph clustering has received increasing attention recently. Although deep neural networks based graph clustering methods have achieved impressive performance, the huge amount of training paramete...
As data-centric applications become increasingly complex, understanding effective query optimization in large-scale relational databases is crucial for managing this complexity. Yet, traditional cost-based and heuristic approaches simply do not scale...
Intelligent sensing networks generate heterogeneous application-level service requests from aggregated sensing measurements and events, raising critical requirements for data integrity, traceability, and trustworthy service interactions. Blockchain-e...
We propose SAT-GATv2, a graph neural network (GNN)-based model designed to solve the Boolean satisfiability problem (SAT) through graph-based deep learning techniques. SAT-GATv2 transforms SAT formulas into graph structures, leveraging message-passin...
Multi-agent systems often face challenges such as elevated communication demands, intricate interactions, and difficulties in transferability. To address the issues of complex information interaction and model scalability, we propose an innovative hi...
Anti-money laundering (AML) systems are important for protecting the global economy. However, conventional rule-based methods rely on domain knowledge, leading to suboptimal accuracy and a lack of scalability. Graph neural networks (GNNs) for digraph...
Attention Deficit Hyperactivity Disorder (ADHD) is a heterogeneous neurodevelopmental disorder whose diagnosis is mainly based on behavioral assessment and is often delayed due to clinical complexity and limited availability of specialists. Resting-s...
Graph representation learning is a significant challenge in graph signal processing (GSP). The flourishing development of graph neural networks (GNNs) provides effective representations for GSP. To effectively learn from graph signals, we propose a r...
Knowledge graphs are extensively utilized in diverse fields such as search engines, recommendation systems, and dialogue systems, and knowledge graph reasoning plays an important role in the aforementioned domains. Graph neural networks demonstrate t...
Multi-view clustering aims to discover consistent cluster structures from heterogeneous features without supervision. Anchor-based methods improve scalability by representing samples through a compact set of anchors, but fixed anchors may be misalign...
The rapid growth of maritime communication networks introduces significant challenges to routing optimization, arising from large-scale network topologies, highly dynamic node mobility, and stringent real-time communication requirements. Conventional...
Privacy-preserving data mining (PPDM) seeks to extract useful patterns from shared data without revealing sensitive information. Within PPDM, knowledge hiding—encompassing both association rule hiding (ARH) and frequent itemset hiding (FIH)&mda...
Knowledge graph embedding (KGE) models have become popular means for making discoveries in knowledge graphs (e.g., RDF graphs) in an efficient and scalable manner. The key to success of these models is their ability to learn low-rank vector represent...
The challenge of large-scale applications nowadays is that they must merge structured, semi-structured, and unstructured information of various sources. Machine learning auto-aligns schemas, matches entities, and fuses semantics, reducing manual effo...
The unsupervised attribute graph embedding technique aims to learn low-dimensional node embedding using neighborhood topology and attribute information under unlabeled data. Current unsupervised models are mostly based on graph self-encoders, but ful...
As scientific workflows grow more complex and green computing becomes a priority, efficient multi-objective scheduling is essential to optimize makespan, cost, and energy consumption for large task graphs. However, existing methods often suffer from...
Time-series classification (TSC) is an important task across sciences. Symbolic representations (especially SFA) are very effective at combating noise. In this paper, we employ symbolic representations to create state-of-the-art time-series classifie...
Anchor-based bipartite graph methods provide scalable solutions for multi-view clustering, but most of them construct graphs in the original feature space, where high dimensionality distorts the proximity between samples and anchors and degrades grap...
High-dimensional data often contain noise and undancy, which can significantly undermine the performance of machine learning. To address this challenge, we propose an advanced robust principal component analysis (RPCA) model that integrates bidirecti...
The volume of multimedia assets in collections is growing exponentially, and the retrieval of information is becoming more complex. The indexing and retrieval of multimedia content is generally implemented by employing feature graphs. Feature graphs...
Combinatorial optimization on temporal graphs is critical for summarizing dynamic networks in various fields, including transportation, social networks, and biology. Among these problems, the Minimum Timeline Cover (MinTCover) problem, aimed at ident...
The inherent complexity and heterogeneity of the Internet of Things (IoT) ecosystem present significant challenges for developing effective intrusion detection systems. While graph deep-learning-based methods have shown promise in cybersecurity appli...
Multi-view clustering (MVC) is a fundamental unsupervised learning task for exploring latent structures from heterogeneous multi-view data. Existing MVC methods face critical challenges including the high computational cost of full-graph tensor model...
Machine learning (ML) is a powerful tool in drug design, enabling the rapid analysis of large and complex molecular graphs that represent the structural and chemical properties of medications. It enhances the precision and speed with which molecular...
Accurate modeling of learners’ evolving cognitive states is essential for intelligent educational systems, yet many existing knowledge tracing and graph-based approaches rely on static structures or purely sequential representations that inadeq...
Link prediction is a fundamental problem in graphs. Currently, SubGraph Representation Learning (SGRL) methods provide state-of-the-art solutions for link prediction by transforming the task into a graph classification problem. However, existing SGRL...
Finding the maximum common induced subgraph is a fundamental problem in computer science. Proven to be NP-hard in the 1970s, it has, nowadays, countless applications that still motivate the search for efficient algorithms and practical heuristics. In...
This study proposes a novel framework using graph convolutional networks to analyze and interpret X-ray diffraction patterns, addressing challenges in phase identification for multi-phase materials. By representing X-ray diffraction patterns as graph...
Cross-Site Scripting (XSS) attacks are a common source of vulnerability for web applications, necessitating scalable mechanisms for detection. In this work, a new method based on bipartite graph-based feature extraction and an ensemble learning class...
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs....
Multi-view clustering (MVC) is crucial for exploiting complementary information from multi-view data. Anchor-based MVC methods are efficient for large-scale tasks but lack the ability to balance view-specific local complementarity and cross-view glob...
Graph neural networks (GNNs) are crucial tools for processing non-Euclidean data. However, due to scalability issues caused by the dependency and topology of graph data, deploying GNNs in practical applications is challenging. Some methods aim to add...
This paper presents a novel deep graph-based learning technique for speech emotion recognition which has been specifically tailored for energy efficient deployment within humanoid robots. Our methodology represents a fusion of scalable graph represen...
A networked system consists of a collection of interconnected autonomous agents that communicate and interact through a shared communication infrastructure. These agents collaborate to pursue common objectives or exhibit coordinated behaviors that wo...
In 1943, McCulloch and Pitts introduced a discrete recurrent neural network as a model for computation in brains. The work inspired breakthroughs such as the first computer design and the theory of finite automata. We focus on learning in Hopfield ne...
In the digital era, rapid urban growth and the demand for sustainable mobility are placing increasing pressure on transport systems, where congestion, energy consumption, and schedule variability complicate intermodal journey planning. This work prop...
In this paper, we explore the emerging role of graph neural networks (GNNs) in optimizing routing for next-generation communication networks. Traditional routing protocols, such as OSPF or the Dijkstra algorithm, often fall short in handling the comp...
Systems for graph processing are a key enabler for insights from large-scale graphs that are critical to many new advanced technologies such as Artificial Intelligence, Internet of Things, and blockchain. In this study, we benchmark another two widel...
With the proliferation of the Internet, network complexities for both commercial and state organizations have significantly increased, leading to more sophisticated and harder-to-detect network attacks. This evolution poses substantial challenges for...
of 6