Adaptive Constraint K-Segment Principal Curves for Intelligent Transportation Systems

Authors:
Junping Zhang;Dewang Chen;U. Kruger
Affiliations:
Shanghai Key Lab. of Intell. Inf. Process., Fudan Univ., Shanghai;-;-
Venue:
IEEE Transactions on Intelligent Transportation Systems
Year:
2008

Citing 0
Cited 4

Modeling and algorithms of GPS data reduction for the Qinghai-Tibet railway

IEEE Transactions on Intelligent Transportation Systems
An effective principal curves extraction algorithm for complex distribution dataset

RSKT'10 Proceedings of the 5th international conference on Rough set and knowledge technology
Short communication: An integrated error-detecting method based on expert knowledge for GPS data points measured in Qinghai-Tibet Railway

Expert Systems with Applications: An International Journal
A global structure-based algorithm for detecting the principal graph from complex data

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper revisits the construction of principal curves. Although they have a solid theoretical foundation as a nonlinear extension to principal components, this paper shows that they are difficult to implement in practice if the data distribution is sparse and uneven or if the data contain outliers. These issues may hamper the application of principal curves to an intelligent transportation system. To address these problems, this paper introduces an adaptive constraint K-segment principal curve (ACKPC) algorithm that can be applied in the presence of uneven and sparse distributions, as well as outliers. The benefits of the ACKPC algorithm are as follows: (1) It utilizes predefined endpoints of the curve to reduce the computational effort, and (2) it shows to be less sensitive to parameter settings and outliers. These benefits are demonstrated using two benchmark studies and experimental data from a freeway traffic stream system as well as recorded data from a Global Positioning System (GPS) data from a low-precision GPS receiver.