Abstract
In the paper we propose a novel approach to finding rough set reducts in information systems. Our method combines an apriori-like scheme of space traversing with an efficient pruning condition based on attribute set dependence. Moreover, we discuss theoretical and implementational aspects of our pruning procedure.
The research has been partially supported by grant No 3 T11C 002 29 received from Polish Ministry of Education and Science.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24(6), 833–849 (2003)
Lin, T.: Rough set theory in very large databases. In: Proc. of CESA IMACS 1996, Lille, France, vol. 2, pp. 936–941 (1996)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support, pp. 331–362. Kluwer, Dordrecht (1992)
Kryszkiewicz, M.: The Algorithms of Knowledge Reduction in Information Systems. Warsaw University of Technology: PhD thesis (1994)
Kryszkiewicz, M., Cichon, K.: Towards scalable algorithms for discovering rough set reducts. In: T. Rough Sets, pp. 120–143 (2004)
Hu, X., Lin, T.Y., Han, J.: A new rough sets model based on database systems. In: Wang, G., Liu, Q., Yao, Y., Skowron, A. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 114–121. Springer, Heidelberg (2003)
Wu, Q., Bell, D.A., McGinnity, T.M.: Multiknowledge for decision making. Knowl. Inf. Syst. 7(2), 246–266 (2005)
Wroblewski, J.: Finding minimal reducts using genetic algorithm. In: Proc. of the 2nd Annual Join Conference on Information Sciences, pp. 186–189 (1995)
Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994, pp. 487–499 (1994)
Newman, D.J., Hettich, S., Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998)
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
Terlecki, P., Walczak, K. (2006). Attribute Set Dependence in Apriori-Like Reduct Computation. In: Wang, GY., Peters, J.F., Skowron, A., Yao, Y. (eds) Rough Sets and Knowledge Technology. RSKT 2006. Lecture Notes in Computer Science(), vol 4062. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11795131_39
Download citation
DOI: https://doi.org/10.1007/11795131_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36297-5
Online ISBN: 978-3-540-36299-9
eBook Packages: Computer ScienceComputer Science (R0)