Search
Search Results
-
Near-optimal Steiner tree computation powered by node embeddings
Steiner minimum tree problem on a graph, i.e., finding a tree with the minimum weight that covers the set of terminal nodes, is a classical NP-hard...
-
Candidate-Aware Attention Enhanced Graph Neural Network for News Recommendation
Facing the daily explosive growth of the news quantity, personalized news recommendation for users becomes an increasingly challenging problem....
-
Critical Node Privacy Protection Based on Random Pruning of Critical Trees
With the popularity of social networks, the conflict between the heterogeneous social network data publishing and user privacy leakage is becoming...
-
Quantifying Node-Based Core Resilience
Core decomposition is an efficient building block for various graph analysis tasks such as dense subgraph discovery and identifying influential...
-
Central node identification via weighted kernel density estimation
The detection of central nodes in a network is a fundamental task in network science and graph data analysis. During the past decades, numerous...
-
BatchedGreedy: A batch processing approach for influence maximization with candidate constraint
Influence maximization (IM) aims to find k seed nodes from social network G to maximize the spread of influence under a given diffusion model....
-
Example Applications Beyond Node Classification
While our running example in this book was node classification, and also the benchmark datasets discussed above use mostly node classification as a...
-
Property graph representation learning for node classification
Graph representation learning (graph embedding) has led to breakthrough results in various machine learning graph-based applications such as node...
-
Seagull optimization algorithm for node localization in wireless sensor networks
Numerous applications of wireless sensor networks (WSNs) highly depend on the node location, such as maritime rescue, agriculture, and hazardous...
-
Meta Heuristic Technique with Reinforcement Learning for Node Deployment in Wireless Sensor Networks
Wireless Sensor Networks (WSNs) are vital in applications like environmental monitoring, smart homes, and battlefield surveillance. Comprising small...
-
Optimizing relay node placement and routing in WBANs using free search krill herd and harmony search algorithm
Wireless Body Area Network (WBAN) plays an important role in healthcare applications like in medical, non-medical and psychological sector for remote...
-
Efficient fog node placement using nature-inspired metaheuristic for IoT applications
Managing the explosion of data from the edge to the cloud requires intelligent supervision, such as fog node deployments, which is an essential task...
-
MPR Node Selection Improvement in OLSR Based on Binary Cuckoo Search
Unmanned aerial vehicle (UAV) relay is an appropriate choice for emergency communications because of its good mobility and flexibility of placement....
-
An optimized sensor node localization approach for wireless sensor networks using RSSI
This article offers an efficient isosceles layout model for node deployment, and a parameter-less Jaya algorithm is also proposed as a solution to...
-
Complex Network Community Discovery Algorithms Based on Node Similarity and Network Embeddings
This paper briefly analyzes the summary of network embedding and node similarity, emphasizes the discovery, and takes numerical simulation as the...
-
Hybridized Black Widow-Honey Badger Optimization: Swarm Intelligence Strategy for Node Localization Scheme in WSN
The evolutionary growth of Wireless Sensor Networks (WSN) exploits a wide range of applications. To deploy the WSN in a larger area, for sensing the...
-
C2N-ABDP: Cluster-to-Node Attention-Based Differentiable Pooling
Graph neural networks have achieved state-of-the-art performance in various graph based tasks, including classification and regression at both node...
-
A Practical Multi-candidate Voting Protocol on Quantum Blockchain Adapted for Various Tally Principles
Quantum secure voting aims to provide various approaches to performing electronic voting via quantum technologies, like entangled particles or...
-
Social network node influence maximization method combined with degree discount and local node optimization
For the problem of maximizing the influence of nodes in traditional social networks, it is impossible to select nodes and spread the scope of...
-
\(\textbf{k}\) NN-Embed: Locally Smoothed Embedding Mixtures for Multi-interest Candidate Retrieval
Candidate retrieval is the first stage in recommendation systems, where a light-weight system is used to retrieve potentially relevant items for an...