Clustering Analysis of User Loyalty Based on K-means

In recent years, the rise of machine learning has made it possible to further explore large data in various fields. In order to explore the attributes of loyalty of public transport travelers and divide these people into different clustering clusters, this paper uses K-means clustering algorithm (K-means) to cluster the holding time, recharge amount and swiping frequency of bus travelers. Then we use Kernel Density Estimation Algorithms (KDE) to analyze the density distribution of the data of holding time, recharge amount and swipe frequency, and display the results of the two algorithms in the way of data visualization. Finally, according to the results of data visualization, the loyalty of users is classified, which provides theoretical and data support for public transport companies to determine the development potential of users.