An Approach for Discovering Urban Transport Service Problem Based on Hotline
Bibliographic record
Abstract
This paper presents a methodology for actively discovering knowledge in transport hotline databases by analyzing complaints reported by citizens, aiming to assist transportation management departments in planning actions to investigate and improve service quality. The proposed model uses text mining techniques and applies latent Dirichlet allocation (LDA) to identify topics that are related to transportation services. Consequently, we actively analyzed over 230,000 phone calls occurring in a certain province between 1st January and 31st December 2021. Specifically, we actively analyzed nearly 22,000 phone calls about the taxi industry within a selected city, and identified six topics, including lost and found (27.1%), car blocking (20.6%), attitude and behavior (17.1%), online car-hailing (12.8%), illegal operations (11.2%), and fare issues (11.2%). By actively referring to past and ongoing best practices, we actively recommend several policy implications. The proposed method thus actively transforms the service center record into a customer feedback-based assessment system to intently monitor drivers’ professionalism while efficiently addressing customers’ complaints and concerns.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.005 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".