1 / 29

Characteristics in Flight Data

Characteristics in Flight Data. Characteristics in Flight Data Estimation with Logistic Regression and Support Vector Machines. ICRAT 2004 Claus Gwiggner, LIX, Ecole Polytechnique Palaiseau Gert Lanckriet, EECS, University of California, Berkeley. Flow Management and Planning Differences.

jontae
Download Presentation

Characteristics in Flight Data

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Characteristics in Flight Data Characteristics in Flight Data Estimation with Logistic Regression and Support Vector Machines ICRAT 2004 Claus Gwiggner, LIX, Ecole Polytechnique Palaiseau Gert Lanckriet, EECS, University of California, Berkeley

  2. Flow Management and Planning Differences Planning Differences • Time slots are distributed among aircraft to avoid congestion • In reality, delays, re-reroutings, etc. lead to missed time slots • Not the same number of aircraft than planned arrive in sectors: • safety, lost capacity

  3. Related Work • Factors/Causes [ATFM Study, PRR] • Slot adherence, flight plan quality, in-flight change of route, .... • Simulations [Ky, Stortz] • Random noise on departure times • Reactionary Delay [Toulouse Study] • microscopic model of departure times

  4. Unknown • Real situation at sector entries • interplay of factors • compensations of delays • ...

  5. Program • Problem Formulation • Simple Characteristics • Binary Classification • Conclusion • Future Work

  6. Planning Differences Planning Differences = Regulated Demand – Real Demand

  7. General Problem Formulation • Find 'regularities' of planning differences, useful to improve the current planning procedure • Why? Safety, suboptimal used capacity • How? • MACRO approach: relations between flows, not single deviations from flight plans • Daily basis, not extreme situations • How? Data analysis • 141 days of week-day data

  8. Today's Question • Are planning differences of different sectors the 'same'? • if yes: any model can be greatly simplified • if no: what are the differences? • Difficulty • 24 dimensions: one variable for each hour

  9. Comparison of Planning Differences • No visible regularities in both sectors ...

  10. Mean and Standard Deviation ...but similar mean and standard deviation over the time

  11. Hypothesis Tests • H0: same underlying distribution ... • reject on 1 % level • assumes that statistical properties do not vary over time • .... but what are the characteristics? • e.g. 'if high peaks at noon => sector 1'? • Find a rule that tells whether a sequence of values belongs to sector 1 • Classification problem

  12. Geometric 'on which side of the boundary lies the new item?' Support Vector Machines (Binary) Classification • Probabilistic • 'what is the probability that a new item belongs to sector 1?' • Logistic Regression

  13. Comparison • Linear Logistic Regression vs SVMs • linear vs non-linear • simple vs mathematically sophisticated • traditional vs state-of-the-art • probabilistic vs geometric • Common points [Hastie et. al 2003], [Friedman 2003] • SVM estimator of class probabilities • logistic regression induces linear boundaries

  14. Experiments on ... • Data from 4 sectors in Upper Berlin airspace • Raw Data (random permutations) • Data where number of instances in both classes are balanced • In total 8 experiments conducted

  15. Model Selection • Report Estimated Prediction Error (EPE) • Model Selection: • Cross-Validation [Stone 1974] • Wilcoxon-Mann-Whitney Test

  16. Parameters of SVMs • Kernel functions • Linear, Gauss, Poly, Linear CN, Gauss CN, Poly CN • Kernel parameters • Cost Function • 1 Norm, 2 Norm • In total over 800 combinations possible • best one estimated by cross validation

  17. Results

  18. Summary • characteristics in high dimensional data • comparison of a very simple and a very complicated classification method

  19. Conclusions • There are systematic differences between different sectors • SVMs do not promise major improvement • no more than 4% better than logistic regression • Linear Prediction is possible • Expected prediction errors around 15 %

  20. Future Work • (black box) prediction not satisfactory • Better understanding of the underlying processes • reasons for the differences • model of the probability distribution of planned traffic and realized traffic

  21. Thanks for your attention! Questions ?

  22. Results • Is Week End?

  23. Known: Causes for Planning Differences Departure Slot adherence Inconsistent profile Regulations too late Weekday, Season Weather Slot tolerance window Missing flight plans Incorrect flight plan information time In flight change of route Priorities: Very High High Medium Unknown Source: Independent Study for the Improvement of ATFM, Final Report, 2000 # over-deliveries CASA implementation

  24. Little known: Dynamics of Planning Differences Sector 1 Sector 2 'Error' Propagation ... Sector n X: time Y: Number of planning differences Related Work: Simulation studies, reactionary delay studies

  25. Summary Motivation • Are planning differences unpredictable? • Or are there hidden 'regularities'?

  26. Possible Research Questions • Propagation over the network • Dependence on traffic density, sector complexity, ... • ... • Characteristics • Comparison of different sectors

  27. Notation • A sector is represented as a vector of 24 variables, one for each hour • An instance is a value for this vector • An instance belongs to class 1 or -1; dependent on the sector from which it was drawn

  28. Binary Classification • Given: • Instances from sectors 1 and -1 • Question: • a rule to decide for a new instance to which sector it might belong • Example: • if 'high peaks at noon' then class 1 • Decision trees

  29. Geometric and Probabilistic Approaches example: Instances are 2 dimensional • Geometric • Instances are points in Euclidean space • Rules are class boundaries • Problem: overlapping classes • Probabilistic • Classes have underlying probability distribution • Rules are class-probabilities • Problem: which distribution?

More Related