Fang Dong

Fang Dong


Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
16 September 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
GCGuangming Cui
Guangming Cui
QHQiang He
Qiang He
XXXiaoyu Xia
Xiaoyu Xia
FCFeifei Chen
Feifei Chen
FDFang Dong
Fang Dong
YYYun Yang
Yun Yang
Mobile edge computing (MEC) raises a variety of new challenges for app vendors, including the Edge User Allocation (EUA) problem. EUA aims to allocate as many app users as possible in an MEC system to minimum edge servers in the system. In non-orthogonal multiple access (NOMA)-based MEC system, multiple app users can be allocated to the same subchannel on an edge server through transmit power allocation based on their intra-cell and inter-cell interference. However, allocating excessive app users to the same subchannel may result in severe interference and consequently impact app users’ data rates. In addition, in an MEC system, app users join and depart randomly, and thus need to be allocated in an online manner. Existing EUA approaches suffer from poor performance in dynamic real-world NOMA-based MEC systems because they allocate app users in an offline manner and do not consider the complication caused by NOMA. In this paper, we propose OL-EUA, an OnLine approach for solving dynamic EUA problems in NOMA-based MEC systems. Its performance is theoretically analyzed and experimentally evaluated on a public dataset.

30 April 2023
Verified
Conference Paper
Open access
YWYuchen Wang
Yuchen Wang
JZJinghui Zhang
Jinghui Zhang
ZHZhengjie Huang
Zhengjie Huang
WLWeibin Li
Weibin Li
SFShikun Feng
Shikun Feng
JLJunzhou Luo
Junzhou Luo
Node classification is a substantial problem in graph-based fraud detection. Many existing works adopt Graph Neural Networks (GNNs) to enhance fraud detectors. While promising, currently most GNN-based fraud detectors fail to generalize to the low homophily setting. Besides, label utilization has been proved to be significant factor for node classification problem. But we find they are less effective in fraud detection tasks due to the low homophily in graphs. In this work, we propose GAGA, a novel Group AGgregation enhanced TrAnsformer, to tackle the above challenges. Specifically, the group aggregation provides a portable method to cope with the low homophily issue. Such an aggregation explicitly integrates the label information to generate distinguishable neighborhood information. Along with group aggregation, an attempt towards end-to-end trainable group encoding is proposed which augments the original feature space with the class labels. Meanwhile, we devise two additional learnable encodings to recognize the structural and relational context. Then, we combine the group aggregation and the learnable encodings into a Transformer encoder to capture the semantic information. Experimental results clearly show that GAGA outperforms other competitive graph-based fraud detectors by up to 24.39% on two trending public datasets and a real-world industrial dataset from Baidu. Even more, the group aggregation is demonstrated to outperform other label utilization methods (e.g., C&S, BoT/UniMP) in the low homophily setting.

19 December 2023 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
SFShucun Fu
Shucun Fu
FDFang Dong
Fang Dong
DSDian Shen
Dian Shen
JZJinghui Zhang
Jinghui Zhang
ZHZhaowu Huang
Zhaowu Huang
QHQiang He
Qiang He
Federated edge learning (FEEL) is a promising collaborative paradigm, which employs edge devices (EDs) to train machine learning models for a federation. It opens countless opportunities to enable edge intelligence. The increasingly diversified demands for intelligent services are driving the deployment of various federations at the edge. Existing works on FEEL focus on a single federation and ignore inter-federation device competition and intra-device resource allocation, which hinders the applications of FEEL. To address this issue, this article first investigates the bottlenecks of executing multiple federations and builds a joint optimization model as a two-stage Stackelberg game involving device selection and resource allocation. To tackle the problem efficiently, we present a game-theoretical approach named D evice S election and R esource A llocation for M ultiple F ederations G ame (DSRAMF-G). First, following the arbitrary device selection of leaders (i.e., federations), the time cost minimization of followers (i.e., EDs) is modeled as a convex problem to obtain the optimal resource allocation. Then, based on followers' optimal responses, device selection is modeled as a congestion game. We prove the existence of the Nash equilibrium and propose a decentralized mechanism. Finally, extensive experiments show that DSRAMF-G significantly outperforms the state-of-the-art methods, achieving up to 5.9x training speedup and 2.8x resource-savings.

26 May 2017 in Sustainability
Verified
Journal Article
Open access
PDF file
GSGeng Sun
Geng Sun
TCTingru Cui
Tingru Cui
GBGhassan Beydoun
Ghassan Beydoun
SCShiping Chen
Shiping Chen
FDFang Dong
Fang Dong
Jun ShenJun Shen
Jun Shen
Micro Learning through open educational resources (OERs) is becoming increasingly popular. However, adaptive micro learning support remains inadequate by current OER platforms. To address this, our smart system, Micro Learning as a Service (MLaaS), aims to deliver personalized OER with micro learning to satisfy their real-time needs. In this paper, we focus on constructing a knowledge base to support the decision-making process of MLaaS. MLaas is built using a top-down approach. A conceptual graph-based ontology construction is first developed. An educational data mining and learning analytic strategy is then proposed for the data level. The learning resource adaptation still requires learners’ historical information. To compensate for the absence of this information initially (aka ‘cold start’), we set up a predictive ontology-based mechanism. As the first resource is delivered to the beginning of a learner’s learning journey, the micro OER recommendation is also optimized using a tailored heuristic.

1 October 2015 in Cluster Computing
Verified
Journal Article
Closed access
PDF file
RXRunqun Xiong
Runqun Xiong
JLJunzhou Luo
Junzhou Luo
FDFang Dong
Fang Dong

16 February 2024 in ACM Transactions on Sensor Networks
Verified
Journal Article
Open access
JZJinghui Zhang
Jinghui Zhang
JWJiawei Wang
Jiawei Wang
YLYaning Li
Yaning Li
FXFa Xin
Fa Xin
FDFang Dong
Fang Dong
ZWZhihua Wu
Zhihua Wu
Federated learning (FL) has been proposed as a privacy-preserving distributed learning paradigm, which differs from traditional distributed learning in two main aspects: the systems heterogeneity, meaning that clients participating in training have significant differences in systems performance including CPU frequency, dataset size, and transmission power, and the statistical heterogeneity, indicating that the data distribution among clients exhibits Non-Independent Identical Distribution. Therefore, the random selection of clients will significantly reduce the training efficiency of FL. In this article, we propose a client selection mechanism considering both systems and statistical heterogeneity, which aims to improve the time-to-accuracy performance by trading off the impact of systems performance differences and data distribution differences among the clients on training efficiency. First, client selection is formulated as a combinatorial optimization problem that jointly optimizes systems and statistical performance. Then, we generalize it to a submodular maximization problem with knapsack constraint, and propose the Iterative Greedy with Partial Enumeration (IGPE) algorithm to greedily select the suitable clients. Then, the approximation ratio of IGPE is analyzed theoretically. Extensive experiments verify that the time-to-accuracy performance of the IGPE algorithm outperforms other compared algorithms in a variety of heterogeneous environments.