Cost-sensitive feature selection of numeric data with measurement errors

Journal of Applied Mathematics

Volumn 2013, Issue , 2013, Pages

  Zhao, Hong ^a   Min, Fan ^a   Zhu, William ^a  

^a MINNAN NORMAL UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84877282675     PISSN: 1110757X     EISSN: 16870042     Source Type: Journal    
DOI: 10.1155/2013/754698     Document Type: Article

References (63)

1. Lanzi P., Fast feature selection with genetic algorithms: a filter approach. Proceedings of the IEEE International Conference on Evolutionary Computation 1997
2. Tseng T. L. B., Huang C. C, Rough set-based approach to feature selection in customer relationship management. Omega 2007 35 4 365 383
3. Zhong N., Dong J. Z., Ohsuga S., Using rough sets with heuristics to feature selection. Journal of Intelligent Information Systems 2001 16 3 199 214 (Pubitemid 32886812)
4. Liu H., Motoda H., Feature Selection for Knowledge Discovery and Data Mining 1998 454 Springer
5. Weiss Y., Elovici Y., Rokach L., The CASH algorithm-cost-sensitive attribute selection using histograms. Information Sciences 2013 222 247 268 10.1016/j.ins.2011.01.035
6. Elkan C., The foundations of cost-sensitive learning. Proceedings of the 7th International Joint Conference on Artificial Intelligence 2001
7. Fan W., Stolfo S., Zhang J., Chan P., Adacost: misclassification cost-sensitive boosting. Proceedings of the 16th International Conference on Machine Learning 1999
8. Hunt E. B., Marin J., Stone P. J., Experiments in Induction 1966 New York, NY, USA Academic Press
9. Pazzani M., Merz C., Ali P. M. K., Hume T., Brunk C., Reducing misclassification costs. Proceedings of the 11th International Conference of Machine Learning (ICML '94) 1994 Morgan Kaufmann
10. Fumera G., Roli F., Cost-sensitive learning in support vector machines. Proceedings of VIII Convegno Associazione Italiana per L' Intelligenza Artificiale 2002
11. Ling C. X., Yang Q., Wang J. N., Zhang S. C., Decision trees with minimal costs. Proceedings of the 21st International Conference on Machine learning 2004
12. Greiner R., Grove A. J., Roth D., Learning cost-sensitive active classifiers. Artificial Intelligence 2002 139 2 137 174 10.1016/S0004-3702(02) 00209-6 MR1930605 (Pubitemid 34802160)
13. Ji S., Carin L., Cost-sensitive feature acquisition and classification. Pattern Recognition 2007 40 1474 1485 10.1016/j.patcog.2006.11.008 (Pubitemid 46123392)
14. Lavrac N., Gamberger D., Turney P., Cost-sensitive feature reduction applied to a hybrid genetic algorithm. Proceedings of the 7th International Workshop on Algorithmic Learning Theory (ALT '96) 1996
15. Min F., He H. P., Qian Y. H., Zhu W., Test-cost-sensitive attribute reduction. Information Sciences 2011 181 4928 4942
16. Susmaga R., Ras Z., Skowron A., Computation of minimal cost reducts. Foundations of Intelligent Systems 1999 1609 Berlin, Germany Springer 448 456 Lecture Notes in Computer Science
17. Min F., Zhu W., Minimal cost attribute reduction through backtracking. 258 Proceedings of the International Conference on Database Theory and Application 2011 CCIS FGIT-DTA/BSBT
18. Min F., Liu Q., A hierarchical model for test-cost-sensitive decision systems. Information Sciences 2009 179 14 2442 2452 10.1016/j.ins.2009.03.007 MR2554690
19. Turney P., Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research 1994 2 1 369 409
20. Margineantu D., Methods for cost-sensitive learning. 2001
21. Norton S., Generating better decision trees. Proceedings of the 11th International Joint Conference on Artificial Intelligence 1989
22. Núñez M., The use of background knowledge in decision tree induction. Machine Learning 1991 6 3 231 250 (Pubitemid 21737707)
23. Tan M., Cost-sensitive learning of classification knowledge and its applications in robotics. Machine Learning 1993 13 1 7 33
24. Johnson N., Kotz S., Continuous Distributions New York, NY, USA John Wiley
25. Johnson R. A., Wichern D. W., Applied Multivariate Statistical Analysis 1992 4 3rd Englewood Cliffs, NJ, USA Prentice Hall MR1168210
26. Min F., Zhu W., Zhao H., Pan G. Y., Liu J. B., Xu Z. L., Coser: cost-senstive rough sets. 2012, http://grc.fjzs.edu.cn/fmin/
27. Yao Y. Y., A partition model of granular computing. Transactions on Rough Sets I 2004 3100 232 253
28. Zhao H., Min F., Zhu W., Test-cost-sensitive attribute reduction of data with normal distribution measurement errors. Mathematical Problems in Engineering 2013 2013 12 10.1155/2013/946070 946070
29. Lin T. Y., Granular computing on binary relations-analysis of conflict and chinese wall security policy. 2475 Proceedings of Rough Sets and Current Trends in Computing 2002 Lecture Notes in Artificial Intelligence
30. Lin T. Y., Granular computing-structures, representations, and applications. Lecture Notes in Artificial Intelligence 2003 2639
31. Ma L., On some types of neighborhood-related covering rough sets. International Journal of Approximate Reasoning 2012 53 6 901 911 10.1016/j.ijar.2012.03.004 MR2930711
32. Zhao H., Min F., Zhu W., Test-cost-sensitive attribute reduction based on neighborhood rough set. Proceedings of the IEEE International Conference on Granular Computing 2011
33. Zhu W., Generalized rough sets based on relations. Information Sciences 2007 177 22 4997 5011 10.1016/j.ins.2007.05.037 MR2362807 (Pubitemid 47331457)
34. Zhu W., Wang F.-Y., Reduction and axiomization of covering generalized rough sets. Information Sciences 2003 152 217 230 10.1016/S0020-0255(03)00056-2 MR1981128
35. Min F., Zhu W., Attribute reduction of data with error ranges and test costs. Information Sciences 2012 211 48 67 10.1016/j.ins.2012.04.031 MR2946900
36. Zhou Z., Liu X., Training cost-sensitive neural networks with methods addressing the class imbalance problem. IEEE Transactions on Knowledge and Data Engineering 2006 18 1 63 77 (Pubitemid 43145089)
37. Zhao H., Min F., Zhu W., A backtracking approach to minimal cost feature selection of numerical data. Journal of Information & Computational Science. In press
38. Kukar M., Kononenko I., Cost-sensitive learning with neural networks. Proceedings of the 13th European Conference on Artificial Intelligence (ECAI '98) 1998 Chichester, UK John Wiley & Sons
39. Lan J., Hu M., Patuwo E., Zhang G., An investigation of neural network classifiers with unequal misclassification costs and group sizes. Decision Support Systems 2010 48 4 582 591
40. Turney P., Types of cost in inductive concept learning. Proceedings of the ICML-2000 Workshop on Cost-Sensitive Learning 2000
41. Viaene S., Dedene G., Cost-sensitive learning and decision making revisited. European Journal of Operational Research 2005 166 1 212 220 (Pubitemid 40219824)
42. Pawlak Z., Rough sets. International Journal of Computer and Information Sciences 1982 11 5 341 356 10.1007/BF01001956 MR703291
43. Błaszczyński J., Greco S., Słowiński R., Szela̧g M., Monotonic variable consistency rough set approaches. International Journal of Approximate Reasoning 2009 50 7 979 999 10.1016/j.ijar.2009.02.011 MR2567157
44. Bonikowski Z., Bryniarski E., Wybraniec-Skardowska U., Extensions and intentions in the rough set theory. Information Sciences 1998 107 1-4 149 167 10.1016/S0020-0255(97)10046-9 MR1629852 (Pubitemid 128383778)
45. Inuiguchi M., Yoshioka Y., Kusunoki Y., Variable-precision dominance-based rough set approach and attribute reduction. International Journal of Approximate Reasoning 2009 50 8 1199 1214 10.1016/j.ijar.2009.02.003 MR2556114
46. Kudo Y., Murai T., Akama S., A granularity-based framework of deduction, induction, and abduction. International Journal of Approximate Reasoning 2009 50 8 1215 1226 10.1016/j.ijar.2009.06.002 MR2556115
47. Pomykała J. A., Approximation operations in approximation space. Bulletin of the Polish Academy of Sciences: Mathematics 1987 35 9-10 653 662 MR937744
48. Yao Y. Y., Constructive and algebraic methods of the theory of rough sets. Information Sciences 1998 109 1-4 21 47 10.1016/S0020-0255(98)00012-7 MR1634596
49. Yao Y. Y., Probabilistic rough set approximations. Journal of Approximate Reasoning 2008 49 2 255 271
50. Zakowski W., Approximations in the space (u, π). Demonstratio Mathematica 1983 16 40 761 769 MR733737
51. Zhu W., Relationship among basic concepts in covering-based rough sets. Information Sciences 2009 179 14 2478 2486 10.1016/j.ins.2009.02.013 MR2554693
52. Zhu W., Wang F., On three types of covering-based rough sets. IEEE Transactions on Knowledge and Data Engineering 2007 19 8 1131 1144
53. Calegari S., Ciucci D., Granular computing applied to ontologies. International Journal of Approximate Reasoning 2010 51 4 391 409
54. Zhu W., Wang F., Covering based granular computing for conflict analysis. Intelligence and Security Informatics 2006 566 571 (Pubitemid 44045608)
55. Wikipedia, http://www.wikipedia.org/
56. Pawlak Z., Rough Sets: Theoretical Aspects of Reasoning about Data 1991 Boston, Mass, USA Kluwer Academic
57. Dash M., Liu H., Feature selection for classification. Intelligent Data Analysis 1997 1 1-4 131 156
58. Wang X., Yang J., Teng X., Xia W., Jensen R., Feature selection based on rough sets and particle swarm optimization. Pattern Recognition Letters 2007 28 4 459 471 (Pubitemid 44920436)
59. Siedlecki W., Sklansky J., A note on genetic algorithms for large-scale feature selection. Pattern Recognition Letters 1989 10 5 335 347
60. Blake C. L., Merz C. J., UCI repository of machine learning databases. 1998, http://www.ics.uci.edu/mlearn/mlrepository.html
61. Liu Q. H., Li F., Min F., Ye M., Yang G. W., An efficient reduction algorithm based on new conditional information entropy Control and Decision 2005 20 8 878 882 (Pubitemid 41293160)
62. Skowron A., Rauszer C., The discernibility matrices and functions in information systems. Intelligent Decision Support 1992
63. Wang G., Attribute core of decision table. 2475 Proceedings of Rough Sets and Current Trends in Computing 2002 Lecture Notes in Computer Science