1. Optimal dwelling time prediction for package tour using K-nearest neighbor classification algorithm
- Author
-
Aria Bisma Wahyutama and Mintae Hwang
- Subjects
dwelling time prediction ,k-nearest neighbor classification ,machine learning ,optimized schedule ,web application ,Telecommunication ,TK5101-6720 ,Electronics ,TK7800-8360 - Abstract
We introduce a machine learning-based web application to help travel agents plan a package tour schedule. K-nearest neighbor (KNN) classification predicts the optimal tourists’ dwelling time based on a variety of information to automatically generate a convenient tour schedule. A database collected in collaboration with an established travel agency is fed into the KNN algorithm implemented in the Python language, and the predicted dwelling times are sent to the web application via a RESTful application programming interface provided by the Flask framework. The web application displays a page in which the agents can configure the initial data and predict the optimal dwelling time and automatically update the tour schedule. After conducting a performance evaluation by simulating a scenario on a computer running the Windows operating system, the average response time was 1.762 s, and the prediction consistency was 100% over 100 iterations.
- Published
- 2024
- Full Text
- View/download PDF