Optimizing Bus Travel: A Novel Approach to Feature Mining with P-KMEANS and P-LDA Algorithms

• URL: http://arxiv.org/abs/2312.01687v1
• Date: Mon, 4 Dec 2023 07:21:27 GMT
• Title: Optimizing Bus Travel: A Novel Approach to Feature Mining with P-KMEANS and P-LDA Algorithms
• Authors: Hongjie Liu, Haotian Shi, Sicheng Fu, Tengfei Yuan, Xinhuan Zhang, Hongzhe Xu, Bin Ran
• Abstract summary: This study presents a bus travel feature extraction method rooted in Point of Interest (POI) data. Our method successfully mines the diverse aspects of bus travel, such as age, occupation, gender, sports, cost, safety, and personality traits.
• Score: 12.67101421854941
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Customizing services for bus travel can bolster its attractiveness, optimize usage, alleviate traffic congestion, and diminish carbon emissions. This potential is realized by harnessing recent advancements in positioning communication facilities, the Internet of Things, and artificial intelligence for feature mining in public transportation. However, the inherent complexities of disorganized and unstructured public transportation data introduce substantial challenges to travel feature extraction. This study presents a bus travel feature extraction method rooted in Point of Interest (POI) data, employing enhanced P-KMENAS and P-LDA algorithms to overcome these limitations. While the KMEANS algorithm adeptly segments passenger travel paths into distinct clusters, its outcomes can be influenced by the initial K value. On the other hand, Latent Dirichlet Allocation (LDA) excels at feature identification and probabilistic interpretations yet encounters difficulties with feature intermingling and nuanced sub-feature interactions. Incorporating the POI dimension enhances our understanding of travel behavior, aligning it more closely with passenger attributes and facilitating easier data analysis. By incorporating POI data, our refined P-KMENAS and P-LDA algorithms grant a holistic insight into travel behaviors and attributes, effectively mitigating the limitations above. Consequently, this POI-centric algorithm effectively amalgamates diverse POI attributes, delineates varied travel contexts, and imparts probabilistic metrics to feature properties. Our method successfully mines the diverse aspects of bus travel, such as age, occupation, gender, sports, cost, safety, and personality traits. It effectively calculates relationships between individual travel behaviors and assigns explanatory and evaluative probabilities to POI labels, thereby enhancing bus travel optimization.

Related papers

• Semantic Trajectory Data Mining with LLM-Informed POI Classification [11.90100976089832]
  We introduce a novel pipeline for human travel trajectory mining using semantic information. Our approach achieves a 93.4% accuracy and a 96.1% F-1 score in POI classification, and a 91.7% accuracy with a 92.3% F-1 score in activity inference.
  arXiv  Detail & Related papers  (2024-05-20T01:29:45Z)
• Wireless Crowd Detection for Smart Overtourism Mitigation [50.031356998422815]
  This chapter describes a low-cost approach to monitoring overtourism based on mobile devices' wireless activity. The crowding sensors count the number of surrounding mobile devices, by detecting trace elements of wireless technologies. They run detection programs for several technologies, and fingerprinting analysis results are only stored locally in an anonymized database.
  arXiv  Detail & Related papers  (2024-02-14T13:20:24Z)
• Anchoring Path for Inductive Relation Prediction in Knowledge Graphs [69.81600732388182]
  APST takes both APs and CPs as the inputs of a unified Sentence Transformer architecture. We evaluate APST on three public datasets and achieve state-of-the-art (SOTA) performance in 30 of 36 transductive, inductive, and few-shot experimental settings.
  arXiv  Detail & Related papers  (2023-12-21T06:02:25Z)
• Analysis and mining of low-carbon and energy-saving tourism data characteristics based on machine learning algorithm [0.0]
  This paper proposes a low-carbon energy-saving travel data feature analysis and mining based on machine learning algorithm. The author uses K-means clustering algorithm to classify the intensity of residents' low-carbon travel willingness.
  arXiv  Detail & Related papers  (2023-12-04T14:32:54Z)
• Urban Regional Function Guided Traffic Flow Prediction [117.75679676806296]
  We propose a novel module named POI-MetaBlock, which utilizes the functionality of each region as metadata. Our module significantly improves the performance of traffic flow prediction and outperforms state-of-the-art methods that use metadata.
  arXiv  Detail & Related papers  (2023-03-17T06:03:49Z)
• MASS: Mobility-Aware Sensor Scheduling of Cooperative Perception for Connected Automated Driving [19.66714697653504]
  A new paradigm, Cooperative Perception (CP), comes to the rescue by sharing sensor data from a cooperative vehicle (CoV) Existing methods rely on the exchange of meta-information, such as visibility maps, to predict the perception gains from nearby vehicles. We propose a new approach, learning while scheduling, for distributed scheduling of CP. The proposed MASS algorithm achieves the best average perception gain and improves recall by up to 4.2 percentage points compared to other learning-based algorithms.
  arXiv  Detail & Related papers  (2023-02-25T09:03:05Z)
• Low-rank Optimal Transport: Approximation, Statistics and Debiasing [51.50788603386766]
  Low-rank optimal transport (LOT) approach advocated in citescetbon 2021lowrank LOT is seen as a legitimate contender to entropic regularization when compared on properties of interest. We target each of these areas in this paper in order to cement the impact of low-rank approaches in computational OT.
  arXiv  Detail & Related papers  (2022-05-24T20:51:37Z)
• Sequential Information Design: Markov Persuasion Process and Its Efficient Reinforcement Learning [156.5667417159582]
  This paper proposes a novel model of sequential information design, namely the Markov persuasion processes (MPPs) Planning in MPPs faces the unique challenge in finding a signaling policy that is simultaneously persuasive to the myopic receivers and inducing the optimal long-term cumulative utilities of the sender. We design a provably efficient no-regret learning algorithm, the Optimism-Pessimism Principle for Persuasion Process (OP4), which features a novel combination of both optimism and pessimism principles.
  arXiv  Detail & Related papers  (2022-02-22T05:41:43Z)
• Vehicular Cooperative Perception Through Action Branching and Federated Reinforcement Learning [101.64598586454571]
  A novel framework is proposed to allow reinforcement learning-based vehicular association, resource block (RB) allocation, and content selection of cooperative perception messages (CPMs) A federated RL approach is introduced in order to speed up the training process across vehicles. Results show that federated RL improves the training process, where better policies can be achieved within the same amount of time compared to the non-federated approach.
  arXiv  Detail & Related papers  (2020-12-07T02:09:15Z)
• Leveraging the Self-Transition Probability of Ordinal Pattern Transition Graph for Transportation Mode Classification [0.0]
  We propose the use of a feature retained from the Ordinal Pattern Transition Graph, called the probability of self-transition for transportation mode classification. The proposed feature presents better accuracy results than Permutation Entropy and Statistical Complexity, even when these two are combined.
  arXiv  Detail & Related papers  (2020-07-16T23:25:09Z)
• Study on Key Technologies of Transit Passengers Travel Pattern Mining and Applications based on Multiple Sources of Data [1.370633147306388]
  We propose a series of methodologies to mine transit riders travel pattern and behavioral preferences. We use these knowledges to adjust and optimize the transit systems.
  arXiv  Detail & Related papers  (2020-05-26T22:35:28Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.