Fengli Zhang

Prof. Fengli Zhang

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
2 March 2022 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Qiang GaoQiang Gao
Qiang Gao
ZLZhipeng Luo
Zhipeng Luo
DKDiego Klabjan
Diego Klabjan
FZFengli Zhang
Fengli Zhang
Continual learning with neural networks, which aims to learn a sequence of tasks, is an important learning framework in artificial intelligence (AI). However, it often confronts three challenges: 1) overcome the catastrophic forgetting problem; 2) adapt the current network to new tasks; and 3) control its model complexity. To reach these goals, we propose a novel approach named continual learning with efficient architecture search (CLEAS). CLEAS works closely with neural architecture search (NAS), which leverages reinforcement learning techniques to search for the best neural architecture that fits a new task. In particular, we design a neuron-level NAS controller that decides which old neurons from previous tasks should be reused (knowledge transfer) and which new neurons should be added (to learn new knowledge). Such a fine-grained controller allows finding a very concise architecture that can fit each new task well. Meanwhile, since we do not alter the weights of the reused neurons, we perfectly memorize the knowledge learned from the previous tasks. We evaluate CLEAS on numerous sequential classification tasks, and the results demonstrate that CLEAS outperforms other state-of-the-art alternative methods, achieving higher classification accuracy while using simpler neural architectures.

19 July 2022
Verified
Book Chapter
Closed access
PDF file
JWJoojo Walker
Joojo Walker
TZTing Zhong
Ting Zhong
FZFengli Zhang
Fengli Zhang
Qiang GaoQiang Gao
Qiang Gao
FZFan Zhou
Fan Zhou

23 February 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
Qiang GaoQiang Gao
Qiang Gao
FZFan Zhou
Fan Zhou
KZKunpeng Zhang
Kunpeng Zhang
FZFengli Zhang
Fengli Zhang
GTGoce Trajcevski
Goce Trajcevski
The problem of trip recommendation has been extensively studied in recent years, by both researchers and practitioners. However, one of its key aspects--understanding human mobility--remains under-explored. Many of the proposed methods for trip modeling rely on empirical analysis of attributes associated with historical points-of-interest (POIs) and routes generated by tourists while attempting to also intertwine personal preferences--such as contextual topics, geospatial, and temporal aspects. However, the implicit transitional preferences and semantic sequential relationships among various POIs, along with the constraints implied by the starting point and destination of a particular trip, have not been fully exploited. Inspired by the recent advances in generative neural networks, in this work we propose DeepTrip--an end-to-end method for better understanding of the underlying human mobility and improved modeling of the POIs' transitional distribution in human moving patterns. DeepTrip consists of: a trip encoder (TE) to embed the contextual route into a latent variable with a recurrent neural network (RNN); and a trip decoder to reconstruct this route conditioned on an optimized latent space. Simultaneously, we define an Adversarial Net composed of a generator and critic, which generates a representation for a given query and uses a critic to distinguish the trip representation generated from TE and query representation obtained from Adversarial Net. DeepTrip enables regularizing the latent space and generalizing users' complex check-in preferences. We demonstrate, both theoretically and empirically, the effectiveness and efficiency of the proposed model, and the experimental evaluations show that DeepTrip outperforms the state-of-the-art baselines on various evaluation metrics.

10 April 2024 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZZZhiyang Zhang
Zhiyang Zhang
FZFengli Zhang
Fengli Zhang
ZXZehui Xiong
Zehui Xiong
KZKuan Zhang
Kuan Zhang
DCDajiang Chen
Dajiang Chen
Task scheduling in large-scale Industrial Internet of Things (IIoT) is characterized by the presence of diverse resources and the requirement for efficient and synchronized processing across distributed edge clouds, raising a significant challenge. This article proposes a task scheduling framework across edge clouds, namely, LsiA3CS, which employs deep reinforcement learning (DRL) and heuristic guidance to achieve distributed, asynchronous task scheduling for large-scale IIoT. Specifically, the Markov game-based model and the asynchronous advantage actor–critic (A3C) algorithm are leveraged to orchestrate diverse computational resources, effectively balancing workloads and reducing communication latency. Moreover, the incorporation of heuristic policy annealing and action masking techniques further refines the adaptability of the proposed framework to the unpredictable requirements of large-scale IIoT systems. Real-world task data sets are utilized to conduct extensive experimental evaluations on a simulated large-scale multiedge cloud IIoT. The results shows that LsiA3CS significantly reduces task completion times and energy consumption while managing unpredictable task arrivals and variable resource capacities.

2 July 2024 in Wireless Networks
Verified
Journal Article
Closed access
PDF file
ZZZhiyang Zhang
Zhiyang Zhang
FZFengli Zhang
Fengli Zhang
MCMingsheng Cao
Mingsheng Cao
CFChaosheng Feng
Chaosheng Feng
DCDajiang Chen
Dajiang Chen

9 May 2024 in Heliyon
Verified
Journal Article
Open access
PAPeter Atandoh
Peter Atandoh
FZFengli Zhang
Fengli Zhang
Mugahed A. Al-antariMugahed A. Al-antari
Mugahed A. Al-antari
DADaniel Addo
Daniel Addo
YGYeonghyeon Gu
Yeonghyeon Gu
Sentiment analysis has broad use in diverse real-world contexts, particularly in the online movie industry and other e-commerce platforms. The main objective of our work is to examine the word information order and analyze the content of texts by exploring the hidden meanings of words in online movie text reviews. This study presents an enhanced method of representing text and computationally feasible deep learning models, namely the PEW-MCAB model. The methodology categorizes sentiments by considering the full written text as a unified piece. The feature vector representation is processed using an enhanced text representation called Positional embedding and pretrained Glove Embedding Vector (PEW). The learning of these features is achieved by inculcating a multichannel convolutional neural network (MCNN), which is subsequently integrated into an Attention-based Bidirectional Long Short-Term Memory (AB) model. This experiment examines the positive and negative of online movie textual reviews. Four datasets were used to evaluate the model. When tested on the IMDB, MR (2002), MRC (2004), and MR (2005) datasets, the (PEW-MCAB) algorithm attained accuracy rates of 90.3%, 84.1%, 85.9%, and 87.1%, respectively, in the experimental setting. When implemented in practical settings, the proposed structure shows a great deal of promise for efficacy and competitiveness.