Duantengchuan Li

Dr. Duantengchuan Li

School of Information Management, Wuhan University, Wuhan, Hubei, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
16 November 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
HLHai Liu
Hai Liu
CZChao Zheng
Chao Zheng
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
XSXiaoxuan Shen
Xiaoxuan Shen
KLKe Lin
Ke Lin
NXNeal N. Xiong
Neal N. Xiong
Recommendation accuracy is a fundamental problem in the quality of the recommendation system. In this article, we propose an efficient deep matrix factorization (EDMF) with review feature learning for the industrial recommender system. Two characteristics in user’s review are revealed. First, interactivity between the user and the item, which can also be considered as the former’s scoring behavior on the latter, is exploited in a review. Second, the review is only a partial description of the user’s preferences for the item, which is revealed as the sparsity property. Specifically, in the first characteristic, EDMF extracts the interactive features of onefold review by convolutional neural networks with word-attention mechanism. Subsequently, ${L}_{0}$ norm is leveraged to constrain the review considering that the review information is a sparse feature, which is the second characteristic. Furthermore, the loss function is constructed by maximum a posteriori estimation theory, where the interactivity and sparsity property are converted as two prior probability functions. Finally, the alternative minimization algorithm is introduced to optimize the loss functions. Experimental results on several datasets demonstrate that the proposed methods, which show good industrial conversion application prospects, outperform the state-of-the-art methods in terms of effectiveness and efficiency.

19 May 2021 in IEEE Transactions on Multimedia
Verified
Journal Article
Closed access
HLHai Liu
Hai Liu
SFShuai Fang
Shuai Fang
Zhaoli ZhangZhaoli Zhang
Zhaoli Zhang
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
KLKe Lin
Ke Lin
JWJiazhang Wang
Jiazhang Wang
Head pose estimation suffers from several problems, including low pose tolerance under different disturbances and ambiguity arising from common head pose representation. In this study, a robust three-branch model with triplet module and matrix Fisher distribution module is proposed to address these problems. Based on metric learning, the triplet module employs triplet architecture and triplet loss. It is implemented to maximize the distance between embeddings with different pose pairs and minimize the distance between embeddings with same pose pairs. It can learn a highly discriminate and robust embedding related to head pose. Moreover, the rotation matrix instead of Euler angle and unit quaternion is utilized to represent head pose. An exponential probability density model based on the rotation matrix (referred to as the matrix Fisher distribution) is developed to model head rotation uncertainty. The matrix Fisher distribution can further analyze the head pose, and its maximum likelihood obtained using singular value decomposition provides enhanced accuracy. Extensive experiments executed over AFLW2000 and BIWI datasets demonstrate that the proposed model achieves state-of-the-art performance in comparison with traditional methods.

18 June 2024 in Information Processing & Management
Verified
Journal Article
Closed access
YLYu Liu
Yu Liu
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
KWKaili Wang
Kaili Wang
ZXZhuoran Xiong
Zhuoran Xiong
FSFobo Shi
Fobo Shi
BHBo Hang
Bo Hang

4 November 2024 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
FSFobo Shi
Fobo Shi
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
XWXiaoguang Wang
Xiaoguang Wang
BLBing Li
Bing Li
XWXindong Wu
Xindong Wu
Knowledge graph embedding is efficient method for reasoning over known facts and inferring missing links. Existing methods are mainly triplet-based or graph-based. Triplet-based approaches learn the embedding of missing entities by a single triple only. They ignore the fact that the knowledge graph is essentially a graph structure. Graph-based methods consider graph structure information but ignore the contextual information of nodes in the knowledge graph, making them unable to discern valuable entity (relation) information. In response to the above limitations, we propose a general graph transformer framework for knowledge graph embedding (TGformer). It is the first to use a graph transformer to build knowledge embeddings with triplet-level and graph-level structural features in the static and temporal knowledge graph. Specifically, a context-level subgraph is constructed for each predicted triplet, which models the relation between triplets with the same entity. Afterward, we design a knowledge graph transformer network (KGTN) to fully explore multi-structural features in knowledge graphs, including triplet-level and graph-level, boosting the model to understand entities (relations) in different contexts. Finally, semantic matching is adopted to select the entity with the highest score. Experimental results on several public knowledge graph datasets show that our method can achieve state-of-the-art performance in link prediction.

5 February 2024 in Information Processing & Management
Verified
Journal Article
Closed access
BLBingqian Liu
Bingqian Liu
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
JWJian Wang
Jian Wang
ZWZhihao Wang
Zhihao Wang
BLBing Li
Bing Li
CZCheng Zeng
Cheng Zeng

18 March 2024 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
SXShuaiyu Xie
Shuaiyu Xie
JWJian Wang
Jian Wang
BLBing Li
Bing Li
ZZZekun Zhang
Zekun Zhang
Duantengchuan LiDuantengchuan Li
Duantengchuan Li
Patrick JungPatrick Jung
Patrick Jung
Autoscaling is critical for ensuring optimal performance and resource utilization in cloud applications with dynamic workloads. However, traditional autoscaling technologies are typically no longer applicable in microservice-based applications due to the diverse workload patterns and complex interactions between microservices. Specifically, the propagation of performance anomalies through interactions leads to a high number of abnormal microservices, making it difficult to identify the root performance bottlenecks (PBs) and formulate appropriate scaling strategies. In addition, to balance resource consumption and performance, the existing mainstream approaches based on online optimization algorithms require multiple iterations, leading to oscillation and elevating the likelihood of performance degradation. To tackle these issues, we propose PBScaler, a bottleneck-aware autoscaling framework designed to prevent performance degradation in a microservice-based application. The key insight of PBScaler is to locate the PBs. Thus, we propose TopoRank, a novel random walk algorithm based on the topological potential to reduce unnecessary scaling. By integrating TopoRank with an offline performance-aware optimization algorithm, PBScaler optimizes replica management without disrupting the online application. Comprehensive experiments demonstrate that PBScaler outperforms existing state-of-the-art approaches in mitigating performance issues while conserving resources efficiently.