Generalization of rst in ordered information table

2005 International Conference on Machine Learning and Cybernetics, ICMLC 2005

Volumn , Issue , 2005, Pages 2027-2032

  Zhang, Xiao Feng ^a   Zhang, Fu Zeng ^a   Zhao, Yong Sheng ^a  

^a LUDONG UNIVERSITY   (China)

Author keywords

Generalization; Ordered Information Table; Partial Order; Rough Set Theory

Indexed keywords

INFORMATION ANALYSIS; SET THEORY;

GENERALIZATION; INFORMATION TABLE; PARTIAL ORDER;

DATA MINING;

EID: 28444484989     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Yao, Y.Y. and Sai, Y., Mining ordering rules using rough set theory [J], Bulletin of International Rough Set Society, 5, 99-106, 2001.
2. Yao, Y.Y. and Sai, Y., On mining ordering rules [R], manuscript, 2001.
3. Sai, Y., Yao, Y.Y. and Zhong, N. Data Analysis and Mining in Ordered Information Tables [A], Proceedings of 2001 IEEE Conference on Data Mining [C], 497-504, 2001.
4. Gediga, G. and Duntsch, I. Rough approximation quality revisited [J], Artificial Intelligence, 132, 219-234, 2001.
5. Pawlak, Z. Rough Classification [J], International Journal of Man-Machine Studies, 20, 469-483, 1983.
6. Pawlak, Z. Rough sets [J]. International Journal of Computer and Information Sciences, 11(5):341-356, 1982.
7. Pawlak, Z. Rough Sets, Theoretical Aspects of Reasoning about Data [M], Kluwer Academic Publishers, Boston, 1991.
8. Cohen, W.W., Schapire R.E., and Singer Y. Learning to order things [J], Advances in Neural Information Processing Systems, 10, 1998.
9. www.netbig.com [EB/OL].