Attribute reduction of data with error ranges and test costs

Information Sciences

Volumn 211, Issue , 2012, Pages 48-67

  Min, Fan ^a   Zhu, William ^a  

^a MINNAN NORMAL UNIVERSITY   (China)

Author keywords

Cost sensitive learning; Covering rough set; Error range; Neighborhood; Test cost

Indexed keywords

COST-SENSITIVE LEARNING; ERROR RANGE; NEIGHBORHOOD; ROUGH SET; TEST COST;

COSTS; DATA REDUCTION; HEURISTIC ALGORITHMS; TESTING;

ROUGH SET THEORY;

EID: 84862895108     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2012.04.031     Document Type: Article

References (73)

1. C.C. Aggarwal, On density based transforms for uncertain data mining, in: Proceedings of IEEE 23rd International Conference on Data Engineering, 2007, pp. 866-875. (Pubitemid 47422090)
2. A. Bargiela, and W. Pedrycz Granular Computing: An Introduction 2002 Kluwer Academic Publishers Boston
3. W. Bartol, J. Miro, K. Pioro, and F. Rossello On the coverings by tolerance classes Information Sciences 166 1-4 2004 193 211
4. J.G. Bazan, A. Skowron, Dynamic reducts as a tool for extracting laws from decision tables, in: Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, 1994, pp. 346-355.
5. D. Bianucci, G. Cattaneo, and D. Ciucci Entropies and co-entropies of coverings with application to incomplete information systems Fundamenta Informaticae 75 1-4 2007 77 105 (Pubitemid 46381787)
6. X.Y. Chai, L. Deng, Q. Yang, C.X. Ling, Test-cost sensitive Naïve Bayes classification, in: Proceedings of the 5th International Conference on Data Mining, 2004, pp. 51-58. (Pubitemid 40731013)
7. M. Chau, R. Cheng, B. Kao, J. Ng, Uncertain data mining: an example in clustering location data, in: Proceedings of Advances in Knowledge Discovery and Data Mining, LNCS, vol. 3918, 2006, pp. 199-204. (Pubitemid 44019419)
8. V. Chvatal A greedy heuristic for the set-covering problem Mathematics of Operations Research 4 3 1979 233 235
9. T.M. Cover Nearest neighbor pattern classification IEEE Transactions on Information Theory 13 1967 21 27
10. J. Dai Rough 3-valued algebras Information Sciences 178 8 2008 1986 1996
11. J. Dai, and Q. Xu Approximations and uncertainty measures in incomplete information systems Information Sciences 198 1 2012 62 80
12. M. Diker Textural approach to generalized rough sets based on relations Information Sciences 180 8 2010 1418 1433
13. J. Du, Z.H. Cai, C.X. Ling, Cost-sensitive decision trees with pre-pruning, in: Proceedings of Canadian AI, No. 4509 in LNAI, 2007, pp. 171-179. (Pubitemid 350269926)
14. Y. Du, Q. Hu, P. Zhu, and P. Ma Rule learning for classification based on neighborhood covering reduction Information Sciences 181 24 2011 5457 5467
15. S. Greco, B. Matarazzo, R. Slowinski, J. Stefanowski, Variable consistency model of dominance-based rough sets approach., in: Proceedings of Rough Sets and Current Trends in Computing, LNCS, vol. 2005, 2000, pp. 170-181.
16. H. He, F. Min, Accumulated cost based test-cost-sensitive attribute reduction, in: Proceedings of the 13th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing, LNAI, vol. 6743, 2011, pp. 244-247.
17. H. He, F. Min, W. Zhu, Attribute reduction in test-cost-sensitive decision systems with common-test-costs, in: Proceedings of the 3rd International Conference on Machine Learning and Computing, vol. 1, 2011, pp. 432-436.
18. Q. Hu, W. Pedrycz, D. Yu, and J. Lang Selecting discrete and continuous features based on neighborhood decision error minimization IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 40 1 2010 37 50
19. Q. Hu, D. Yu, J. Liu, and C. Wu Neighborhood rough set based heterogeneous feature subset selection Information Sciences 178 18 2008 3577 3594
20. Q. Hu, D. Yu, and Z. Xie Numerical attribute reduction based on neighborhood granulation and rough approximation (in chinese) Journal of Software 19 3 2008 640 649 (Pubitemid 351511023)
21. B. Huang, H.-X. Li, and D.-K. Wei Dominance-based rough set model in intuitionistic fuzzy information systems Knowledge-Based Systems 28 2012 115 123
22. J. Järvinen, Approximations and rough sets based on tolerances, in: Proceedings of Rough Sets and Current Trends in Computing, LNCS, vol. 2005, 2000, pp. 182-189.
23. W. Jin, A.K. Tung, J. Han, W. Wang, Ranking outliers using symmetric neighborhood relationship, in: Proceedings of the 10th Pacific-Asia Conference on Knowledge Discovery and Data Mining, 2006, pp. 577-593. (Pubitemid 44019461)
24. M. Kukar, I. Kononenko, Cost-sensitive learning with neural networks, in: Proceedings of the 13th European Conference on Artificial Intelligence, 1998, pp. 445-449.
25. H. Li, M. Wang, X. Zhou, and J. Zhao An interval set model for learning rules from incomplete information table International Journal of Approximate Reasoning 53 2012 24 37
26. T.Y. Lin Neighborhood systems and approximation in database and knowledge base systems Proceedings of the 4th International Symposium on Methodologies of Intelligent Systems 1989 ACM 75 86
27. T.Y. Lin, Granular computing on binary relations-analysis of conflict and chinese wall security policy, in: Proceedings of Rough Sets and Current Trends in Computing, LNAI, vol. 2475, 2002, pp. 296-299.
28. T.Y. Lin, Granular computing - structures, representations, and applications, in: Lecture Notes in Artificial Intelligence, vol. 2639, 2003, pp. 16-24. (Pubitemid 36657931)
29. T.Y. Lin, Neighborhood systems: mathematical models of information granulations, in: Proceedings of IEEE International Conference on Systems, Man & Cybernetics, 2003, pp. 75-86.
30. C.X. Ling, Q. Yang, J.N. Wang, S.C. Zhang, Decision trees with minimal costs, in: Proceedings of the 21st International Conference on Machine learning, 2004, p. 69.
31. P. Lingras, C. Davies, Rough genetic algorithms, in: Lecture Notes in Computer Science, vol. 1711, 1999, pp. 38-46.
32. D. Liu, T.R. Li, and D. Ruan Probabilistic model criteria with decision-theoretic Rough sets Information Sciences 181 2011 3709 3722
33. G. Liu Generalized rough sets over fuzzy lattices Information Sciences 178 6 2008 1651 1662
34. Q. Liu, F. Li, F. Min, M. Ye, and G. Yang An efficient reduction algorithm based on new conditional information entropy Control and Decision 20 8 2005 878 882 (in Chinese) (Pubitemid 41293160)
35. Z. Meng, and Z. Shi A fast approach to attribute reduction in incomplete decision systems with tolerance relation-based rough sets Information Sciences 179 16 2009 2774 2793
36. D.Q. Miao, Y. Zhao, Y.Y. Yao, H.X. Li, and F.F. Xu Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model Information Sciences 179 24 2009 4140 4150
37. F. Min, H. He, Y. Qian, and W. Zhu Test-cost-sensitive attribute reduction Information Sciences 181 2011 4928 4942
38. F. Min, and Q. Liu A hierarchical model for test-cost-sensitive decision systems Information Sciences 179 2009 2442 2452
39. F. Min, and W. Zhu Attribute reduction with test cost constraint Journal of Electronic Science and Technology of China 9 2 2011 97 102
40. F. Min, W. Zhu, Optimal sub-reducts in the dynamic environment, in: Proceedings of IEEE International Conference on Granular Computing, 2011, pp. 457-462.
41. F. Min, W. Zhu, Optimal sub-reducts with test cost constraint, in: Proceedings of Rough Set and Knowledge Technology, LNAI, vol. 6954, 2011, pp. 57-62.
42. F. Min, W. Zhu, H. Zhao, G. Pan, Coser: Cost-senstive rough sets, 2011. < http://grc.fjzs.edu.cn/∼fmin/coser/ >.
43. Z. Pawlak Rough sets International Journal of Computer and Information Sciences 11 1982 341 356
44. Z. Pawlak Rough Sets: Theoretical Aspects of Reasoning about Data 1991 Kluwer Academic Publishers Boston
45. Z. Pawlak Rough set theory and its applications Journal of Telecommunications and Information Technology 3 2002 7 10
46. Z. Pawlak Rough sets and intelligent data analysis Information Sciences 147 12 2002 1 12 (Pubitemid 35349784)
47. J.F. Peters Near sets. General theory about nearness of objects Applied Mathematical Sciences 1 53 2007 2609 2629
48. L. Polkowski A set theory for rough sets: toward a formal calculus of vague Fundamenta Informaticae 71 1 2006 49 61 (Pubitemid 43848919)
49. Y. Qian, J. Liang, W. Pedrycz, and C. Dang Positive approximation: an accelerator for attribute reduction in rough set theory Artificial Intelligence 174 9-10 2010 597 618
50. J.R. Quinlan Induction of decision trees Machine Learning 1 1986 81 106
51. S. Romański, Operations on families of sets for exhaustive search given a monotonic function, in: Proceedings of the 3rd International Conference on Data and Knowledge Bases, 1988, pp. 28-30.
52. A. Skowron, C. Rauszer, The discernibility matrices and functions in information systems, in: Intelligent Decision Support, 1992, pp. 331-362.
53. A. Skowron, and J. Stepaniuk Tolerance approximation spaces Fundamenta Informaticae 27 1996 245 253 (Pubitemid 126715034)
54. D. Ślȩzak Approximate entropy reducts Fundamenta Informaticae 53 3-4 2002 365 390
55. P.D. Turney Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm Journal of Artificial Intelligence Research 2 1995 369 409
56. P.D. Turney, Types of cost in inductive concept learning, in: Proceedings of the Workshop on Cost-Sensitive Learning at the 17th ICML, 2000, pp. 1-7.
57. G. Wang, Attribute core of decision table, in: Proceedings of Rough Sets and Current Trends in Computing, LNCS, vol. 2475, 2002, pp. 213-217.
58. G. Wang, H. Yu, and D. Yang Decision table reduction based on conditional information entropy Chinese Journal of Computers 2 7 2002 759 766 (Pubitemid 35339183)
59. X.-Z. Wang, J.-H. Zhai, and S.-X. Lu Induction of multiple fuzzy decision trees based on rough set technique Information Sciences 178 2008 3188 3202
60. W. Wei, J. Liang, and Y. Qian A comparative study of rough sets for hybrid data Information Sciences 190 2012 1 16
61. J. Wróblewski, Finding minimal reducts using genetic algorithms, in: Proceedings of International Workshop on Rough Sets Soft Computing at Second Annual Joint Conference on Information Sciences, 1995, pp. 186-189.
62. Q. Yang, and X. Wu 10 challenging problems in data mining research International Journal of Information Technology and Decision Making 5 4 2006 597 604
63. Y.Y. Yao Relational interpretations of neighborhood operators and rough set approximation operators Information Sciences 111 1-4 1998 239 259 (Pubitemid 128383897)
64. Y.Y. Yao A partition model of granular computing Lecture Notes in Computer Science 3100 2004 232 253
65. Y.Y. Yao, and S. Wong A decision theoretic framework for approximating concepts International Journal of Man-Machine Studies 37 1992 793 809
66. Y.Y. Yao, and Y. Zhao Attribute reduction in decision-theoretic rough set models Information Sciences 178 17 2008 3356 3373
67. Y.Y. Yao, Y. Zhao, J. Wang, On reduct construction algorithms, in: Proceedings of Rough Set and Knowledge Technology, LNAI, vol. 4062, 2006, pp. 297-304. (Pubitemid 44165655)
68. Z. Zhou, and X. Liu Training cost-sensitive neural networks with methods addressing the class imbalance problem IEEE Transactions on Knowledge and Data Engineering 18 1 2006 63 77 (Pubitemid 43145089)
69. W. Zhu, Basic concepts in covering-based rough sets, in: Proceedings of the International Conference on Natural Computation, vol. 1, 2007, pp. 283-286.
70. W. Zhu Generalized rough sets based on relations Information Sciences 177 22 2007 4997 5011 (Pubitemid 47331457)
71. W. Zhu Topological approaches to covering rough sets Information Sciences 177 6 2007 1499 1508 (Pubitemid 46037660)
72. W. Zhu, and F. Wang Reduction and axiomization of covering generalized rough sets Information Sciences 152 1 2003 217 230
73. W. Ziarko Variable precision rough set model Journal of Computer and System Sciences 46 1 1993 39 59 (Pubitemid 23639120)