Optimal sub-reducts in the dynamic environment

Proceedings - 2011 IEEE International Conference on Granular Computing, GrC 2011

Volumn , Issue , 2011, Pages 457-462

  Min, Fan ^a   Zhu, William ^a  

^a MINNAN NORMAL UNIVERSITY   (China)

Author keywords

attribute reduction; backtrack algorithm; constraint; cost sensitive learning; test cost

Indexed keywords

ATTRIBUTE REDUCTION; CONSTRAINT; COST-SENSITIVE; COST-SENSITIVE LEARNING; DATA ITEMS; DATA SETS; DECISION SYSTEMS; DYNAMIC ENVIRONMENTS; OPTIMAL TEST SET; ROUGH SET; TEST COST; TEST SETS; TIME CHANGE; TWO STAGE; UNIVERSITY OF CALIFORNIA;

ALGORITHMS; GRANULAR COMPUTING; OPTIMIZATION; ROUGH SET THEORY; TESTING;

COSTS;

EID: 84856766978     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GRC.2011.6122640     Document Type: Conference Paper

References (25)

1. P. D. Turney, "Cost-sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm,"Journal of Artificial Intelligence Research, vol. 2, pp. 369-409, 1995.
2. F. Min and Q. Liu, "A hierarchical model for test-cost-sensitive decision systems," Information Sciences, vol. 179, pp. 2442-2452, 2009.
3. P. D. Turney, "Types of cost in inductive concept learning,"in Proceedings of the Workshop on Cost-Sensitive Learning at the 17th ICML, California, 2000.
4. C. X. Ling, V. S. Sheng, and Q. Yang, "Test strategies for cost-sensitive decision trees," IEEE Transactions on Knowledge and Data Engineering, vol. 18, no. 8, pp. 1055-1067, 2006. (Pubitemid 44109535)
5. F. Min, H. He, Y. Qian, and W. Zhu, "Test-cost-sensitive attribute reduction," Information Sciences, vol. 181, pp. 4928-4942, November 2011.
6. Z. Pawlak, "Rough sets," International Journal of Computer and Information Sciences, vol. 11, pp. 341-356, 1982.
7. H. He and F. Min, "Accumulated cost based test-cost-sensitive attribute reduction," in RSFDGrC, ser. LNAI, vol. 6743, 2011, pp. 244-247.
8. R. Susmaga, "Computation of minimal cost reducts," in Foundations of Intelligent Systems, ser. LNCS. Springer, 1999, vol. 1609, pp. 448-456.
9. F. Min and W. Zhu, "Attribute reduction with test cost constraint," Journal of Electronic Science and Technology of China, vol. 9, no. 2, pp. 97-102, June 2011.
10. -, "Optimal partial reducts with test cost constraint," in to appear in RSKT, ser. LNAI, 2011.
11. D. Ardagna, C. Francalanci, and M. Trubian, "A multimodel algorithm for the cost-oriented design of internetbased systems," Information Sciences, vol. 176, pp. 310-3131, 2006.
12. F. Min, W. Zhu, H. Zhao, and G. Pan, "Coser: Cost-senstive rough sets, http://grc.fjzs.edu.cn/~fmin/coser/index.html,"2011.
13. W. Zhu and F. Wang, "Reduction and axiomization of covering generalized rough sets," Information Sciences, vol. 152, no. 1, pp. 217-230, 2003.
14. W. Zhu, "Topological approaches to covering rough sets,"Information Sciences, vol. 177, no. 6, pp. 1499-1508, 2007. (Pubitemid 46037660)
15. Y. Yao and Y. Zhao, "Attribute reduction in decision-theoretic rough set models," Information Sciences, vol. 178, no. 17, pp. 3356-3373, 2008.
16. W. Ziarko, "Variable precision rough set model," Journal of Computer and System Sciences, vol. 46, no. 1, pp. 39-59, 1993. (Pubitemid 23639120)
17. S. Greco, B. Matarazzo, R. Slowinski, and J. Stefanowski, "Variable consistency model of dominance-based rough sets approach." in Rough Sets and Current Trends in Computing, ser. LNCS, vol. 2005, 2000, pp. 170-181.
18. Q. Hu, D. Yu, J. Liu, and C. Wu, "Neighborhood rough set based heterogeneous feature subset selection," Information Sciences, vol. 178, no. 18, pp. 3577-3594, 2008.
19. D. Slezak, "Approximate entropy reducts," Fundamenta Informaticae, vol. 53, no. 3-4, pp. 365-390, 2002.
20. Y. Qian, J. Liang, W. Pedrycz, and C. Dang, "Positive approximation: An accelerator for attribute reduction in rough set theory," Artificial Intelligence, vol. 174, no. 9-10, pp. 597-618, 2010.
21. F. Min, X. Du, H. Qiu, and Q. Liu, "Minimal attribute space bias for attribute reduction," in Rough Set and Knowledge Technology, 2007, pp. 379-386.
22. A. Skowron and C. Rauszer, "The discernibility matrics and functions in information systems," in Intelligent Decision Support, 1992.
23. H. S. Nguyen, "On the decision table with maximal number of reducts," Electronic Notes in Theoretical Computer Science, vol. 82, no. 4, pp. 198-205, 2003.
24. Wikipedia, "Knapsack problem, http://en.wikipedia.org/wiki/knapsack problem," 2011.
25. Y. Yao, Y. Zhao, and J. Wang, "On reduct construction algorithms," in Rough Set and Knowledge Technology, 2006, pp. 297-304.