You are currently viewing a new version of our website. To view the old version click .
Sensors
  • Article
  • Open Access

11 May 2021

A Framework of Vehicular Security and Demand Service Prediction Based on Data Analysis Integrated with Blockchain Approach

and
Department of Computer Engineering, Institute of Information Science Technology, Jeju National University, Jejusi 63243, Korea
*
Author to whom correspondence should be addressed.
This article belongs to the Special Issue Security and Privacy in Large-Scale Data Networks

Abstract

The prediction of taxi demand service has become a recently attractive area of research along with large-scale and potential applications in the intelligent transportation system. The demand process is divided into two main parts: Picking-up and dropping-off demand based on passenger habit. Taxi demand prediction is a great concept for drivers and passengers, and is designed platforms for ride-hailing and municipal managers. The majority of research has focused on forecasting the pick-up part of demand service and specifying the interconnection of spatial and temporal correlations. In this study, the main focus is to overcome the access point of non-registered users for having fake transactions using taxi services and predicting taxi demand pick-up and drop-off information. The integration of machine learning techniques and blockchain framework is considered a possible solution for this problem. The blockchain technique was selected as an effective technique for protecting and controlling the real-time system. Historical data analysis was processed by extracting the three higher related sections for the intervening time, namely closeness and trend. Next, the pick-up and drop-off taxi prediction task was processed based on constructing the components of multi-task learning and spatiotemporal feature extraction. The combination of feature embedding performance and Long Short-Term Memory (LSTM) obtain the pick-up and drop-off correlation by fusing the historical data spatiotemporal features. Finally, the taxi demand pick-up and drop-off prediction were processed based on the combination of the external factors. The experimental result is based on a real dataset in Jeju Island, South Korea, to show the proposed system’s efficacy and performance compared with other state-of-art models.

1. Introduction

In modern urbanization, the lifestyle of people significantly changes the usage of public transportation, especially taxi services, which is a comfortable and convenient choice for most people travelling when compared with the high costs of using a car and paying for parking lots and other expenses. This is evident in the increase of ride-hailing services in Jeju Island, of which its density and utilization have ineffective resources. Regular taxis in Jeju are not able to obtain the location of a passenger. Conversely, ride-hailing service such as Kakao Taxi, enables a passenger to send a request for a nearby ride-hailing taxi to their selected location. They can use the taxi service easily, comfortably, and it avoids a long waiting time. Based on customer’s experience of using both taxi services, it is important to know that the nearest ride-hailing taxi service might take more time to reach a passenger’s location. In this case, there is a need to improve the utilization and enhancement of the efficiency of both types of taxi services, which is for the benefit of the driver and passenger. The vehicular Social Network (VSN) is the best way to understand the structure of Intelligent Transportation System (ITS) [1]. The general combination of communication technologies and sensors causes the VSN platform to overcome the ITS problems, e.g., such as a traffic anomaly, road density, and other barriers. The floating cars become important components for standing taxis in VSNs [2,3]. Using the mechanism for the system’s security based on the various activities in this domain has the possibility of tracing in real-time, e.g., traffic, weather, damage, the repair of a vehicle, etc. From another point of view, based on the compromising of Internet of Things (IoT) sensors, the intruders can update their points and credits and similarly disable the located place. Any changes in the information or saved data are not visible for the drivers and passengers of the network, making such people more comfortable to conduct such misbehavior [4]. The main usage of blockchain technology is to trace, track, and stand to the relationship between the huge amount of stored data and simplify the contents without the need for the cloud. Figure 1 illustrates the overview of the proposed architecture for regular and ride-hailing taxis. There are three main layers in this system, as shown. The first layer contains the collected real-time data from the passenger and taxi driver. This data includes the passenger location and driver status if it is available or occupied and similarly the completed pick-up numbers. The second layer is the demand prediction layer which performs every period as T. The T time period shows the demand prediction for only once in every T time. Updating the demand considers the number of pick-ups based on the total T time period. The third layer contains the matching routes between the passenger and taxi. The route selection is based on real-time traffic information by minimizing the time expected to reach and road network; the request is sent to a nearby taxi, closer to the passenger.
Figure 1. Overview of the regular and ride-hailing taxi services proposed system.
The core of this research is the integration of machine learning and blockchain framework to overcome the transactional problem, reducing the waiting time and travel time of passenger based on the requested location. We have used the Hyperledger Fabric framework to secure the transaction system by giving a specific ID for each user which gives authorization to access the system. Similarly, placing access limitations on a driver and passenger’s private information. In summary, we have proposed a secure platform for taxi demand service, reducing the waiting time of passengers traveling in Jeju island.
The main contribution of this paper is as follows:
  • Considering the pick-up and drop-off taxi demand prediction based on the related tasks and creating feature extraction components based on LSTM and multi-task learning;
  • Considering the urban taxi demand situation by capturing the spatiotemporal and complex correlation for the pick-up and drop-off process;
  • External factors combination and conditions, e.g., weather, daily situation, and transportation conditions for predicting taxi demand;
  • Applying blockchain technique gives security and transparency to the system based on the IoT devices between passenger and driver;
  • Storing the vehicle information such as car number, driver rating, etc., into the blockchain framework;
  • Applying the theoretical analysis on the real-world dataset taken from Jeju Island, South Korea to execute a better performance in comparison to other baselines;
  • Reducing the unnecessary distances to improve the accuracy of demand prediction;
  • Evaluating the prediction differences errors in one day within the different time period;
  • Using the traditional dispatching baselines to get good prediction results and improve performance;
  • Overcoming the problem of fake transactions using the Hyperleger Fabric blockchain framework;
  • Specifying the valid users to access driver and passenger information.
This paper is divided as follows: Section 2 presents the practical literature review of predicting traffic data. Section 3 presents the steps of the problem explanation. Section 4 presents the pick-up and drop-off prediction of taxi demand services. Section 5 presents the experimental results and design verification, and finally, we summarize this paper in the conclusion.

3. Preliminary

In this section, the preliminaries of this research are presented. There are two main definitions of the process: The description of the trip and related information for an evaluation and description of the region portion and the evaluation information.
Description 1 (Trip).
In this scenario trip is defined as a tuple ( t i m e p i c k , l o c a t i o n p i c k , t i m e d r o p , l o c a t i o n d r o p , I D ), where the t i m e p i c k presents the time of pick-up, t i m e d r o p presents the time of dropping-off, l o c a t i o n p i c k presents the pick-up location, l o c a t i o n d r o p presents the drop-off location, and I D presents the number of the trip identification.
Description 2 (Partition of Region).
The spatial view of this process followed from [54]. As illustrated in Figure 2, the lowest left point of the map considered as X, presents the coordinate A X ( l n g X , l a t X ) , and the top right point of map considered as Y, presents the coordinate A Y ( l n g Y , l a t Y ) . Based on this process, all parts of the city are divided into equal A B grids. Similarly, the longitude and latitude length is evaluated based on α l n g and α l a t where:
A = l n g Y l n g X α l n g
B = l a t Y l a t X α l a t
Figure 2. Region partion of Jeju island based on the latitude and longitude into a grid map.
The representation of grid a , b is based on the a-th as row and b-th as the column where:
g a b l n g [ α l n g a , α l n g ( a + 1 ) ]
g a b l a t [ α l a t a , α l a t ( a + 1 ) ] ,
based on above Equations a < A and b < B .
Description 3 (Taxi Demand Service).
Following the [31,54], to evaluate the determined a , b , the taxi demand service pick-up and drop-off based on the time T j , T j + 1 estimated as:
c j p i c k , a , b = | ( t r i p | t p i c k [ T j , T j + 1 ] l o c a t i o n p i c k g a b ) |
c j d r o p , a , b = | ( t r i p | t d r o p [ T j , T j + 1 ] l o c a t i o n d r o p g a b ) | .
The time interval T j , T j + 1 requests for all regions based on the tensor C j R 2 a b , whereby ( C j ) 0 , a , b = c j p i c k , a , b and ( C j ) 1 , a , b = c j d r o p , a , b .

4. Method

This section presents the various components of taxi demand service. (1) the predictor of taxi demand, (2) the components of taxi-to-region matching, (3) the optimizer of taxi route, and (4) the components of multi-task spatiotemporal feature extraction.
Figure 3 presents the overall framework of the proposed system. There is a total of five layers in this system, as shown above. The data pre-processing layer, feature extraction layer, multi-task learning layer, network construction training layer, and blockchain framework layer. All layers are explained in detail in every section.
Figure 3. Framework of the proposed system.

4.1. Predictor of Taxi Demand

The first step is the prediction of interesting passenger areas. In this process, the LSTM model is applied in the proposed system. In this case, the demand is based on one week, 24 h per day, which is 168 h for predicting the next hour. To do this, the historical data of the previous week applied for predicting the demand for the next hour, which is taken automatically based on weekdays and weekends. This process trends the consecutive features which means the model automatically knows if it is a weekend or weekday. To avoid adding extra information as input, the next hour prediction demands relying on the previous week’s inputs. This means the 168 h of the previous input predicts the demand of next time considering the holidays, weekdays, and weekends as consecutive features. The prediction period of demand is not optional. The matching of the taxi to the region is provided every hour to predict the hourly demand. To predict the traffic demand over time, the main goal is to evaluate each region’s demand and the instant of each period. The demand information and traffic information shared with the help of VSN between the fleet at once, e.g., the remaining passenger’s prediction is evaluated based on considering the picked passengers. Figure 4 shows the performance of the LSTM model based on the hourly prediction in the proposed system. The model trained used the historical data and predicted the future taxi demand. The LSTM model encompasses two hidden layers and one output. The input is the 168 h that is the previous week’s hourly data.
Figure 4. Hourly prediction of the taxi demand based on the LSTM model.

4.2. Components of Taxi-to-Region Matching

After accurate information on taxi demand for each region, the next step is to allocate the taxi’s current location according to the regions. To ensure taxi demand, the first metric is used. If the anticipated demand becomes high, the taxi sends to that location, and it is similar for the opposite location. The taxi’s current location is the second metric that considers minimizing the phase of transaction based on the need for a taxi to reach the decided region. This process reduces the passenger waiting time in case of large-scale problems for a taxi to region, matching the bipartite weighted graph used in Figure 5. The associated weights to the edge of the graph are considered the shortest distances to reach the region’s close border. The highest demand record is duplicated based on each region’s demand in the graph according to multiple times for normalizing the level of demand based on the total number of demand and taxis. As a result, the taxi to region objective is the component matching which means one region is assigned to each taxi. This is considering that the number of taxis are more than the number of regions.
Figure 5. Scenario of the bipatite matching.
The Taxi ID is D, and the Region ID is E. As shown in Figure 5 the E = 2 and E = 3 belong to the same region B. The optimization of the matching procedure evaluated based on the ILP problem as below:
( R ) : M i n D E Z D , E X D , E .
X D , E 0 , 1 subject to:
E X D , E = 1 , D ,   a n d   D X D , E = 1 , E ,
Z D , E presents the edge of weights linked to the region and the taxi, and X D , E assigns the taxi’s decision for region D or E. Z represents the weight of the edge.

4.3. Optimizer of Taxi Route

Road network construction can be done in various ways, e.g., simple techniques of searching and fuzzy logic complex theory [55,56]. This process organized the traffic network based on the complex graph combined with the roads and intersections. Each road N contain M connections defined as: N 1 , . . . , M which is segregated into various segments in same length L N . The current location in this process is defined as: ( I n , I g n ) and the destination is defined as: ( J n , J g n ) . I n and J n present the street ID and I g n , J g n presents the segments ID. The route planning problem considers real-time traffic as an optimal solution. Determining the fastest route formulated based on the integer linear programs shows the taxi location and assigned region. This process determines feedback of real-time traffic in the system. ILP also determines the recent data best route and keeps the new data updates. A recurrent Dijkstra algorithm is applied to evaluate the traffic level for every segment to reduce the route optimizer complexity. In the process, routes update every one minute. Procedure one shows the detailed process. Algorithm 1 shows the detailed process of optimizing the taxi route.
Figure 6 presents the ride-hailing system process to take the requested taxi. The first thing is saving the location of the passenger in the ride-hailing system. The second is reading the driver location information to find the closest driver to the requested location. The driver should be free and not reserved for another passenger during working hours.
Algorithm 1: Taxi Route Optimizer Procedure.
  • Require: ( I n , I g n ) , ( J n , J g n ) and time instant
    • while taxi did not reach to the accepted location do
      • Capture the last update of the procedure based on the available data
      • Update the graph of road network
      • Find the quick way based on Dijkstra algorithm from ( I n , I g n ) and ( J n , J g n )
      • Following the suggested route
      • Updating the ( I n , I g n )
    • end while
Figure 6. Ride-hailing system flowchart.

4.4. Components of Multi-Task Spatiotemporal Feature Extraction

In this study, taxi pick-up and drop-off prediction were trained together for each time interval. First, the pick-up features in data and next to the drop-off features extracted. Therefore, feature extraction contains shared information. Moreover, every taxi demand area affects another area. This is the future prediction for taxi demand based on the historical data.
Figure 7 shows the multi-task learning architecture based on the LSTM model. There is a total of three layers for taxi demand prediction, which capture the pick-up and drop-off demand based on independent trends. Every single module of prediction has the output and input for any demand.
Figure 7. Multi-task learning-based on LSTM model for taxi demand pick-up and drop-off prediction.

4.5. Blockchain Framework in the Taxi Demand Service

In this section, the blockchain network in the proposed taxi demand service is explained. The blockchain framework certify the transparency and security between taxi service and passenger. The security process track and traces based on the IoT devices. To provide security for ride-sharing, smart devices track the transmission between the entities. The proposed system contains all the information of registered vehicles and IoT devices. IoT sensors and vehicles’ important information is stored in the database and directly to blockchain framework for tracking all activities. The main reason and necessity of blockchain in this system is to avoid the fake transactional information by hacking other users account and fill their account with others point to use for the payment. The blockchain framework secures the transactions, driver, and passenger profile to block the accessibility of non-member and users without accessibility ID. Figure 8 shows the workflow of the presented system in detail.
Figure 8. Workflow of the taxi demand blockchain framework.

5. Implementation

In this section, the implementation of the proposed blockchain framework, performance evaluation, simulation results, and transaction information explained in detail.

5.1. Performance Evaluation of Blockchain Framework

The proposed blockchain framework for the taxi demand service designed based on the Hyperledger Fabric. Table 2 shows the development environment of the presented system. The used memory for this system is 32 GB with the Ubuntu Linux 18.04.1 LTS operating system. The docker engine and composer were with the version of 18.06.1-ce and 1.13.0. The applied CLI tool is the Composer Rest Server, and the Hyperledger Fabric version is 1.2. There are lots of advantages of Hyperledger Fabric which matches with our proposed approach 1. It needs the permission of membership 2. The level of trust and scalability is high 3. The data basis needs to define and partition for privacy 4. It has the protection for sensitive data and digital keys.
Table 2. Development environment of the proposed system.

5.2. Simulation Results

Figure 9 shows the transaction results of the Hyperledger Fabric platform per second. We considered three main groups of users for evaluating the performance of the proposed system. Each group contains 500, 1000, and 1500 users. The statistical measurements are used to evaluate the taxi demand service performance in the blockchain framework.
Figure 9. Per second transaction results using Hyperledger Fabric.
Figure 10 presents the latency of query transactions in the proposed blockchain-based taxi demand service case study. The defined three groups of users used to access the designed system performance. The system latency takes response time from the designed platform. The transactions are in terms of user groups. As shown in the Figure, the latency is increasing based on maximizing the number of users.
Figure 10. Latency of query transaction.

6. Results and Discussion

This section contains a brief explanation of the proposed system experimental results and implementation process. There are datasets, baselines, and performance comparisons of various methods, fully covered in this section.

6.1. Data

The dataset collected for this research is from the transportation company in Jeju Island. It contains three million records for taxi trips in Jeju from September 2020 to December 2020. The size of the Jeju Island area is 1849 Km2. There is a total on average of 72.155 demands containing pick-up and drop-off per day. Each row of data gives the information related to ID, pick-up date and time, drop-off date and time, pick-up longitude, drop-off longitude, pick-up latitude, and drop-off latitude. The external factors define as meteorological features, temporal features, and spatial features. Table 3 shows the data description of the proposed system. Three columns explain the field, definition, and description of the dataset. A total of seven fields were used in the process mentioned: ID, pick-up time, drop-off time, pick-up time longitude, pick-up time latitude, drop-off longitude, and drop-off latitude.
Table 3. Data description.
Figure 11 presents the input and output data process in taxi demand service. There are two types of location information: The driver and passenger location. The result is the prediction of the ride-hailing service to pick-up the passenger and drop-off to the request destination based on the defined machine learning algorithms. Evaluation of ride-hailing system is based on the traditional system and predicted system.
Figure 11. Input and output data diagram.

6.2. Baselines

The presented approach is trained based on multi-task learning, in other models, the prediction and training of data used for taxi pick-up and drop-off date. The baselines consider Historical Average (HA), Long Short-Term Memory (LSTM), Multiple Layer Perceptron (MLP), and XGBoost. The detailed explanation is as below:
  • Historical Average (HA): Based on the previous car pick-up and drop-ff demand average for the location and time of the same place, the prediction value can validate.
  • Long Short-Term Memory (LSTM): Is able to learn the long-term dependencies and easily apply for the time-series methods.
  • Multiple Layer Perceptron (MLP): The proposed system compared with this approach contains four hidden layers. Respectively, every hidden layer has specific hidden units.
  • XGBoost: Is an optimized distributed gradient boosting library that is pliable, portable, and impressive for implementation.
The evaluation metric of this process is the Root Mean Square Error (RMSE) and Mean Absolute Error (MAE) defined as below:
R M S E = 1 N M ( q M q ^ M ) 2
M A E = 1 N M = 1 N | q M q ^ M | .
The predicted value is defined as q ^ M , the real value defined as q M , and the number of totals predicted values defined as N.

6.3. Performance Evaluation of Predictive Model

The comparison of the presented system with other state-of-art methods is summarized in Table 4. The lowest RMSE belongs to the proposed approach. As shown in the Table, the MLP has the highest RMSE among other approaches. The reason is in this system; the spatiotemporal correlation was not taken into account. The XGBoost algorithm shows acceptable performance, but this method is similar to MAP and does not take the spatial correlation.
Table 4. Comparison of various methods performance.
Figure 12 presents the daily variation of pick-up and drop-off taxi demand in one week from Monday to Sunday. The blue color represents the pick-up records, and the green color represents the drop-off records. As shown in Figure, the highest is on Friday with the maximum pick-up records of 25,000 passengers and almost 26,000 drop-offs. The lowest is on Sunday with a maximum 14,000 of pick-up and drop-off records.
Figure 12. Daily variation of taxi demand.
Figure 13, Figure 14 and Figure 15 present the prediction result of the taxi demand in three time periods. The first one is within fifteen minutes, the second one is within thirty minutes, and the last one is within sixty minutes. The prediction process is based on time and passenger volume. The predicted records are shown in blue, and the observed records are shown in orange.
Figure 13. The 15-min prediction result.
Figure 14. The 30-min prediction result.
Figure 15. The 60-min prediction result.
Table 5 shows the performance of LSTM based on the determined parameters, epochs, and the number of hidden units to predict the ridership in 15 min. There is a need for settlement between time and performance and select the acceptable parameters for the time and performance set. In this process, the selected parameters are 500 epochs and 100 hidden units.
Table 5. LSTM performance for 15-min prediction.
Figure 16 and Figure 17 show the good performance of the proposed method. The average loss of driver utility is about 13% compared with the considered passengers. The saved waiting time of passengers reaches about 70%, which shows the highest saved waiting time.
Figure 16. Comparision of the average utility of the driver.
Figure 17. Passenger saved waiting time.

7. Conclusions and Future Work

This research presented the problem of prediction for taxi pick-up and drop-off demand services. We applied the machine learning and multi-task learning approaches to improve this system’s performance and prediction results. Providing transparency and security between the passenger and taxi driver, track- and trace-based on IoT devices and blockchain platform. Information extraction from IoT devices and saving them in blockchain systems gave security and reduced passenger and driver fake actions. The proposed system was tested in Jeju Island, South Korea in taxi demand service, and the result presented a RMSE of 2.22, which shows this system has a lower RMSE in comparison with other baselines. The main contribution of this work is innovating the framework in learning-based for taxi demand. The first step is to extract the spatiotemporal features and apply the LSTM feature embedding to obtain the pick-up and drop-off correlation. The external factors were also considered and finally built the prediction result. This procedure concludes that the standpoint of spatial correlation for taxi demand and set regions will affect the other. From the temporal correlation point of view, the taxi demand is closely similar in a time interval. The spatiotemporal correlation should be together and not separated because the pick-up and drop-off directly affect each other. In another case, the transport conditions, e.g., weather, holiday, etc., also affect the demand for taxis. In future work, we will consider improving the accuracy of prediction based on the time-series algorithms’ performance. Similarly, using the convolutional graph network for predicting taxi demand service and reflect on this model based on the multi-step prediction.

Author Contributions

Data curation, Z.S.; funding acquisition, Y.-C.B.; investigation, Z.S.; methodology, Z.S.; project administration, Y.-C.B.; supervision, Z.S.; writing original draft, Y.-C.B.; validation, Z.S.; visualization, Z.S. All authors have read and agreed to the published version of the manuscript.

Funding

This research was financially supported by the Ministry of Small and Medium-sized Enterprises (SMEs) and Startups (MSS), Korea, under the “Regional Specialized Industry Development Program (R&D, S3091627)”, supervised by the Korea Institute for Advancement of Technology (KIAT).

Institutional Review Board Statement

Not applicable.

Data Availability Statement

No data available.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Huang, C.M.; Chen, Y.F.; Xu, S.; Zhou, H. The vehicular social network (VSN)-based sharing of downloaded geo data using the credit-based clustering scheme. IEEE Access 2018, 6, 58254–58271. [Google Scholar] [CrossRef]
  2. Kong, X.; Xia, F.; Ning, Z.; Rahim, A.; Cai, Y.; Gao, Z.; Ma, J. Mobility dataset generation for vehicular social networks based on floating car data. IEEE Trans. Veh. Technol. 2018, 67, 3874–3886. [Google Scholar] [CrossRef]
  3. Ning, Z.; Hu, X.; Chen, Z.; Zhou, M.; Hu, B.; Cheng, J.; Obaidat, M.S. A cooperative quality-aware service access system for social Internet of vehicles. IEEE Internet Things J. 2017, 5, 2506–2517. [Google Scholar] [CrossRef]
  4. Ammar, M.; Russello, G.; Crispo, B. Internet of Things: A survey on the security of IoT frameworks. J. Inf. Secur. Appl. 2018, 38, 8–27. [Google Scholar] [CrossRef]
  5. Vasilyeva, M.; Tyrylgin, A. Machine learning for accelerating macroscopic parameters prediction for poroelasticity problem in stochastic media. Comput. Math. Appl. 2021, 84, 185–202. [Google Scholar] [CrossRef]
  6. Feng, S.; Keung, J.; Yu, X.; Xiao, Y.; Bennin, K.E.; Kabir, M.A.; Zhang, M. COSTE: Complexity-based OverSampling TEchnique to alleviate the class imbalance problem in software defect prediction. Inf. Softw. Technol. 2021, 129, 106432. [Google Scholar] [CrossRef]
  7. Nguyen, N.N.; Duong, A.T. Comparison of Two Main Approaches for Handling Imbalanced Data in Churn Prediction Problem. J. Adv. Inf. Technol. Vol 2021, 12, 1–7. [Google Scholar]
  8. Kong, L.W.; Fan, H.W.; Grebogi, C.; Lai, Y.C. Machine learning prediction of critical transition and system collapse. Phys. Rev. Res. 2021, 3, 013090. [Google Scholar] [CrossRef]
  9. Ali, M.B. Multi-Perspectives of Cloud Computing Service Adoption Quality and Risks in Higher Education. In Handbook of Research on Modern Educational Technologies, Applications, and Management; IGI Global: Hershey, PA, USA, 2021; pp. 1–19. [Google Scholar]
  10. Dewanta, F.; Mambo, M. BPT Scheme: Establishing Trusted Vehicular Fog Computing Service for Rural Area Based On Blockchain Approach. IEEE Trans. Veh. Technol. 2021, 70, 1752–1769. [Google Scholar]
  11. Kasemsap, K. Software as a service, Semantic Web, and big data: Theories and applications. In Research Anthology on Recent Trends, Tools, and Implications of Computer Programming; IGI Global: Hershey, PA, USA, 2021; pp. 1179–1201. [Google Scholar]
  12. Shahbazi, Z.; Jamil, F.; Byun, Y. Topic modeling in short-text using non-negative matrix factorization based on deep reinforcement learning. J. Intell. Fuzzy Syst. 2020, 39, 1–18. [Google Scholar] [CrossRef]
  13. Shahbazi, Z.; Hazra, D.; Park, S.; Byun, Y.C. Toward Improving the Prediction Accuracy of Product Recommendation System Using Extreme Gradient Boosting and Encoding Approaches. Symmetry 2020, 12, 1566. [Google Scholar] [CrossRef]
  14. Shahbazi, Z.; Byun, Y.C. Product Recommendation Based on Content-based Filtering Using XGBoost Classifier. Int. J. Adv. Sci. Technol. 2019, 29, 6979–6988. [Google Scholar]
  15. Shahbazi, Z.; Byun, Y.C. Toward Social Media Content Recommendation Integrated with Data Science and Machine Learning Approach for E-Learners. Symmetry 2020, 12, 1798. [Google Scholar] [CrossRef]
  16. Shahbazi, Z.; Byun, Y.C. Analysis of Domain-Independent Unsupervised Text Segmentation Using LDA Topic Modeling over Social Media Contents. Int. J. Adv. Sci. Technol. 2020, 29, 5993–6014. [Google Scholar]
  17. Shahbazi, Z.; Byun, Y.C.; Lee, D.C. Toward Representing Automatic Knowledge Discovery from Social Media Contents Based on Document Classification. Int. J. Adv. Sci. Technol. 2020, 29, 14089–14096. [Google Scholar]
  18. Guo, Z.; Yu, K.; Li, Y.; Srivastava, G.; Lin, J.C.W. Deep Learning-Embedded Social Internet of Things for Ambiguity-Aware Social Recommendations. IEEE Trans. Netw. Sci. Eng. 2021. [Google Scholar] [CrossRef]
  19. Shen, J.; Ren, Y.; Wan, J.; Lan, Y. Hard Disk Drive Failure Prediction for Mobile Edge Computing Based on an LSTM Recurrent Neural Network. Mob. Inf. Syst. 2021, 2021, 8878364. [Google Scholar]
  20. Esposito, C.; Ficco, M.; Gupta, B.B. Blockchain-based authentication and authorization for smart city applications. Inf. Process. Manag. 2021, 58, 102468. [Google Scholar] [CrossRef]
  21. Yang, X.; Xue, Q.; Ding, M.; Wu, J.; Gao, Z. Short-term prediction of passenger volume for urban rail systems: A deep learning approach based on smart-card data. Int. J. Prod. Econ. 2021, 231, 107920. [Google Scholar] [CrossRef]
  22. Lu, S.; Zhang, Q.; Chen, G.; Seng, D. A combined method for short-term traffic flow prediction based on recurrent neural network. Alex. Eng. J. 2021, 60, 87–94. [Google Scholar] [CrossRef]
  23. Pavlyuk, D. Short-term traffic forecasting using multivariate autoregressive models. Procedia Eng. 2017, 178, 57–66. [Google Scholar] [CrossRef]
  24. Li, H.; Wang, Y.; Xu, X.; Qin, L.; Zhang, H. Short-term passenger flow prediction under passenger flow control using a dynamic radial basis function network. Appl. Soft Comput. 2019, 83, 105620. [Google Scholar] [CrossRef]
  25. Puchalsky, W.; Ribeiro, G.T.; da Veiga, C.P.; Freire, R.Z.; dos Santos Coelho, L. Agribusiness time series forecasting using Wavelet neural networks and metaheuristic optimization: An analysis of the soybean sack price and perishable products demand. Int. J. Prod. Econ. 2018, 203, 174–189. [Google Scholar] [CrossRef]
  26. Tang, L.; Zhao, Y.; Cabrera, J.; Ma, J.; Tsui, K.L. Forecasting short-term passenger flow: An empirical study on shenzhen metro. IEEE Trans. Intell. Transp. Syst. 2018, 20, 3613–3622. [Google Scholar] [CrossRef]
  27. Yao, H.; Wu, F.; Ke, J.; Tang, X.; Jia, Y.; Lu, S.; Gong, P.; Ye, J.; Li, Z. Deep multi-view spatial-temporal network for taxi demand prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, LA, USA, 2–7 February 2018; Volume 32. [Google Scholar]
  28. Alonso-Mora, J.; Samaranayake, S.; Wallar, A.; Frazzoli, E.; Rus, D. On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment. Proc. Natl. Acad. Sci. USA 2017, 114, 462–467. [Google Scholar] [CrossRef]
  29. Simonetto, A.; Monteil, J.; Gambella, C. Real-time city-scale ridesharing via linear assignment problems. Transp. Res. Part C Emerg. Technol. 2019, 101, 208–232. [Google Scholar] [CrossRef]
  30. Zhang, J.; Zheng, Y.; Qi, D.; Li, R.; Yi, X. DNN-based prediction model for spatio-temporal data. In Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, San Francisco, CA, USA, 31 October–3 November 2016; pp. 1–4. [Google Scholar]
  31. Zhang, J.; Zheng, Y.; Qi, D. Deep spatio-temporal residual networks for citywide crowd flows prediction. In Proceedings of the AAAI Conference on Artificial Intelligence, San Francisco, CA, USA, 4–5 February 2017; Volume 31. [Google Scholar]
  32. Zhao, Z.; Chen, W.; Wu, X.; Chen, P.C.; Liu, J. LSTM network: A deep learning approach for short-term traffic forecast. IET Intell. Transp. Syst. 2017, 11, 68–75. [Google Scholar] [CrossRef]
  33. Ota, M.; Vo, H.; Silva, C.; Freire, J. A scalable approach for data-driven taxi ride-sharing simulation. In Proceedings of the IEEE International Conference on Big Data (Big Data), Santa Clara, CA, USA, 29 October–1 November 2015; pp. 888–897. [Google Scholar]
  34. Chen, X.; Miao, F.; Pappas, G.J.; Preciado, V. Hierarchical data-driven vehicle dispatch and ride-sharing. In Proceedings of the IEEE 56th Annual Conference on Decision and Control (CDC), Melbourne, Australia, 12–15 December 2017; pp. 4458–4463. [Google Scholar]
  35. Ma, T.Y.; Rasulkhani, S.; Chow, J.Y.; Klein, S. A dynamic ridesharing dispatch and idle vehicle repositioning strategy with integrated transit transfers. Transp. Res. Part E Logist. Transp. Rev. 2019, 128, 417–442. [Google Scholar] [CrossRef]
  36. Pandey, V.; Monteil, J.; Gambella, C.; Simonetto, A. On the needs for MaaS platforms to handle competition in ridesharing mobility. Transp. Res. Part C Emerg. Technol. 2019, 108, 269–288. [Google Scholar] [CrossRef]
  37. Lin, J.; Yu, W.; Yang, X.; Yang, Q.; Fu, X.; Zhao, W. A real-time en-route route guidance decision scheme for transportation-based cyberphysical systems. IEEE Trans. Veh. Technol. 2016, 66, 2551–2566. [Google Scholar] [CrossRef]
  38. Sharma, V. An energy-efficient transaction model for the blockchain-enabled internet of vehicles (IoV). IEEE Commun. Lett. 2018, 23, 246–249. [Google Scholar] [CrossRef]
  39. Pustišek, M.; Kos, A.; Sedlar, U. Blockchain based autonomous selection of electric vehicle charging station. In Proceedings of the International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI), Beijing, China, 20–21 October 2016; pp. 217–222. [Google Scholar]
  40. Jamil, F.; Iqbal, N.; Ahmad, S.; Kim, D. Peer-to-Peer Energy Trading Mechanism based on Blockchain and Machine Learning for Sustainable Electrical Power Supply in Smart Grid. IEEE Access 2021, 9, 39193–39217. [Google Scholar] [CrossRef]
  41. Jamil, F.; Kim, D. Enhanced Kalman filter algorithm using fuzzy inference for improving position estimation in indoor navigation. J. Intell. Fuzzy Syst. 2021, 40, 8991–9005. [Google Scholar] [CrossRef]
  42. Jamil, F.; Cheikhrouhou, O.; Jamil, H.; Koubaa, A.; Derhab, A.; Ferrag, M.A. PetroBlock: A Blockchain-Based Payment Mechanism for Fueling Smart Vehicles. Appl. Sci. 2021, 11, 3055. [Google Scholar] [CrossRef]
  43. Khan, P.W.; Byun, Y.C. Smart contract centric inference engine for intelligent electric vehicle transportation system. Sensors 2020, 20, 4252. [Google Scholar] [CrossRef] [PubMed]
  44. Khan, P.W.; Byun, Y.C.; Park, N. A data verification system for CCTV surveillance cameras using blockchain technology in smart cities. Electronics 2020, 9, 484. [Google Scholar] [CrossRef]
  45. Shahbazi, Z.; Byun, Y.C. Smart Manufacturing Real-Time Analysis Based on Blockchain and Machine Learning Approaches. Appl. Sci. 2021, 11, 3535. [Google Scholar] [CrossRef]
  46. Liu, Y.; Zheng, H.; Feng, X.; Chen, Z. Short-term traffic flow prediction with Conv-LSTM. In Proceedings of the 9th International Conference on Wireless Communications and Signal Processing (WCSP), Nanjing, China, 11–13 October 2017; pp. 1–6. [Google Scholar]
  47. Fu, R.; Zhang, Z.; Li, L. Using LSTM and GRU neural network methods for traffic flow prediction. In Proceedings of the 31st Youth Academic Annual Conference of Chinese Association of Automation (YAC), Wuhan, China, 11–13 November 2016; pp. 324–328. [Google Scholar]
  48. Chen, Y.; Sha, Y.; Zhu, X.; Zhang, X. Prediction of shanghai metro line 16 passenger flow based on time series analysis-with Lingang avenue station as a study case. Oper. Res. Fuzzy 2016, 6, 15–26. [Google Scholar]
  49. Wu, Y.; Tan, H. Short-term traffic flow forecasting with spatial-temporal correlation in a hybrid deep learning framework. arXiv 2016, arXiv:1612.01022. [Google Scholar]
  50. Liu, S.; Yao, E. Holiday passenger flow forecasting based on the modified least-square support vector machine for the metro system. J. Transp. Eng. Part A Syst. 2017, 143, 04016005. [Google Scholar] [CrossRef]
  51. Sun, Y.; Leng, B.; Guan, W. A novel wavelet-SVM short-time passenger flow prediction in Beijing subway system. Neurocomputing 2015, 166, 109–121. [Google Scholar] [CrossRef]
  52. Huang, W.; Song, G.; Hong, H.; Xie, K. Deep architecture for traffic flow prediction: Deep belief networks with multitask learning. IEEE Trans. Intell. Transp. Syst. 2014, 15, 2191–2201. [Google Scholar] [CrossRef]
  53. Chen, Y.; Shu, L.; Wang, L. Traffic flow prediction with big data: A deep learning based time series model. In Proceedings of the IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), Atlanta, GA, USA, 1–4 May 2017; pp. 1010–1011. [Google Scholar]
  54. Zhou, X.; Shen, Y.; Zhu, Y.; Huang, L. Predicting multi-step citywide passenger demands using attention-based neural networks. In Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, Los Angeles, CA, USA, 5–9 February 2018; pp. 736–744. [Google Scholar]
  55. Quddus, M.A.; Ochieng, W.Y.; Noland, R.B. Current map-matching algorithms for transport applications: State-of-the art and future research directions. Transp. Res. Part C Emerg. Technol. 2007, 15, 312–328. [Google Scholar] [CrossRef]
  56. Quddus, M.A. High Integrity Map Matching Algorithms for Advanced Transport Telematics Applications. Ph.D. Thesis, Imperial College London, London, UK, 2006. [Google Scholar]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.