Abstract
Generalized probabilistic approximations, defined using both rough set theory and probability theory, are studied using an approximation space (U, R), where R is an arbitrary binary relation. Generalized probabilistic approximations are applicable in mining inconsistent data (data with conflicting cases) and data with missing attribute values.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Clark PG, Grzymala-Busse JW (2011) Experiments on probabilistic approximations. In: Proceedings of IEEE international conference on granular computing, pp 144–149
Clark PG, Grzymala-Busse JW (2012) Experiments using three probabilistic approximations for rule induction from incomplete data sets. In: Proceedings of European conference on data mining, pp 72–78
Clark PG, Grzymala-Busse JW, Kuehnhausen M (2012) Local probabilistic approximations for incomplete data. In: Proceedings of 20th international symposium on methodologies for intelligent systems, pp 93–98
Grzymala-Busse JW (2003) Rough set strategies to data with missing attribute values. In: Proceedings of 3rd international conference on data mining, pp 56–63
Grzymala-Busse JW (2004) Data with missing attribute values: Generalization of indiscernibility relation and rule induction. Trans Rough Sets 1:78–95
Grzymala-Busse JW (2011) Generalized parameterized approximations. In: Proceedings of 6th international conference on rough sets and knowledge technology, pp 136–145
Grzymala-Busse JW (2013) Generalized probabilistic approximations. In: Proceedings of 6th international conference on human system interaction, pp 13–17
Grzymala-Busse JW, Rzasa W (2010) A local version of the MLEM2 algorithm for rule induction. Fundamenta Informaticae 100:99–116
Kryszkiewicz M (1995) Rough set approach to incomplete information systems. In: Proceedings of 2nd annual joint conference on information sciences, pp 194–197
Slowinski R, Vanderpooten D (2000) A generalized definition of rough approximations based on similarity. IEEE Trans Knowl Data Eng 12:331–336
Stefanowski J, Tsoukias A (1999) On the extension of rough sets under incomplete information. In: Proceedings of 7th international workshop on new directions in rough sets, data mining, and granular-soft computing, pp 73–81
Yao YY (1998) Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci 111:239–259
Yao YY (2007) Decision-theoretic rough set models. In: Proceedings of 2nd international conference on rough sets and knowledge technology, pp 1–12
Yao YY, Wong SKM (1992) A decision theoretic framework for approximate concepts. J Man–Mach Stud 37:793–809
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Clark, P.G., Grzymala-Busse, J.W., Hippe, Z.S. (2014). Mining Inconsistent Data with Probabilistic Approximations. In: S. Hippe, Z., L. Kulikowski, J., Mroczek, T., Wtorek, J. (eds) Issues and Challenges in Artificial Intelligence. Studies in Computational Intelligence, vol 559. Springer, Cham. https://doi.org/10.1007/978-3-319-06883-1_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-06883-1_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06882-4
Online ISBN: 978-3-319-06883-1
eBook Packages: EngineeringEngineering (R0)