Abstract
This paper presents ARES Rough Set Exploration System. This system is a complex data analyzing application. The program lets the user to discretize real data, find relative static and dynamic reducts, find frequent sets, find decision rules and calculate credibility coefficients for objects from a decision table. Some information about logical and technical aspects of the system architecture is provided as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rough Set Database System page, http://www.rsds.wsiz.rzeszow.pl
Podraza, R., Podraza, W.: Rough Set System with Data Elimination. In: Proc. of the 2002 Int. Conf. on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS 2002), Las Vegas, Nevada, USA, pp. 493–499 (2002)
Podraza, R., Dominik, A., Walkiewicz, M.: Decision Support System for Medical Applications. In: Proc. of the IASTED International Conference on Applied Simulations and Modeling, Marbella, Spain, pp. 329–334 (2003)
Podraza, R., Dominik, A., Walkiewicz, M.: Application of ARES Rough Set Exploration System for Data Analysis. Conf. Computer Science - Research and Applications, Kazimierz Dolny, Poland (2005), to appear in Annales Universitatis Mariae Curie-Skłodowska, Sectio AI Informatica, Vol. III (2005)
Risvik, K.M.: Discretization of Numerical Attributes, Preprocessing for Machine Learning. Norwegian University of Science and Technology, Department of Computer and Information Science (1997)
Pawlak, Z.: Rough Sets. In: Theoretical Aspects of Reasoning about Data. Kluwer, Dordrecht (1991)
Bazan, J.G., Nguyen, H.S., Nguyen, S.H., Synak, P., Wróblewski, J.: Rough Set Algorithms in Classification Problem. In: Polkowski, L., Tsumoto, S., Lin, T.Y. (eds.) Rough Set Methods and Applications, pp. 49–88. Physica, Heidelberg (2000)
Walczak, Z., Dominik, A., Terlecki, P.: Space Decomposition in the Problem of Finding Minimal Reducts. In: Proc. of the VII National Conference on Genetic Algorithms and Global Optimization, Kazimierz Dolny, Poland, pp. 193–201 (2004)
Wróblewski, J.: Finding minimal reducts using genetic algorithm. In: Second Annual Joint Conference on Information Sciences (JCIS 1995), University of Warsaw - Institute of Mathematics, pp. 186–189 (1995)
Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proc. of XX International Conference on VLDB, Santiago, Chile, pp. 487–499 (1994)
Kryszkiewicz, M.: Strong Rules in Large Databases. In: Proc. of VII International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems (IPMU), Paris, France, pp. 1520–1527 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Podraza, R., Walkiewicz, M., Dominik, A. (2005). Credibility Coefficients in ARES Rough Set Exploration System. In: Ślęzak, D., Yao, J., Peters, J.F., Ziarko, W., Hu, X. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3642. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548706_4
Download citation
DOI: https://doi.org/10.1007/11548706_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28660-8
Online ISBN: 978-3-540-31824-8
eBook Packages: Computer ScienceComputer Science (R0)