An Approach to Mining Data with Continuous Decision Values
We propose a novel approach to discover useful patterns from ill-defined decision tables with a real value decision and nominal conditional attributes. The proposed solution is based on a two-layered learning algorithm. In the first layer the preference relation between objects is approximated from the data. In the second layer the approximated preference relation is used to create three applications: (1) to learn a ranking order on a collection of combinations, (2) to predict the real decision value, (3) to optimize the process of searching for the combination with maximal decision.
Unable to display preview. Download preview PDF.
- 1.Komorowski, J. Skowron, A. and Ohrn, A. 2000. The ROSETTA system, Klosgen W and Zytkow J, Handbook of Data Mining and Knowledge Discovery, Oxford University Press, ch. D.2.3.Google Scholar
- 2.Pawlak Z.: Rough sets: Theoretical aspects of reasoning about data, Kluwer Dordrecht, 1991.Google Scholar
- 3.S. Siegel, N.J. Castellan (1988). Nonparametric statistics for the behavioral sciences (2nd ed.) New York: McGraw-Hill.Google Scholar
- 4.Stone, P.: Layered Learning in Multi-Agent Systems: A Winning Approach to Robotic Soccer. The MIT Press, Cambridge, MA (2000)Google Scholar
- 5.I. H. Witten, E. Frank. Data Mining: Practical machine learning tools with Java implementations. Morgan Kaufmann, San Francisco, 1999.Google Scholar
- 6.Geoffrey I. Webb (2000). MultiBoosting: A Technique for Combining Boosting and Wagging. Machine Learning, 40(2): 159–196, Kluwer Academic Publishers, BostonGoogle Scholar
- 7.Ross Quinlan (1993). C4.5: Programs for Machine Learning, Morgan Kaufmann Publishers, San Mateo, CA.Google Scholar