Abstract
It is well known that finding the shortest reduct is NP hard. In this paper, we present an heuristic fast way of finding shortest relative reducts by exploring the specific nature of the input data. As a byproduct, we can show that the shortest relative reducts can be found in polynomial time, provided that we do know apriori that the lengths of the shortest reducts is bounded by a constant, that is, independent of the column size n. It should be noted that there are heuristic factors in the algorithm (”speeds” are not guaranteed) but the results, namely, the founded shortest reducts, are the precise answers.
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.
References
Garcia-Molina, H., Widom, J.D.U.J.: Database Systems-The Complete Book. Prentice-Hall, Englewood Cliffs (2002)
Lin, T.Y.: Mining Un-interpreted Generalized Association Rules by Linear Inequalities: Deductive data mining approach. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 204–212. Springer, Heidelberg (2004) (to appear)
Lin, T.Y.: Data Mining and Machine Oriented Modeling: A Granular Computing Approach. Journal of Applied Intelligence 13(2), 113–124 (2000)
Lin, T.Y.: N Cercone, Rough Set And Data Mining, Analysis for Imprecise Data. Kluwer Academic Publisher, Dordrecht (2000) 2nd print
Lin, T.Y., Cao, H.: Searching Decision Rules in Very Large Databases using Rough Set Theory. In: Ziarko, Yao (eds.) Rough sets and Current Trends in Computing. Lecture Notes on Artificial Intelligence, pp. 346–353 (2000); Also see, Hui Cao, Fast Data Mining Algorithms Using Rough Sets Theory, Thesis, San Jose State University , California (August 2000)
Lin, T.Y.: An Overview of Rough Set Theory from the Point of View of Relational Databases. Bulletin of International Rough Set Society I(1), 30–34 (1997)
Pawlak, Z.: Rough sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)
Yin, P.: Data Mining on Rough Set Theory Using Bit Strings, Thesis, San Jose State University
Johnson, J.L.: Database, Model, Languages, Design. Oxford University Press, Oxford (1997)
Sever, H., Raghavan, V.V., Johnsten, T.D.: The Status of Research on Rough Sets for Knowledge Discovery in Databases. In: ICNPAA 1998: Second Int’l Conf. On Nonlinear Problems in Aviation and Aerospace, Daytona Beach, FL, April 29- May 1 (1998), http://cuadra.nwrc.gov/pubs/srj98.pdf
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Decision Support by Experience - Application of the Rough Sets Theory, pp. 331–362. Kluwer Academic Publishers, Dordrecht (1992)
Ullman, D.: Database and Knowledge - Base Systems. Classical Database Systems, vol. 1. Computer Science Press, Rockville (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lin, T.Y., Yin, P. (2004). Heuristically Fast Finding of the Shortest Reducts. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_55
Download citation
DOI: https://doi.org/10.1007/978-3-540-25929-9_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22117-3
Online ISBN: 978-3-540-25929-9
eBook Packages: Springer Book Archive