Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nan Wang 0009

dblp:84/864-9 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
3since 2021 · last 2025
0000-0003-0321-789XORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 2 first-author · 1 since 2021Software engineering, systems software and programming languages · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 first-authorComputer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 33% Trustworthy machine learning · 33% Representation and self-supervised learning · 33%
Computer networks
1 paper
Edge and fog computing · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning
causal representation learning
0.912025
Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Graph learning › graph neural network
heterogeneous graph neural network
0.912025
Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs · IEEE Trans. Knowl. Data Eng. 2025
Machine learning › Trustworthy machine learning
out-of-distribution generalization
0.912025
Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs · IEEE Trans. Knowl. Data Eng. 2025
Cloud and datacenter computing › edge and fog computing
fog computing
0.112020
ENORM: A Framework For Edge NOde Resource Management · IEEE Trans. Serv. Comput. 2020

Methods — techniques the papers use, named apart from their topics

variational autoencoder · 0.9meta-learning · 0.9causal invariance · 0.9
YearPublicationVenuePosition
2025 Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs
abstract
To address the issue of label sparsity in heterogeneous graphs (HGs), heterogeneous graph few-shot learning (HGFL) has recently emerged. HGFL aims to extract meta-knowledge from source HGs with rich-labeled data and transfers it to a target HG, facilitating learning new classes with few-labeled training data and improving predictions on unlabeled testing data. Existing methods typically assume the same distribution across the source HG, training data, and testing data. However, in practice, distribution shifts in HGFL are inevitable due to (1) the scarcity of source HGs that match the target HG's distribution, and (2) the unpredictable data generation mechanism of the target HG. Such distribution shifts can degrade the performance of existing methods, leading to a novel problem of out-of-distribution (OOD) generalization in HGFL. To address this challenging problem, we propose COHF, aCausalOODHeterogeneous graphFew-shot learning model. In COHF, we first adopt a bottom-up data generative perspective to identify the invariance principle for OOD generalization. Then, based on this principle, we design a novel variational autoencoder-based heterogeneous graph neural network (VAE-HGNN) to mitigate the impact of distribution shifts. Finally, we propose a novel meta-learning framework that incorporates VAE-HGNN to effectively transfer meta-knowledge in OOD environments. Extensive experiments on seven real-world datasets have demonstrated the superior performance of COHF over the state-of-the-art methods.
Pengfei Ding 0001, Yan Wang 0002, Guanfeng Liu 0001, Nan Wang 0009, Xiaofang Zhou 0001
IEEE Trans. Knowl. Data Eng.4
2022 Context-aware distribution of fog applications using deep reinforcement learning
abstract
Fog computing is an emerging paradigm that aims to meet the increasing computation demands arising from the billions of devices connected to the Internet. Offloading services of an application from the Cloud to the edge of the network can improve the overall latency of the application since it can process data closer to user devices. Diverse Fog nodes ranging from Wi-Fi routers to mini-clouds with varying resource capabilities makes it challenging to determine which services of an application need to be offloaded. In this paper, a context-aware mechanism for distributing applications across the Cloud and the Fog is proposed. The mechanism dynamically generates (re)deployment plans for the application to maximise the performance efficiency of the application by taking operational conditions, such as hardware utilisation and network state, and running costs into account. The mechanism relies on deep Q-networks to generate a distribution plan without prior knowledge of the available resources on the Fog node, the network condition, and the application. The feasibility of the proposed context-aware distribution mechanism is demonstrated on two use-cases, namely a face detection application and a location-based mobile game. The benefits are increased utility of dynamic distribution by 50% and 20% for the two use-cases respectively when compared to a static distribution approach used in existing research.
Nan Wang 0009, Blesson Varghese
J. Netw. Comput. Appl.1
2022 Exploiting intra- and inter-session dependencies for session-based recommendations
Nan Wang 0009, Shoujin Wang, Yan Wang 0002, Quan Z. Sheng, Mehmet A. Orgun
World Wide Web1
2020 Priority-based Fair Scheduling in Edge Computing
abstract
Scheduling is important in Edge computing. In contrast to the Cloud, Edge resources are hardware limited and cannot support workload-driven infrastructure scaling. Hence, resource allocation and scheduling for the Edge requires a fresh perspective. Existing Edge scheduling research assumes availability of all needed resources whenever a job request is made. This paper challenges that assumption, since not all job requests from a Cloud server can be scheduled on an Edge node. Thus, guaranteeing fairness among the clients (Cloud servers offloading jobs) while accounting for priorities of the jobs becomes a critical task. This paper presents four scheduling techniques, the first is a naive first come first serve strategy and further proposes three strategies, namely a client fair, priority fair, and hybrid that accounts for the fairness of both clients and job priorities. An evaluation on a target platform under three different scenarios, namely equal, random, and Gaussian job distributions is presented. The experimental studies highlight the low overheads and the distribution of scheduled jobs on the Edge node when compared to the naive strategy. The results confirm the superior performance of the hybrid strategy and showcase the feasibility of fair schedulers for Edge computing.
Arkadiusz Madej, Nan Wang 0009, Nikolaos Athanasopoulos, Rajiv Ranjan 0001, Blesson Varghese
ICFEC2
2020 Modelling Local and Global Dependencies for Next-Item Recommendations
Nan Wang 0009, Shoujin Wang, Yan Wang 0002, Quan Z. Sheng, Mehmet A. Orgun
WISE (2)1
2020 DYVERSE: DYnamic VERtical Scaling in multi-tenant Edge environments
Nan Wang 0009, Michail Matthaiou, Dimitrios S. Nikolopoulos, Blesson Varghese
Future Gener. Comput. Syst.1
2020 ENORM: A Framework For Edge NOde Resource Management
abstract
Current computing techniques using the cloud as a centralised server will become untenable as billions of devices get connected to the Internet. This raises the need for fog computing, which leverages computing at the edge of the network on nodes, such as routers, base stations and switches, along with the cloud. However, to realise fog computing the challenge of managing edge nodes will need to be addressed. This paper is motivated to address the resource management challenge. We develop the first framework to manage edge nodes, namely the Edge NOde Resource Management (ENORM) framework. Mechanisms for provisioning and auto-scaling edge node resources are proposed. The feasibility of the framework is demonstrated on a PokéMon Go-like online game use-case. The benefits of using ENORM are observed by reduced application latency between 20-80 percent and reduced data transfer and communication frequency between the edge node and the cloud by up to 95 percent. These results highlight the potential of fog computing for improving the quality of service and experience.
Nan Wang 0009, Blesson Varghese, Michail Matthaiou, Dimitrios S. Nikolopoulos
IEEE Trans. Serv. Comput.1
2016 A machine learning analysis of Twitter sentiment to the Sandy Hook shootings
abstract
Gun related violence is a complex issue and accounts for a large proportion of violent incidents. In the research reported in this paper, we set out to investigate the pro-gun and anti-gun sentiments expressed on a social media platform, namely Twitter, in response to the 2012 Sandy Hook Elementary School shooting in Connecticut, USA. Machine learning techniques are applied to classify a data corpus of over 700,000 tweets. The sentiments are captured using a public sentiment score that considers the volume of tweets as well as population. A web-based interactive tool is developed to visualise the sentiments and is available at http://www.gunsontwitter.com. The key findings from this research are: (i) There are elevated rates of both pro-gun and anti-gun sentiments on the day of the shooting. Surprisingly, the pro-gun sentiment remains high for a number of days following the event but the anti-gun sentiment quickly falls to pre-event levels. (ii) There is a different public response from each state, with the highest pro-gun sentiment not coming from those with highest gun ownership levels but rather from California, Texas and New York.
Nan Wang 0009, Blesson Varghese, Peter D. Donnelly
eScience1