Mingxuan Zhou

Mingxuan Zhou

Auto-generated profile, based on publicly available information

Mingxuan Zhou

Department of Computer Science and Computing, Zhejiang University City College, Hangzhou, China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
19 December 2019 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYuanyi Chen
Yuanyi Chen
MZMingxuan Zhou
Mingxuan Zhou
ZZZengwei Zheng
Zengwei Zheng
DCDan Chen
Dan Chen
With large numbers of possible smart objects in Social Internet of Things (SIoT), a recommendation system is of great necessity to help users find smart objects they need. However, traditional recommendation techniques usually exploit user’s rating or feedback information, which are impractical as such kind of user preference information is difficult to collect in SIoT environment. In addition, temporal context plays an important role in smart object recommendation since most users tend to utilize different objects at different time slots in a day, e.g., making coffee at morning and playing game on weekends. In this work, we propose a time-aware smart object recommendation model by jointly considering user’s preference over time and smart object’s social similarity. We firstly learn user’s preference over time from his/her object usage events with a latent probabilistic model. Then, we estimate smart object’s social similarity by embedding their heterogeneous social relationships into a shared lower dimensional space. Finally, we generate the recommendation list with an item-based collaborative filtering. We conduct a comprehensive experimental study based on two real-world datasets, and the experimental results show our method outperforms all baselines significantly in terms of recommendation effectiveness.

26 August 2020 in IEEE Transactions on Intelligent Transportation Systems
Verified
Journal Article
Closed access
ZZZengwei Zheng
Zengwei Zheng
MZMingxuan Zhou
Mingxuan Zhou
YCYuanyi Chen
Yuanyi Chen
MHMeimei Huo
Meimei Huo
LSLin Sun
Lin Sun
DCDan Chen
Dan Chen
To discover the condition of roads, a large number of detection algorithms have been proposed, most of which apply machine learning methods by time and frequency processing in acceleration and velocity data. However, few of them pay attention to the similarity of the data itself when the vehicle passes over the road anomalies. In this article, we propose a method to detect road anomalies by comparing the data windows with various length using Dynamic Time Warping(DTW) method. We propose a model to prove that the maximum acceleration of a vehicle passing through a road anomaly is linear with the height of the road barrier, and it's verified by an experiment. This finding suggests that it is reasonable to divide the window by threshold detection. We also apply a brief random forest filter to roughly distinguish normal windows from anomaly windows using the aforementioned theory, in order to reduce the time consumption. From our study, a system is proposed that utilizes a series of acceleration data to discover where might be anomalies on the road, named as Quick Filter Based Dynamic Time Warping (QFB-DTW). We show that our method performs clearly beyond some existing methods. To support this conclusion, experiments are conducted based on three data sets and the results are statistically analyzed. We expect to lay the first step to some new thoughts to the field of road anomalies detection in subsequent work.

11 November 2019 in IEEE Access
Verified
Journal Article
Open access
YCYuanyi Chen
Yuanyi Chen
MZMingxuan Zhou
Mingxuan Zhou
ZZZengwei Zheng
Zengwei Zheng
Indoor magnetic-based positioning has attracted tremendous interests in recent years due to its pervasiveness and independence from extra infrastructure. Existing methods for indoor magnetic-based positioning are either point-based fingerprint matching or sequence-based fingerprint matching using the raw magnetic field strength. However, the magnetometers in smartphones are vulnerable to a few factors such as user’s postures and walking speed, which causes the magnetic field strength corresponding to a location often shift in time or exhibit local distortions, thus greatly limits the positioning performance of existing methods rely on raw magnetic field strength. To this end, we observe the differences among magnetic field strength sequences are mainly attributed to small local segments, and design a new sequence-based fingerprint based on the differences among small local segments of raw MFS sequence to represent raw MFS sequence for indoor positioning. To demonstrate the utility of our proposed sequence-based fingerprint, we have performed a comprehensive experimental evaluation on two datasets, the results show that the proposed approach can significantly improve positioning performance compare with baseline methods.

1 January 2020 in IEEE Access
Verified
Journal Article
Open access
ZZZengwei Zheng
Zengwei Zheng
MZMingxuan Zhou
Mingxuan Zhou
YCYuanyi Chen
Yuanyi Chen
MHMeimei Huo
Meimei Huo
LSLin Sun
Lin Sun
Road anomaly detection has attracting increasing attention in recent years due to its significant role in the public transportation of modern cities. A few methods has been proposed to detect road anomaly with inertial sensors (e.g., accelerometer and gyroscope), which usually utilize classification techniques by extracting time and frequency domain features from inertial sensor data. However, existing methods are time consuming since these methods perform on the whole datasets. In addition, few of them pay attention to the self-similarity of the data when vehicle passes over the road anomalies. In this paper, we propose QDetect, a road anomaly detection system with less data-dependency via querying and recomparing. Specifically, QDetect consists of two phases: 1) Query filter. This phase is designed to roughly extract road anomaly segments by matching existing labelled anomalies; 2) Re-comparison on suspicious anomalies to identify their anomaly types. We have conducted comprehensive experiments on two realworld data sets, and the results show that our method outperforms some existing methods in both detection performance and running time. We expect to lay the first step to some new thoughts to the field of real-time road anomalies detection in subsequent work.

1 November 2019 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
PDF file
ZZZengwei Zheng
Zengwei Zheng
MZMingxuan Zhou
Mingxuan Zhou
YCYuanyi Chen
Yuanyi Chen
MHMeimei Huo
Meimei Huo
DCDan Chen
Dan Chen
To discover road anomalies, a large number of detection methods have been proposed. Most of them apply classification techniques by extracting time and frequency features from the acceleration data. Existing methods are time-consuming since these methods perform on the whole datasets. In addition, few of them pay attention to the similarity of the data itself when vehicle passes over the road anomalies. In this article, we propose QF-COTE, a real-time road anomaly detection system via mobile edge computing. Specifically, QF-COTE consists of two phases: (1) Quick filter. This phase is designed to roughly extract road anomaly segments by applying random forest filter and can be performed on the edge node. (2) Road anomaly detection. In this phase, we utilize collective of transformation-based ensembles to detect road anomalies and can be performed on the cloud node. We show that our method performs clearly beyond some existing methods in both detection performance and running time. To support this conclusion, experiments are conducted based on two real-world data sets and the results are statistically analyzed. We also conduct two experiments to explore the influence of velocity and sample rate. We expect to lay the first step to some new thoughts to the field of real-time road anomalies detection in subsequent work.