Disentangling City-Level Macroscopic Traffic Performance Patterns through a Trigonometric Multiseasonal Filtering Algorithm: Inspiration from Big Data of Ride-Sourcing Trips

Author(s):  
Lu Ma ◽  
Feng Yuan ◽  
Xuedong Yan ◽  
Jiechao Zhang
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Rui Bai

The traditional preaching way of imparting knowledge can only stifle children’s imagination, creativity, and learning initiative a little bit, which is harmful to children’s healthy and happy growth. This paper combines big data technology to evaluate the effect of game teaching method in preschool education, analyzes the teaching effect of game teaching method in preschool education, and combines big data technology to find problematic teaching points. Based on the collaborative filtering algorithm of preschool children, this paper estimates the current preschool children’s score for the game by referring to the scores of neighbor preschool children on the predicted game and constructs an intelligent model. Finally, this paper combines experimental research to verify the model proposed in this paper. From the experimental research, it can be seen that the method proposed in this paper has a certain effect.


2021 ◽  
Vol 8 (1) ◽  
Author(s):  
N. Ahmed ◽  
Andre L. C. Barczak ◽  
Mohammad A. Rashid ◽  
Teo Susnjak

AbstractThis article proposes a new parallel performance model for different workloads of Spark Big Data applications running on Hadoop clusters. The proposed model can predict the runtime for generic workloads as a function of the number of executors, without necessarily knowing how the algorithms were implemented. For a certain problem size, it is shown that a model based on serial boundaries for a 2D arrangement of executors can fit the empirical data for various workloads. The empirical data was obtained from a real Hadoop cluster, using Spark and HiBench. The workloads used in this work were included WordCount, SVM, Kmeans, PageRank and Graph (Nweight). A particular runtime pattern emerged when adding more executors to run a job. For some workloads, the runtime was longer with more executors added. This phenomenon is predicted with the new model of parallelisation. The resulting equation from the model explains certain performance patterns that do not fit Amdahl’s law predictions, nor Gustafson’s equation. The results show that the proposed model achieved the best fit with all workloads and most of the data sizes, using the R-squared metric for the accuracy of the fitting of empirical data. The proposed model has advantages over machine learning models due to its simplicity, requiring a smaller number of experiments to fit the data. This is very useful to practitioners in the area of Big Data because they can predict runtime of specific applications by analysing the logs. In this work, the model is limited to changes in the number of executors for a fixed problem size.


2020 ◽  
Vol 1629 ◽  
pp. 012026
Author(s):  
Yujie Liang ◽  
Ying Yu ◽  
Wenhao Ouyang

2013 ◽  
Vol 411-414 ◽  
pp. 2288-2291
Author(s):  
Jian Xi Peng ◽  
Zhi Yuan Liu

Recommendation system is a commercial marketing method. What more, the system could increase adhesion and satisfaction of consumers to the website which brings great commercial benefit to electronic commerce. But with big data ages coming, it makes a great challenge to real-time recommendation system. As for latent factor class collaborative filtering algorithm, a distributed constructed latent factor algorithm based on cloud is presented in this paper. The algorithm could keep collaborative filtering in good recommendation and ensure the real time in massive data environment. The simulation shows that the algorithm could achieve the recommendation efficiently and quickly. High speedup and scalability are proved.


Sign in / Sign up

Export Citation Format

Share Document