Mingzhong Wang

Dr. Mingzhong Wang

orcid

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

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

Representative Publications

View All Publications
1 May 2014 in Information Sciences
Verified
Journal Article
Closed access
CLChang Liu
Chang Liu
LZLiehuang Zhu
Liehuang Zhu
MWMingzhong Wang
Mingzhong Wang
YTYu-An Tan
Yu-An Tan

12 April 2017 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
MSMeng Shen
Meng Shen
MWMingwei Wei
Mingwei Wei
Liehuang ZhuLiehuang Zhu
Liehuang Zhu
MWMingzhong Wang
Mingzhong Wang
With a profusion of network applications, traffic classification plays a crucial role in network management and policy-based security control. The widely used encryption transmission protocols, such as the secure socket layer/transport layer security (SSL/TLS) protocols, lead to the failure of traditional payload-based classification methods. Existing methods for encrypted traffic classification cannot achieve high discrimination accuracy for applications with similar fingerprints. In this paper, we propose an attribute-aware encrypted traffic classification method based on the second-order Markov Chains. We start by exploring approaches that can further improve the performance of existing methods in terms of discrimination accuracy, and make promising observations that the application attribute bigram, which consists of the certificate packet length and the first application data size in SSL/TLS sessions, contributes to application discrimination. To increase the diversity of application fingerprints, we develop a new method by incorporating the attribute bigrams into the second-order homogeneous Markov chains. Extensive evaluation results show that the proposed method can improve the classification accuracy by 29% on the average compared with the state-of-the-art Markov-based method.

1 August 2019
Verified
Conference Paper
Closed access
RYRui Ye
Rui Ye
XLXin Li
Xin Li
YFYujie Fang
Yujie Fang
HZHongyu Zang
Hongyu Zang
MWMingzhong Wang
Mingzhong Wang
Alignment of multiple multi-relational networks, such as knowledge graphs, is vital for AI applications. Different from the conventional alignment models, we apply the graph convolutional network (GCN) to achieve more robust network embedding for the alignment task. In comparison with existing GCNs which cannot fully utilize multi-relation information, we propose a vectorized relational graph convolutional network (VR-GCN) to learn the embeddings of both graph entities and relations simultaneously for multi-relational networks. The role discrimination and translation property of knowledge graphs are adopted in the convolutional process. Thereafter, AVR-GCN, the alignment framework based on VR-GCN, is developed for multi-relational network alignment tasks. Anchors are used to supervise the objective function which aims at minimizing the distances between anchors, and to generate new cross-network triplets to build a bridge between different knowledge graphs at the level of triplet to improve the performance of alignment. Experiments on real-world datasets show that the proposed solutions outperform the state-of-the-art methods in terms of network embedding, entity alignment, and relation alignment.


31 July 2009 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
MWMingzhong Wang
Mingzhong Wang
KRKotagiri Ramamohanarao
Kotagiri Ramamohanarao
JCJinjun Chen
Jinjun Chen

19 September 2019 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
Xin LiXin Li
Xin Li
DHDongcheng Han
Dongcheng Han
JHJing He
Jing He
LLLejian Liao
Lejian Liao
MWMingzhong Wang
Mingzhong Wang
Next and next new point-of-interest (POI) recommendation are essential instruments in promoting customer experiences and business operations related to locations. However, due to the sparsity of the check-in records, they still remain insufficiently studied. In this article, we propose to utilize personalized latent behavior patterns learned from contextual features, e.g., time of day, day of week, and location category, to improve the effectiveness of the recommendations. Two variations of models are developed, including GPDM, which learns a fixed pattern distribution for all users; and PPDM, which learns personalized pattern distribution for each user. In both models, a soft-max function is applied to integrate the personalized Markov chain with the latent patterns, and a sequential Bayesian Personalized Ranking (S-BPR) is applied as the optimization criterion. Then, Expectation Maximization (EM) is in charge of finding optimized model parameters. Extensive experiments on three large-scale commonly adopted real-world LBSN data sets prove that the inclusion of location category and latent patterns helps to boost the performance of POI recommendations. Specifically, our models in general significantly outperform other state-of-the-art methods for both next and next new POI recommendation tasks. Moreover, our models are capable of making accurate recommendations regardless of the short/long duration or distance.