Cheng Wang

Cheng Wang

Auto-generated profile, based on publicly available information

Cheng Wang

School of Computer Science and Technology, Tongji University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
11 September 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZHZhenhua Huang
Zhenhua Huang
XXXin Xu
Xin Xu
JNJuan Ni
Juan Ni
HZHonghao Zhu
Honghao Zhu
CWCheng Wang
Cheng Wang
The recommender system has recently drawn a lot of attention to the communities of information services and mobile applications. Many deep learning-based recommendation models have been proposed to learn the feature representations from items. However, in Internet of Things (IoT), items' description information are typically heterogeneous and multimodal, posing a challenge to items' representation learning of recommendation models. To address this challenge and to improve the recommendation effectiveness in IoT, a novel multimodal representation learning-based model (MRLM) has been proposed. In MRLM, two closely related modules were trained simultaneously; they are global feature representation learning and multimodal feature representation learning. The former was designed to learn to accurately represent the global features of items and users through simultaneous training on three tasks: 1) triplet metric learning; 2) softmax classification; and 3) microscopic verification. The latter was proposed to refine items' global features and to generate the final multimodal features by using items' multimodal description information. After MRLM converged, items' multimodal features and users' global features could be used to calculate users' preferences on items via cosine similarity. Through extensive experiments on two real-world datasets, MRLM remarkably improved the recommendation effectiveness in IoT.

15 July 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
CWCheng Wang
Cheng Wang
HZHangyu Zhu
Hangyu Zhu
The so-called behavioral anomaly detection (BAD) is expected to solve effectively a variety of security issues by detecting the deviances from normal behavioral patterns of protected agents. We propose a new graph-based behavioral modeling paradigm for BAD problem, named behavioral identification graph (BIG), which has distinct advantages over existing methods by mining deeply the property-level (as an enhancement to the event-level ) associations in behavioral data. Under BIG, the behavioral properties and their co-occurrence associations in behavioral data are modeled as the entities and relationships of graph, respectively; furthermore, behavioral properties and events are both vectorized by a devised event-property composite model, and the behavioral patterns of agents are finally represented as a multidimensional spatial distribution of behavioral properties. Consequently, for a behavior, the intensity of its behavioral anomaly can be transformed into the spatial decentrality of its behavioral agent and properties which contain both fine-grained information between behavioral properties and coarse-grained information between behavioral events. To the best of our knowledge, this is the first work to improve behavioral modeling for anomaly detection by integrating inter (event-level) and intra (property-level) associations of behaviors into a unified graph and space. Our method is validated by four representative security issues, i.e., fraud detection in online payment services (by transaction behaviors), intrusion detection in network communication services (by traffic behaviors), insider threat detection in organizational information systems (by system behaviors), and compromise detection in social networking services (by trajectory behaviors).

4 May 2020 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Open access
CWCheng Wang
Cheng Wang
HZHangyu Zhu
Hangyu Zhu
The vigorous development of e-commerce breeds cybercrime. Online payment fraud detection, a challenge faced by online service, plays an important role in rapidly evolving e-commerce. Behavior-based methods are recognized as a promising method for online payment fraud detection. However, it is a big challenge to build high-resolution behavioral models by using low-quality behavioral data. In this work, we mainly address this problem from data enhancement for behavioral modeling. We extract fine-grained co-occurrence relationships of transactional attributes by using a knowledge graph. Furthermore, we adopt the heterogeneous network embedding to learn and improve representing comprehensive relationships. Particularly, we explore customized network embedding schemes for different types of behavioral models, such as the population-level models, individual-level models, and generalized-agent-based models. The performance gain of our method is validated by the experiments over the real dataset from a commercial bank. It can help representative behavioral models improve significantly the performance of online banking payment fraud detection. To the best of our knowledge, this is the first work to realize data enhancement for diversified behavior models by implementing network embedding algorithms on attribute-level co-occurrence relationships.

26 February 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
ZHZhenhua Huang
Zhenhua Huang
JTJinyi Tang
Jinyi Tang
GSGuangxu Shan
Guangxu Shan
JNJuan Ni
Juan Ni
YCYunwen Chen
Yunwen Chen
CWCheng Wang
Cheng Wang
Using large-scale GPS trajectory data to improve taxi services has recently attracted much attention in Internet of Things and smart city communities. In this paper, we use a large-scale GPS trajectory dataset generated by over 12,000 taxis in a period of three months in Shanghai, China, and present an efficient passenger-hunting recommendation framework with the multi-task deep learning paradigm. This framework contains two modules: offline training of passenger-hunting recommendation model (OT-PHRM) and online application of passenger-hunting recommendation model (OA-PHRM). The module OT-PHRM mainly includes two DCNNs (Deep Convolutional Neural Networks) and uses the multi-task learning strategy. The first DCNN realizes the region prediction for picking up passengers, while the second DCNN uses the weight-sharing structure to predict the levels of road congestion and earnings of carrying passengers. In particular, for the input of two DCNNs, we not only consider contextual features of taxi driving, region features and valuable statistical features, but also combine individual features into meaningful ones. In the module OA-PHRM, we propose DL-PHRec, which calculates three prediction values using two trained DCNNs in OT-PHRM in real time, and then recommends a personal ranking-list of regions to each taxi driver according to their scores. Experimental results show the feasibility and effectiveness of our recommendation framework.

5 March 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
CWCheng Wang
Cheng Wang
LZLuomeng Zhang
Luomeng Zhang
ZLZhong Li
Zhong Li
CJChangjun Jiang
Changjun Jiang
The Internet of Vehicles (IoV) is a subapplication of the Internet of Things in the automotive field. Large amounts of sensor data require to be transferred in real-time. Most of the routing protocols are specifically targeted to specific situations in IoV. But communication environment of IoV usually changes in the space-time dimension. Unfortunately, the traditional vehicular networks cannot select the optimal routing policy when facing the dynamic environment, due to the lack of abilities of sensing the environment and learning the best strategy. Sensing and learning constitute two key steps of the cognition procedure. Thus, in this paper, we present a software defined cognitive network for IoV (SDCIV), in which reinforcement learning and software defined network technology are considered for IoV to achieve cognitive capability. To the best of our knowledge, this paper is the first one that can give the optimal routing policy adaptively through sensing and learning from the environment of IoV. We perform experiments on a real vehicular dataset to validate the effectiveness and feasibility of the proposed algorithm. Results show that our algorithm achieves better performance than several typical protocols in IoV. We also show the feasibility and effectiveness of our proposed SDCIV.

28 May 2018 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YHYuan He
Yuan He
CWCheng Wang
Cheng Wang
CJChangjun Jiang
Changjun Jiang
As a typical latent factor model, Matrix Factorization (MF) has demonstrated its great effectiveness in recommender systems. Users and items are represented in a shared low-dimensional space so that the user preference can be modeled by linearly combining the item factor vector V using the user-specific coefficients U. From a generative model perspective, U and V are drawn from two independent Gaussian distributions, which is not so faithful to the reality. Items are produced to maximally meet users' requirements, which makes U and V strongly correlated. Meanwhile, the linear combination between U and V forces a bijection (one-to-one mapping), which thereby neglects the mutual correlation between the latent factors. In this paper, we address the upper drawbacks, and propose a new model, named Correlated Matrix Factorization (CMF). Technically, we apply Canonical Correlation Analysis (CCA) to map U and V into a new semantic space. Besides achieving the optimal fitting on the rating matrix, one component in each vector (U or V) is also tightly correlated with every single component in the other. We derive efficient inference and learning algorithms based on variational EM methods. The effectiveness of our proposed model is comprehensively verified on four public datasets. Experimental results show that our approach achieves competitive performance on both prediction accuracy and efficiency compared with the current state of the art.