An adapted covering algorithm approach for modeling airplanes landing gravities

Expert Systems with Applications

Volumn 26, Issue 3, 2004, Pages 443-450

  Chiu, Chaochang ^a   Chiu, Nanh Sing ^a  

^a YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

Covering algorithm; Data discretization; Genetic algorithms; Landing gravity; Rule induction

Indexed keywords

AIRCRAFT LANDING; DATA HANDLING; DATA MINING; DATA RECORDING; ERROR ANALYSIS; GENETIC ALGORITHMS; GRAVITATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; MATHEMATICAL MODELS;

COVERING ALGORITHMS; DATA DISCRETIZATION; LANDING GRAVITY; RULE INDUCTION;

KNOWLEDGE BASED SYSTEMS;

EID: 0347601946     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2003.10.003     Document Type: Article

References (35)

1. Adeli H., Cheng N.T. Integrated genetic algorithm for optimization of space structures. Journal of Aerospace Engineering, ASCE. 6:(4):1993;315-328.
2. Ashford R. Special FSF ALAR task force report: a study of fatal approach and landing accidents worldwide. Flight Safety Digest 1980-1996. Feb-Mar:1998;1.
3. Breiman L., Friedman J.H., Olshen R.A., Stone C.J. Classification and regression trees. 1984;Wadsworth, Los Angeles, CA.
4. Catlett, J. (1991). On changing continuous attributes into ordered discrete attributes. Machine learning: proceedings of European working session on learning (pp. 164-178). Lecture notes in artificial intelligence (EWSI-91). Berlin: Springer.
5. Cestnik, B. (1990). Estimating probabilities: a crucial task in machine learning. In Proceedings of the European conference on artificial intelligence (pp. 147-149).
6. Chan, C.C., Batur, C., & Srinivasan, A. (1991). Determination of quantization intervals in rule based model for dynamic systems. In Proceedings of the IEEE conference on systems, man, and cybernetics, Charlottesvile, Virginia (pp. 1719-1723).
7. Chiu, C., & Chiu, N. (2002). Intelligent aircraft maintenance support system using genetic algorithms and covering algorithms. Fourth Asia-Pacific Conference on simulated evolution and learning (pp. 502-506), November 18-22.
8. Chmielewski, M.R., & Grzymala-Busse, J.W. (1994). Global discretization of continuous attributes as preprocessing for machine learning. In Third international workshop on rough sets and soft computing (pp. 294-301).
9. Clark P., Boswell R. Rule induction with CN2: some recent improvements. Kodratoff Y. Machine learning-European working session on learning EWSL-91. 1991;151-163 Springer, Berlin.
10. Clark P., Niblett T. The CN2 induction algorithm. Machine Learning Journal. 3:1989;261-283.
11. Dougherty, J., Kohavi, R., & Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. In Machine learning: proceedings of the twelfth international conference. Los Altos, CA: Morgan Kaufmann.
12. Fayyad, U.M., & Irani, K.B. (1993). Multi-interval discretization of continuous valued attributes for classification learning. In Proceedings of IJCAI-93, Vol. 2 (pp. 1022-1027). Los Altos, CA: Morgan Kaufmann. August/September.
13. Fonseca, C.M., & Fleming, P.J. (1993). Genetic algorithms for multi-objective optimization: formulation, discussion and generalization. Proceedings of the fifth international conference on genetic algorithms (pp. 416-423). San Mateo, CA: Morgan Kaufmann.
14. Francis M.Z., Quek K.H., Wu X. RIEVL: recursive induction learning in hand gesture recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence. 20:(11):1998;1174-1185.
15. Golver F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research. 5:1986;533-549.
16. Hansen, P. (1986). The steepest ascent mildest descent heuristic for combinatorial programming. Proceedings of congress on numerical methods in combinatorial optimization, Capri, Italy.
17. Hartmann C.R.P., Varshney P.K., Mehrotra K.G., Gerberich C.L. Application of information theory to the construction of efficient decision trees. IEEE Transactions on Information Theory. IT-28:1982;565-577.
18. Holland J.H. Adaptation in natural and artificial systems. 1975;University of Michigan Press, Ann Arbor, Mich.
19. Holte R.C. Very simple classification rules perform well on most commonly used data sets. Machine Learning. 11:1993;63-91.
20. Kerber R. ChiMerge: discretization of numeric attributes. Proceedings of Tenth National Conference on Artificial Intelligence (AAAI-92). 1992;123-128.
21. Kirkpatrick S., Gelatt J.C.D., Vecchi M.P. Optimization by simulated annealing. Science. 220:1983;667-680.
22. Kohonen T. Self-organization and associative memory. 3rd ed. 1989;Springer, Berlin.
23. Li R.P., Wang Z.O. An entropy-based discretization method for classification rules with inconsistency checking. Proceedings of the First Conference on Machine Learning and Cybernetics. 1:2002;243-246.
24. Loh W.Y., Shih Y.S. Split selection methods for classification trees. Statistica Sinica. 7:1997;815-840.
25. Maass, W. (1994). Efficient agnostic pac-learning with simple hypotheses. In Proceedings of the seventh annual ACM conference on computational learning theory (pp. 67-75).
26. Michalski, R.S., Mozetic, I., Hong, J., & Lavrac, N. (1986). The multi-purpose incremental learning system AQ15 and its testing application to three medical domains. In Proceedings of the fifth national conference on artificial intelligence (pp. 1041-1045). Philadelphia, PA: Morgan Kaufmann.
27. Pfahringer B. Compression-based discretization of continuous attributes. Prieditis A., Russell S. Proceedings of the twelfth international conference on machine learning. 1995;Morgan Kaufmann, Philadelphia, PA.
28. Quinlan, J.R. (1992). C4.5: programs for machine learning. The Morgan Kaufmann series in machine learning, San Mateo, CA.
29. Quinlan, J.R. (1993). C4.5: programs for machine learning. Morgan Kaufman series, in machine learning. Dordrecht: Kluwer Academic Publishers.
30. Richeldi M., Rossotto M. Class-driven statistical discretization of continuous attributes (extended abstract). Lavrac N., Wrobel S. Machine learning: ECML-95 (Proceedings of the European conference on machine learning). Lecture notes in artificial intelligence 914. 1995;335-338 Springer, Berlin.
31. Skowron, A., & Son, N.H. (1995). Quantization of real value attributes: rough set and Boolean sciences (pp. 34-37). Wrightswille Beach, NC, USA. Sept. 28-Oct. 1.
32. Theron H., Cloete I. BEXA: a covering algorithm for learning prepositional concept descriptions. Machine Learning. 24:1996;5-40.
33. Weiss S.M., Galen R.S., Tadepalli P.V. Maximizing the predicative value of production rules. Artificial Intelligence. 45:1990;47-71.
34. Witten, I.H., & Frank, E. (1999). Data mining (pp. 97-104). San Francisco, CA: Morgan Kaufmann.
35. Wong A.K.C., Chiu D.K.Y. Synthesizing statistical knowledge from incomplete mixed-mode data. IEEE Transactions on Pattern Analysis and Machine Intelligence. vPAMI-9:(6):1987;796-805.