Lu Zhang

Dr. Lu Zhang

orcid

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
2 November 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
ZWZhiang Wu
Zhiang Wu
JCJie Cao
Jie Cao
YWYaqiong Wang
Yaqiong Wang
YWYouquan Wang
Youquan Wang
LZLu Zhang
Lu Zhang
JWJunjie Wu
Junjie Wu
Spammers, who manipulate online reviews to promote or suppress products, are flooding in online commerce. To combat this trend, there has been a great deal of research focused on detecting review spammers, most of which design diversified features and thus develop various classifiers. The widespread growth of crowdsourcing platforms has created large-scale deceptive review writers who behave more like normal users, that the way they can more easily evade detection by the classifiers that are purely based on fixed characteristics. In this paper, we propose a hybrid semisupervised learning model titled hybrid PU-learning-based spammer detection (hPSD) for spammer detection to leverage both the users' characteristics and the user-product relations. Specifically, the hPSD model can iteratively detect multitype spammers by injecting different positive samples, and allows the construction of classifiers in a semisupervised hybrid learning framework. Comprehensive experiments on movie dataset with shilling injection confirm the superior performance of hPSD over existing baseline methods. The hPSD is then utilized to detect the hidden spammers from real-life Amazon data. A set of spammers and their underlying employers (e.g., book publishers) are successfully discovered and validated. These demonstrate that hPSD meets the real-world application scenarios and can thus effectively detect the potentially deceptive review writers.

1 April 2020 in Expert Systems with Applications
Verified
Journal Article
Closed access
LCLei Chen
Lei Chen
LZLu Zhang
Lu Zhang
SCShanshan Cao
Shanshan Cao
ZWZhiang Wu
Zhiang Wu
JCJie Cao
Jie Cao

18 December 2017 in IEEE Access
Verified
Journal Article
Open access
LZLu Zhang
Lu Zhang
ZWZhiang Wu
Zhiang Wu
JCJie Cao
Jie Cao
Nowadays, online product reviews play a crucial role in the purchase decision of consumers. A high proportion of positive reviews will bring substantial sales growth while negative reviews will cause sales loss. Driven by the immense financial profits, many spammers try to promote their products or demote their competitors’ products by posting fake and biased online reviews. By registering numbers of accounts or releasing tasks in crowdsourcing platforms, many individual spammers could be organized as spammer groups to manipulate the product reviews together and can be more damaging. Existing works on spammer group detection extract spammer group candidates from review data and identify the real spammer groups using unsupervised spamicity ranking methods. Actually, according to the previous research, labeling a small number of spammer groups is easier than one assumes, however, few methods try to make good use of these important labeled data. In this paper, we propose a partially supervised learning model (PSGD) to detect spammer groups. By labeling some spammer groups as positive instances, PSGD applies Positive Unlabeled Learning (PU-Learning) to study a classifier as spammer group detector from positive instances (labeled spammer groups) and unlabeled instances (unlabeled groups). Specifically, we extract reliable negative set in terms of the positive instances and the distinctive features. By combining the positive instances, extracted negative instances and unlabeled instances, we convert the PU-Learning problem into the well-known semi-supervised learning problem, and then use Naive Bayesian model and EM algorithm to train a classifier for spammer group detection. Experiments on real-life Amazon.cn dataset shows that the proposed PSGD is effective and outperforms the state-of-the-art spammer group detection methods.

27 April 2023 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
XJXiao Jing
Xiao Jing
ZWZhiang Wu
Zhiang Wu
LZLu Zhang
Lu Zhang
ZLZhe Li
Zhe Li
DMDejun Mu
Dejun Mu
Huge amounts of text data describing malfunction, defect, and safety hazard have been recorded in power maintenance sectors. Effectively mining such text data, and thus, classifying electrical fault types from text data bring the potential to considerably reduce the manpower in a variety of industrial applications such as power scheduling and periodic report generation. However, short sentences in verbal expressions, pervasive technical terms of electronics, and imbalanced fault type distribution put an enormous hindrance to fault diagnosis using unstructured data analytic approaches. It has conclusively been shown that deep learning is highly effective to learn representations for unstructured data. In this paper, we design and implement a deep-learning-based electrical fault identification framework, of which the core component is supervised Sentence Embedding combined with an Imbalanced Classification (SEIC) model. SEIC incorporates very little domain knowledge represented by class-related keywords into supervised sentence embedding. Meanwhile, both sentence embedding training and imbalanced multilabel classification training are guided by one unified objective. Experimental results on real-world dataset demonstrate that SEIC significantly improves the accuracy of electrical fault classification over existing deep models. Key factors affecting SEIC are carefully explored by an extensive ablation study.

27 May 2018 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
LZLu Zhang
Lu Zhang
GHGaofeng He
Gaofeng He
JCJie Cao
Jie Cao
HZHaiting Zhu
Haiting Zhu
BXBingfeng Xu
Bingfeng Xu

7 December 2018 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
GHGaofeng He
Gaofeng He
BXBingfeng Xu
Bingfeng Xu
LZLu Zhang
Lu Zhang
HZHaiting Zhu
Haiting Zhu
Mobile application (simply “app”) identification at a per-flow granularity is vital for traffic engineering, network management, and security practices. However, uncertainty is caused by a growing fraction of encrypted traffic such as Hypertext Transfer Protocol Secure. To address this challenge, we have carefully analyzed mobile app traffic (mainly including Domain Name System, Hypertext Transfer Protocol, and encrypted traffic such as Secure Sockets Layer and Transport Layer Security) and observed that (1) the sets of server hostnames queried by different apps are distinguishable; (2) mobile apps may query multiple server hostnames simultaneously, that is, apps may send several Domain Name System lookups within a short time interval; and (3) the encrypted traffic may be similar to various other network flows generated by the same app. Based on these three observations, in this article, we propose a novel app identification methodology for encrypted network flows. To be specific, temporal, lexical, and metadata similarity are investigated to select correlated traffic and information retrieving techniques are adopted to identify apps. We ran a thorough set of experiments to assess the performance of the proposed approaches. The experimental results show that the identification accuracy can be as high as 95%, and the proposed methods have low storage requirements as well as fast training speeds.