Semi-greedy heuristics for feature selection with test cost constraints

Granular Computing

Volumn 1, Issue 3, 2016, Pages 199-211

  Min, Fan ^a   Xu, Juan ^a  

^a SOUTHWEST PETROLEUM UNIVERSITY   (China)

Author keywords

Feature selection; Granular computing; Semi greedy; Test cost constraint

Indexed keywords

BUDGET CONTROL; COMBINATORIAL OPTIMIZATION; COSTS; FEATURE EXTRACTION; HEURISTIC ALGORITHMS; ITERATIVE METHODS;

COMBINATORIAL OPTIMIZATION PROBLEMS; COST CONSTRAINTS; DATA COLLECTION; FEATURE SUBSET; FEATURES SELECTION; GREEDY HEURISTICS; REAL-WORLD; SEMI-GREEDY; TEST COST; TEST COST CONSTRAINT;

HEURISTIC METHODS;

EID: 84975104127     PISSN: 23644966     EISSN: 23644974     Source Type: Journal    
DOI: 10.1007/s41066-016-0017-2     Document Type: Article

References (62)

1. Aarts E, Korst J (1988) Simulated annealing and Boltzmann machines: a stochastic approach to combinatorial optimization and neural computing. Wiley, New York
2. Al-Khatib W, Day YF, Ghafoor A, Berra PB (1999) Semantic modeling and knowledge representation in multimedia databases. IEEE Trans Knowl Data Eng 11(1):64–80 DOI: 10.1109/69.755616
3. Bargiela A, Pedrycz W (2012) Granular computing: an introduction. Springer Science and Business Media, Berlin
4. Blake C, Merz CJ (1998) UCI Repository of machine learning databases
5. Boehm O, Hardoon DR, Manevitz LM (2011) Classifying cognitive states of brain activity via one-class neural networks with feature selection by genetic algorithms. Int J Mach Learn Cybern 2(3):125–134 DOI: 10.1007/s13042-011-0030-3
6. Burke EK, Newall JP, Weare RF (1995) A memetic algorithm for university exam timetabling. In: Practice and theory of automated timetabling, pp 241–250. Springer, Berlin
7. Cai JL, Zhu W, Ding HJ, Min F (2014) An improved artificial bee colony algorithm for minimal time cost reduction. Int J Mach Learn Cybern 5(5):743–752 DOI: 10.1007/s13042-013-0219-8
8. Chen DG, Wang CZ, Hu QH (2007) A new approach to attribute reduction of consistent and inconsistent covering decision systems with covering rough sets. Inform Sci 177(17):3500–3518 DOI: 10.1016/j.ins.2007.02.041
9. Fan AJ, Zhao H, Zhu W (2015) Test-cost-sensitive attribute reduction on heterogeneous data for adaptive neighborhood model. Soft Comput 1–12
10. Feo TA, Resende MG (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109–133 DOI: 10.1007/BF01096763
11. Gu SM, Wu WZ (2013) On knowledge acquisition in multi-scale decision systems. Int J Mach Learn Cybern 4(5):477–486 DOI: 10.1007/s13042-012-0115-7
12. Hart JP, Shogan AW (1987) Semi-greedy heuristics: an empirical study. Op Res Lett 6(3):107–114 DOI: 10.1016/0167-6377(87)90021-6
13. He X, Min F, Zhu W (2013) Parametric rough sets with application to granular association rule mining. Math Probl Eng 2013:1–13
14. Hu QH, Xie ZX, Yu DR (2007) Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation. Pattern Recognit 40(12):3509–3521 DOI: 10.1016/j.patcog.2007.03.017
15. Hu QH, Yu DR, Liu JF, Wu CX (2008) Neighborhood rough set based heterogeneous feature subset selection. Inform Sci 178(18):3577–3594 DOI: 10.1016/j.ins.2008.05.024
16. Janusz A, Ślȩzak D (2014) Rough set methods for attribute clustering and selection. Appl Artif Intell 28(3):220–242 DOI: 10.1080/08839514.2014.883902
17. Jensen R, Shen Q (2003) Finding rough set reducts with ant colony optimization. In: Proceedings of the 2003 UK workshop on computational intelligence, vol 1, issue 2
18. Jia XY, Liao WH, Tang ZM, Shang L (2013) Minimum cost attribute reduction in decision-theoretic rough set model. Inform Sci 219:151–167 DOI: 10.1016/j.ins.2012.07.010
19. Kirkpatrick S (1984) Optimization by simulated annealing: quantitative studies. J Statis Phys 34(5–6):975–986 DOI: 10.1007/BF01009452
20. Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1):273–324 DOI: 10.1016/S0004-3702(97)00043-X
21. Li XJ, Zhao H, Zhu W (2014a) An exponent weighted algorithm for minimal cost feature selection. Int J Mach Learn Cybern 1–10
22. Li J, Zhao H, Zhu W (2014b) Fast randomized algorithm with restart strategy for minimal test cost feature selection. Int J Mach Learn Cybern 6(3):435–442 DOI: 10.1007/s13042-014-0262-0
23. Lin TY (1998) Granular computing on binary relations I: data mining and neighborhood systems. Rough Sets Knowl Discov 1:107–121
24. Lin TY, Cercone N (1996) Rough sets and data mining: analysis of imprecise data. Kluwer Academic Publishers, Dordrecht DOI: 10.1007/978-1-4613-1461-5
25. Liu JB, Min F, Zhao H, Zhu W (2014) Feature selection with positive region constraint for test-cost-sensitive data. Trans Rough Sets XVIII:23–33
26. Min F, He HP, Qian Y, Zhu W (2011) Test-cost-sensitive attribute reduction. Inform Sci 181(22):4928–4942 DOI: 10.1016/j.ins.2011.07.010
27. Min F, Hu QH, Zhu W (2014) Feature selection with test cost constraint. Int J Approx Reason 55(1):167–179 DOI: 10.1016/j.ijar.2013.04.003
28. Min F, Liu QH (2009) A hierarchical model for test-cost-sensitive decision systems. Inform Sci 179(14):2442–2452 DOI: 10.1016/j.ins.2009.03.007
29. Min F, Zhu W (2011) Optimal sub-reducts with test cost constraint. Rough Sets Knowl Technol 57–62
30. Modrzejewski M (1993) Feature selection using rough sets theory. In: Machine learning: ECML-93, pp 213–226. Springer, Berlin
31. Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Courier Dover Publications, USA
32. Pawlak Z (1982a) Rough sets. Int J Comput Inform Sci 11:341–356 DOI: 10.1007/BF01001956
33. Pawlak Z (1982b) Rough sets. Int J Comput Inform Sci 11(5):341–356 DOI: 10.1007/BF01001956
34. Pedrycz W (2001) Granular computing: an emerging paradigm, vol 70. Springer Science and Business Media, Berlin DOI: 10.1007/978-3-7908-1823-9
35. Pedrycz W (2013) Granular computing: analysis and design of intelligent systems. CRC press, Boca Raton DOI: 10.1201/b14862
36. Qian YH, Liang JY, Pedrycz W, Dang CY (2010) Positive approximation: an accelerator for attribute reduction in rough set theory. Artif Intell 174(9–10):597–618 DOI: 10.1016/j.artint.2010.04.018
37. Qian J, Miao DQ, Zhang ZH, Yue XD (2014) Parallel attribute reduction algorithms using mapreduce. Inform Sci 279:671–690 DOI: 10.1016/j.ins.2014.04.019
38. Qin YX, Zheng DQ, Zhao TJ (2012) Research on search results optimization technology with category features integration. Int J Mach Learn Cybern 3(1):71–76 DOI: 10.1007/s13042-011-0037-9
39. Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. Intell Decis Support 331–362
40. Ślȩzak D (2002) Approximate entropy reducts. Fundamenta informaticae 53(3–4):365–390
41. Ślȩzak D, Wróblewski J (2003) Order based genetic algorithms for the search of approximate entropy reducts. In: Rough sets, fuzzy sets, data mining, and granular computing, pp 308–311. Springer, Berlin
42. Słowiński R (1992) Intelligent decision support: handbook of applications and advances of the rough sets theory, vol 11. Springer Science and Business Media, Berlin
43. Turney PD (1995) Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. J Artif Intell Res 2:369–409
44. Turney PD (2000) Types of cost in inductive concept learning. Proceedings of the workshop on cost-sensitive learning at the 17th ICML, pp 1–7
45. Wang GY, Zhang QH (2009) Granular computing based cognitive computing. In: 8th IEEE international conference on cognitive informatics, IEEE, pp 155–161
46. Wang GY, Yu H, Yang DC (2002a) Decision table reduction based on conditional information entropy. Chin J Comput 2(7):759–766
47. Wang GY, Yu H, Yang DC (2002b) Decision table reduction based on conditional information entropy. Chin J Comput 25(7):759–766
48. Wang XZ, Zhai JH, Lu SX (2008) Induction of multiple fuzzy decision trees based on rough set technique. Inform Sci 178(16):3188–3202 DOI: 10.1016/j.ins.2008.03.021
49. Wei P, Ma PJ, Hu QH, Su XH, Ma CQ (2014) Comparative analysis on margin based feature selection algorithms. Int J Mach Learn Cybern 5(3):339–367 DOI: 10.1007/s13042-013-0164-6
50. Wu WZ, Leung Y (2011) Theory and applications of granular labelled partitions in multi-scale decision tables. Inform Sci 181(18):3878–3897 DOI: 10.1016/j.ins.2011.04.047
51. Yang XB, Qi YS, Song XN, Yang JY (2013) Test cost sensitive multigranulation rough set: model and minimal cost selection. Inform Sci 250:184–199 DOI: 10.1016/j.ins.2013.06.057
52. Yao YY (2000) Granular computing: basic issues and possible solutions. In: Proceedings of the 5th joint conference on information sciences, vol 1, pp 186–189
53. Yao YY (2004) A partition model of granular computing. In: Transactions on rough sets I, pp 232–253. Springer, Berlin
54. Yao YY, Zhao Y, Wang J (2006) On reduct construction algorithms. In: Rough sets and knowledge technology, pp 297–304. Springer, Berlin
55. Yao JT, Vasilakos AV, Pedrycz W (2013) Granular computing: perspectives and challenges. IEEE Trans Syst Man Cybern Part C Appl Rev 43(6):1977–1989
56. Yao YY, Zhao Y (2008) Attribute reduction in decision-theoretic rough set models. Inform Sci 178(17):3356–3373 DOI: 10.1016/j.ins.2008.05.010
57. Zhai JH, Zhai MY, Bai CY (2013) An improved algorithm for calculating fuzzy attribute reducts. J Intell Fuzzy Syst Appl Eng Technol 25(2):303–313
58. Zhang WX, Wei L, Qi JJ (2005) Attribute reduction in concept lattice based on discernibility matrix. In: Rough sets, fuzzy sets, data mining, and granular computing, pp 157–165. Springer, Berlin
59. Zhang X, Zhou B, Li P (2012) A general frame for intuitionistic fuzzy rough sets. Inform Sci 216:34–49 DOI: 10.1016/j.ins.2012.04.018
60. Zhao H, Min F, Zhu W (2013) Test-cost-sensitive attribute reduction of data with normal distribution measurement errors. Math Probl Eng 2013:1–12
61. Zhao H, Zhu W (2014) Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl Based Syst 65:72–82 DOI: 10.1016/j.knosys.2014.04.009
62. Zhu W, Wang F (2003) Reduction and axiomization of covering generalized rough sets. Inform Sci 152(1):217–230 DOI: 10.1016/S0020-0255(03)00056-2