Abstract
E-action rules, introduced in [8], represent actionability knowledge hidden in a decision system. They enhance action rules [3] and extended action rules [4], [6], [7] by assuming that data can be either symbolic or nominal. Several efficient strategies for mining e-action rules have been developed [6], [7], [5], and [8]. All of them assume that data are complete. Clearly, this constraint has to be relaxed since information about attribute values for some objects can be missing or represented as multi-values. To solve this problem, we present DEAR_3 which is an e-action rule generating algorithm. It has three major improvements in comparison to DEAR_2: handling data with missing attribute values and uncertain attribute values, and pruning outliers at its earlier stage.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Pawlak, Z.: Information systems - theoretical foundations. Information Systems Journal 6, 205–218 (1981)
Pawlak, Z.: Rough Sets and Decision Tables. In: Skowron, A. (ed.) SCT 1984. LNCS, vol. 208, pp. 186–196. Springer, Heidelberg (1985)
Raś, Z., Wieczorkowska, A.: Action rules: how to increase profit of a company. In: Zighed, A.D.A., Komorowski, J., Żytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol. 1910, pp. 587–592. Springer, Heidelberg (2000)
Raś, Z.W., Tsay, L.-S.: Discovering extended action-rules (System DEAR). In: Proceedings of the IIS 2003 Symposium. Advances in Soft Computing, pp. 293–300. Springer, Zakopane, Poland (2003)
Raś, Z.W., Tsay, L.-S.: Mining E-Action Rules. In: Mining Complex Data. In: Dardzinska, A. (ed.) Proceedings of 2005 IEEE ICDM Workshop in Houston, Texas, pp. 85–90. Math. Dept., Saint Mary’s Univ, Nova Scotia, Canada (2005)
Tsay, L.-S., Raś, Z.W., Wieczorkowska, A.: Tree-based algorithm for discovering extended action-rules (System DEAR2). In: Proceedings of the IIS 2004 Symposium, pp. 459–464. Springer, Zakopane, Poland (2004)
Tsay, L.-S., Raś, Z.W.: Action rules discovery: System DEAR2, method and experiments. Journal of Experimental and Theoretical Artificial Intelligence 17(1-2), 119–128 (2005)
Tsay, L.-S., Raś, Z.W.: E-Action Rules. In: Foundations of Data Mining, Studies in Computational Intelligence, Springer (will appear, 2006)
Tsay, L.-S., Raś, Z.W.: Discovering E-Action Rules from Incomplete Information Systems. In: Proceedings of IEEE International Conference on Granular Computing (IEEE GrC 2006), Atlanta, Georgia, May 10-12, 2006, pp. 518–521 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsay, LS., Raś, Z.W. (2006). Action Rules Discovery System DEAR_3. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_55
Download citation
DOI: https://doi.org/10.1007/11875604_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-45764-0
Online ISBN: 978-3-540-45766-4
eBook Packages: Computer ScienceComputer Science (R0)