Heuristically fast finding of the shortest reducts

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3066, Issue , 2004, Pages 465-470

  Lin, Tsau Young ^a   Yin, Ping ^a  

^a SAN JOSE STATE UNIVERSITY   (United States)

Author keywords

Bitmap; Data mining; Granular computing; Reduct; Rough set

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA MINING; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; ROUGH SET THEORY; GRANULAR COMPUTING; POLYNOMIAL APPROXIMATION;

BITMAP INDEXES; GRANULAR COMPUTING; POLYNOMIAL TIME; SHORTEST REDUCTS; APRIORI; BITMAP; COLUMN SIZE; INPUT DATAS; NP-HARD; POLYNOMIAL-TIME; REDUCT; SPECIFIC NATURE;

HEURISTIC METHODS; ROUGH SET THEORY;

EID: 9444221426     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25929-9_55     Document Type: Conference Paper

References (13)

1. Hector Garcia-Molina, Jeffrey D. Ullman. Jennifer Widom, Database Systems-The Complete Book, Prentice Hall, 2002
2. T. Y. Lin "Mining Un-interpreted Generalized Association Rules by Linear Inequalities: Deductive data mining approach," In: the proceedings of RSCTC 2004, June 1-5, Uppsala, Sweden, to appear.
3. T. Y. Lin, "Data Mining and Machine Oriented Modeling: A Granular Computing Approach," Journal of Applied Intelligence, Kluwer, Vol 13, No 2, 2000, 113-124.
4. T. Y. Lin, N Cercone, Rough Set And Data Mining, Analysis for Imprecise Data, Kluwer Academic Publisher, 1997, 2nd print, 2000
5. T. Y. Lin and H. Cao, "Searching Decision Rules in Very Large Databases using Rough Set Theory." In: Rough sets and Current Trends in Computing, Ziarko & Yao (eds) Lecture Notes on Artificial Intelligence, 2000, 346-353, Also see, Hui Cao, Fast Data Mining Algorithms Using Rough Sets Theory, Thesis, San Jose State University, California, August 2000
6. T. Y. Lin and H. Cao, "Searching Decision Rules in Very Large Databases using Rough Set Theory." In: Rough sets and Current Trends in Computing, Ziarko & Yao (eds) Lecture Notes on Artificial Intelligence, 2000, 346-353, Also see, Hui Cao, Fast Data Mining Algorithms Using Rough Sets Theory, Thesis, San Jose State University, California, August 2000
7. T.Y. Lin. "An Overview of Rough Set Theory from the Point of View of Relational Databases," Bulletin of International Rough Set Society, Vol I, No1, March, 1997, 30-34.
8. Z. Pawlak, Rough sets. Theoretical Aspects of Reasoning about Data, Kluwer Academic Publishers, 1991
9. Ping Yin, "Data Mining on Rough Set Theory Using Bit Strings, Thesis, San Jose State University.
10. James L. Johnson, Database, Model, Languages, Design, Oxford University Press, 1997
11. H. Sever and V. V. Raghavan and T. D. Johnsten, "The Status of Research on Rough Sets for Knowledge Discovery in Databases," ICNPAA-98: Second Int'l Conf. On Nonlinear Problems in Aviation and Aerospace, 29 April - 1 May 1998, Daytona Beach, FL (http://cuadra.nwrc.gov/pubs/srj98.pdf)
12. A. Skowron and C. Rauszer, "The discernibility matrices and functions in information systems," in: Decision Support by Experience - Application of the Rough Sets Theory, R. Slowinski (ed.), Kluwer Academic Publishers, 1992,331-362
13. D. Ullman, Database and Knowledge - Base Systems, Volume 1: Classical Database Systems, Computer Science Press, 1988