Peng Yu

Peng Yu

Auto-generated profile, based on publicly available information

Peng Yu

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

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 May 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYuanyi Chen
Yuanyi Chen
YLYihao Lin
Yihao Lin
ZZZengwei Zheng
Zengwei Zheng
PYPeng Yu
Peng Yu
Jiaxing SHENJiaxing SHEN
Jiaxing SHEN
MGMinyi Guo
Minyi Guo
While it is well understood that edge computing can significantly facilitate IoT-related applications by deploying edge servers close to IoT devices, it also faces many challenges with numerous IoT devices connected and interacted. One of the most important issues is how to efficiently deploy edge servers under a certain budget with the explosive growth of data scale and user base. Existing studies for edge server placement fail to consider user’s query preferences since individual users may be interested in events in particular regions and are keen to receive up-to-date data streams that originate in regions of interest. In this article, we present a preference-aware edge server placement approach that offers better workload distribution in terms of both minimizing query latency and balancing the load of edge servers. To achieve this, we formulate edge server placement with multiobjective optimization as a ${p}$ -center problem and design two progressive approaches. We first propose quadratic integer programming (QIP) for small-scale data sets. Since the ${p}$ -center problem is an NP-hard problem, we thus propose a heuristic algorithm named TAKG (TAbu search with $K$ -means and Genetic algorithm) for large-scale data sets. To evaluate the utility of the proposed models, we have conducted a comprehensive evaluation on a large data set that is collected by more than 1900 IoT devices during 30 days. Experimental results indicate our approaches outperform all baselines significantly in terms of both query latency and load balancing.

25 July 2022 in Future Generation Computer Systems
Verified
Journal Article
Closed access
YCYuanyi Chen
Yuanyi Chen
PYPeng Yu
Peng Yu
ZZZengwei Zheng
Zengwei Zheng
Jiaxing SHENJiaxing SHEN
Jiaxing SHEN
MGMinyi Guo
Minyi Guo

24 August 2021 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
YCYuanyi Chen
Yuanyi Chen
PYPeng Yu
Peng Yu
WCWenwang Chen
Wenwang Chen
ZZZengwei Zheng
Zengwei Zheng
MGMinyi Guo
Minyi Guo
Trajectory similarity computation is a fundamental problem for many intelligent applications such as trip trajectory mining to find the most popular routes and road anomaly detection. Existing similarity computation methods for vehicle trajectory, such as dynamic time warping (DTW) and Fréchet distance, are dynamic programming problems with a quadratic time complexity in all cases and need to handle local time shifts when computing the distance between trajectories, thus limiting the scalability of these methods. In addition, GPS-based vehicle trajectories usually contain errors, such as noise and outliers, due to poor satellite visibility in urban regions and nonuniform sampling rates. To this end, we propose an embedding-based method for trajectory similarity computation with linear time complexity, which encodes a trajectory as a vector via deep representation learning and learns the similarity between trajectories with an attention-based learning to rank model. We use an interpolation-based approach to reduce noise and outliers by considering vehicle trajectory is physically constrained to the road network. Experiments on a massive vehicle trajectory data set show that the proposed approach outperforms state-of-the-art baselines consistently and significantly.

2 August 2022 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
YCYuanyi Chen
Yuanyi Chen
PYPeng Yu
Peng Yu
WCWenwang Chen
Wenwang Chen
ZZZengwei Zheng
Zengwei Zheng
MGMinyi Guo
Minyi Guo
The proliferation and ubiquity of GPS-enabled mobile Internet of Things (IoT) devices (e.g., drones and unmanned robotic devices) across many disciplines has generated substantial interest in the analysis and mining of trajectory data for enhancing public services such as air pollution monitoring and road safety. Among all trajectory analysis techniques in mobile IoT, classifying moving device trajectories is a fundamental research problem due to its importance for numerous important mobile IoT applications such as travel demand analysis and animal migration patterns. However, existing classification methods for moving object trajectories either are dynamic programming problems (such as similarity-based methods with dynamic time wrapping or Fréchet distance) with a quadratic time complexity in all cases, or need abundant labeled samples to training classification model, thus limit the scalability of these methods for given resource-constrained mobile IoT devices. In this study, we propose a deep learning-based approach for trajectory classification in mobile IoT with linear time complexity by firstly encoding a trajectory as a vector via deep representation learning, then utilizing a meta-learning based approach to learn the ability of classifying trajectory with few annotated samples. Experiments on a massive trajectory dataset show that the proposed approach outperforms state-of-the-art baselines consistently and significantly.

7 May 2022 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
YCYuanyi Chen
Yuanyi Chen
YLYihao Lin
Yihao Lin
PYPeng Yu
Peng Yu
YTYanyun Tao
Yanyun Tao
ZZZengwei Zheng
Zengwei Zheng
In the past few years, introducing ontology to describe the concepts and relationships between different entities in semantic sensor network enhances the interoperability between entities. Existing works mostly based on SPARQL retrieval ignore the user’s specific requirements of sensor attributes. Therefore, the recommendation results cannot satisfy the user’s needs. In this article, we propose a graph-based sensor recommendation model. The model mainly includes two parts: (1) Filtering nodes in data graph. In addition to using the traditional graph matching algorithm, we propose a threshold pruning algorithm to narrow the matching scope and improve the matching efficiency. (2) Recommending top- k sensors. We use the improved fast non-dominated sorting algorithm to obtain the local optimal solutions of sensor data set, and we apply the simple additive weight algorithm to characterize and sort local optional solutions. Finally, we recommend the top- k sensors to the user. By comparison, the graph-based sensor recommendation algorithm meets user’s needs more than other algorithms, and experiments show that our model outperforms several baselines in terms of both response time and precision.

1 March 2016
Verified
Conference Paper
Closed access
PYPeng Yu
Peng Yu
By analyzing the common sparse problems of the score data in the collaborative filtering recommendation system, this paper presents a recommendation method for mobile networks based on user characteristics and user trust relationship. In this method, the similarity of user characteristic attributes is used to modify the similarity calculating of the original score. Then, according to the communication data of mobile users, a trust value calculation method is put forward to meet the concept of social science. Finally, by the adaptive coordination factors to process the similarity measure results of the two aspects, the final project prediction score is obtained. Experiments show that the proposed method can effectively alleviate the problems caused by the sparse user score data, and improve the prediction accuracy of mobile recommendation system.