{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:38:46Z","timestamp":1761597526426},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2014,7,15]],"date-time":"2014-07-15T00:00:00Z","timestamp":1405382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00500-014-1371-0","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T08:24:27Z","timestamp":1405326267000},"page":"1893-1903","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["A new approach to minimum attribute reduction based on discrete artificial bee colony"],"prefix":"10.1007","volume":"19","author":[{"given":"Dongyi","family":"Ye","sequence":"first","affiliation":[]},{"given":"Zhaojiong","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"1371_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.ins.2010.07.015","volume":"192","author":"B Akay","year":"2012","unstructured":"Akay B, Karaboga D (2012) A modified artificial bee colony algorithm for real-parameter optimization. Inf Sci 192:120\u2013142","journal-title":"Inf Sci"},{"issue":"10","key":"1371_CR2","doi-asserted-by":"crossref","first-page":"3142","DOI":"10.1016\/j.cnsns.2009.11.003","volume":"15","author":"R Akbari","year":"2010","unstructured":"Akbari R, Mohammadi A, Ziarati K (2010) A novel bee swarm optimization algorithm for numerical function optimization. Commun Nonlinear Sci Numer Simulat 15(10):3142\u20133155","journal-title":"Commun Nonlinear Sci Numer Simulat"},{"key":"1371_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-33019-4_1","volume":"16","author":"M Banerjee","year":"2006","unstructured":"Banerjee M, Mitra S, Anand A (2006) Feature selection using rough sets. Stud Comput Intell 16:3\u201320","journal-title":"Stud Comput Intell"},{"issue":"2","key":"1371_CR4","doi-asserted-by":"crossref","first-page":"2888","DOI":"10.1016\/j.asoc.2010.11.025","volume":"11","author":"A Banharnsakun","year":"2010","unstructured":"Banharnsakun A, Achalakul T, Sirinaovakul B (2010) The best-so-far selection in artificial bee colony algorithm. Appl Soft Comput 11(2):2888\u20132901","journal-title":"Appl Soft Comput"},{"key":"1371_CR5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun A, Sirinaovakul B, Achalakul T (2012) Job shop scheduling with the best-so-far ABC. Eng Appl Artif Intell 25:583\u2013593","journal-title":"Eng Appl Artif Intell"},{"key":"1371_CR6","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1007\/978-3-319-03753-0_65","volume":"8297","author":"D Basu","year":"2013","unstructured":"Basu D, Debchoudhury S (2013) A novel improved discrete ABC algorithm for manpower scheduling problem in remanufacturing. Lect Notes Comput Sci 8297:738\u2013749","journal-title":"Lect Notes Comput Sci"},{"key":"1371_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-89921-1_9","volume":"174","author":"R Bello","year":"2009","unstructured":"Bello R, Gomez Y, Caballero Y, Nowe A, Falcon R (2009) Rough sets and evolutionary computation to solve the feature selection problem. Stud Comput Intell 174:235\u2013260","journal-title":"Stud Comput Intell"},{"key":"1371_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.epsr.2011.09.022","volume":"84","author":"K Chandrasekarana","year":"2012","unstructured":"Chandrasekarana K, Hemamalinib S, Simona SP, Padhyc NP (2012) Thermal unit commitment using binary\/real coded artificial bee colony algorithm. Electr Power Syst Res 84:109\u2013119","journal-title":"Electr Power Syst Res"},{"issue":"10","key":"1371_CR9","doi-asserted-by":"crossref","first-page":"1367","DOI":"10.1016\/j.cor.2010.12.002","volume":"38","author":"T Davidovic","year":"2011","unstructured":"Davidovic T, Ramljak D, Selmic M, Teodorovic D (2011) Bee colony optimization for the p-center problem. Comput Op Res 38(10):1367\u20131376","journal-title":"Comput Op Res"},{"issue":"4","key":"1371_CR10","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10732-012-9197-3","volume":"18","author":"T Davidovic","year":"2012","unstructured":"Davidovic T, Selmic M, Teodorovic D, Ramljak D (2012) Bee colony optimization for scheduling independent tasks to identical processors. J Heuristics 18(4):549\u2013569","journal-title":"J Heuristics"},{"issue":"1","key":"1371_CR11","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1142\/S012906571000222X","volume":"20","author":"HB Duan","year":"2010","unstructured":"Duan HB, Xu CF, Xing ZH (2010) A hybrid artificial bee colony optimization and quantum evolutionary algorithm for continuous optimization problems. Int J Neural Syst 20(1):39\u201350","journal-title":"Int J Neural Syst"},{"issue":"3","key":"1371_CR12","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.cor.2011.06.007","volume":"39","author":"WF Gao","year":"2012","unstructured":"Gao WF, Liu SF (2012) A modified artificial bee colony algorithm. Comput Op Res 39(3):687\u2013697","journal-title":"Comput Op Res"},{"issue":"17","key":"1371_CR13","doi-asserted-by":"crossref","first-page":"871","DOI":"10.1016\/j.ipl.2011.06.002","volume":"111","author":"WF Gao","year":"2011","unstructured":"Gao WF, Liu SY (2011) Improved artificial bee colony algorithm for global optimization. Inf Process Lett 111(17):871\u2013882","journal-title":"Inf Process Lett"},{"issue":"9","key":"1371_CR14","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1007\/s00500-007-0260-1","volume":"12","author":"AR Hedar","year":"2008","unstructured":"Hedar AR, Wang J, Fukushima M (2008) Tabu search for attribute reduction in rough set theory. Soft Comput 12(9):909\u2013918","journal-title":"Soft Comput"},{"issue":"2","key":"1371_CR15","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1111\/j.1467-8640.1995.tb00035.x","volume":"11","author":"XH Hu","year":"1995","unstructured":"Hu XH, Cercone N (1995) Learning in relational databases: a rough set approach. Comput Intell Int J 11(2):323\u2013338","journal-title":"Comput Intell Int J"},{"issue":"2","key":"1371_CR16","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1111\/j.1467-8640.1995.tb00036.x","volume":"11","author":"J Jelonek","year":"1995","unstructured":"Jelonek J, Krawiec K, Slowinski R (1995) Rough set reduction of attributes and their domains for neural networks. Comput Intell 11(2):339\u2013347","journal-title":"Comput Intell"},{"key":"1371_CR17","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/TKDE.2004.96","volume":"16","author":"R Jensen","year":"2004","unstructured":"Jensen R, Shen Q (2004) Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Trans Knowl Data Eng 16:1457\u20131471","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1371_CR18","unstructured":"Jensen R, Shen Q (2003) Finding rough set reducts with ant colony optimization. In: Proceedings of the UK workshop on computational intelligence, Bristol, UK, pp 15\u201322"},{"key":"1371_CR19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s10462-009-9127-4","volume":"31","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Akay B (2009) A survey: algorithms simulating bee swarm intelligence. Artif Intell Rev 31:61\u201385","journal-title":"Artif Intell Rev"},{"issue":"3","key":"1371_CR20","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/s10898-007-9149-x","volume":"39","author":"D Karaboga","year":"2007","unstructured":"Karaboga D, Basturk B (2007) A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm. J Glob Optim 39(3):459\u2013471","journal-title":"J Glob Optim"},{"issue":"1","key":"1371_CR21","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/j.asoc.2007.05.007","volume":"8","author":"D Karaboga","year":"2008","unstructured":"Karaboga D, Basturk B (2008) On the performance of artificial bee colony (ABC) algorithm. Appl Soft Comput 8(1):687\u2013697","journal-title":"Appl Soft Comput"},{"issue":"1","key":"1371_CR22","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.amc.2009.03.090","volume":"214","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Basturk B (2009) A comparative study of artificial bee colony (ABC) algorithm. Appl Math Comput 214(1):108\u2013132","journal-title":"Appl Math Comput"},{"key":"1371_CR23","doi-asserted-by":"crossref","unstructured":"Karaboga D, Gorkemli B (2011) A combinatorial artificial bee colony algorithm for traveling salesman problem. In: Proceedings of international symposium on innovations in intelligent systems and applications, IEEE Press, Piscataway, pp 50\u201353","DOI":"10.1109\/INISTA.2011.5946125"},{"issue":"1","key":"1371_CR24","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1016\/j.asoc.2009.12.025","volume":"11","author":"D Karaboga","year":"2011","unstructured":"Karaboga D, Ozturk C (2011) A novel clustering approach: artificial bee colony (ABC) algorithm. Appl Soft Comput 11(1):652\u2013657","journal-title":"Appl Soft Comput"},{"issue":"3","key":"1371_CR25","first-page":"279","volume":"19","author":"D Karaboga","year":"2009","unstructured":"Karaboga D, Ozturk C (2009) Neural networks training by artificial bee colony algorithm on pattern classification. Neural Netw World 19(3):279\u2013292","journal-title":"Neural Netw World"},{"key":"1371_CR26","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1016\/j.asoc.2011.08.038","volume":"12","author":"MH Kashan","year":"2012","unstructured":"Kashan MH, Nahavandi N, Kashan AH (2012) DisABC: a new artificial bee colony algorithm for binary optimization. Appl Soft Comput 12:342\u2013352","journal-title":"Appl Soft Comput"},{"key":"1371_CR27","doi-asserted-by":"crossref","first-page":"1351","DOI":"10.1016\/j.patrec.2008.02.006","volume":"29","author":"LJ Ke","year":"2008","unstructured":"Ke LJ, Feng ZR, Ren ZG (2008) An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Lett 29:1351\u20131357","journal-title":"Pattern Recognition Lett"},{"key":"1371_CR28","first-page":"566","volume":"6840","author":"L Li","year":"2012","unstructured":"Li L, Cheng Y, Tan L, Niu B (2012) A discrete artificial bee colony algorithm for TSP problem. Lect Notes Bioinf 6840:566\u2013573","journal-title":"Lect Notes Bioinf"},{"key":"1371_CR29","doi-asserted-by":"crossref","first-page":"2455","DOI":"10.1016\/j.ins.2009.12.025","volume":"181","author":"QK Pan","year":"2011","unstructured":"Pan QK, Tasgetiren MF, Suganthan PN, Chua TJ (2011) A discrete artificial bee colony algorithm for the lot-streaming flow shop scheduling problem. Inf Sci 181:2455\u20132468","journal-title":"Inf Sci"},{"key":"1371_CR30","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/0377-2217(94)90415-4","volume":"72","author":"Z Pawlak","year":"1994","unstructured":"Pawlak Z, Slowinski R (1994) Rough set approach to multi-attribute decision analysis. Eur J Op Res 72:443\u2013459","journal-title":"Eur J Op Res"},{"issue":"2","key":"1371_CR31","first-page":"88","volume":"5","author":"S Sabet","year":"2013","unstructured":"Sabet S, Shokouhifar M, Farokhi F (2013) A discrete artificial bee colony for multiple Knapsack problem. Int J ReasonBased Intell Syst 5(2):88\u201395","journal-title":"Int J ReasonBased Intell Syst"},{"key":"1371_CR32","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/j.asoc.2008.09.001","volume":"9","author":"A Singh","year":"2009","unstructured":"Singh A (2009) An artificial bee colony algorithm for the leaf-constrained minimum spanning tree problem. Appl Soft Comput 9:625\u2013631","journal-title":"Appl Soft Comput"},{"issue":"6","key":"1371_CR33","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1016\/S0167-8655(02)00196-4","volume":"24","author":"RW Swiniarski","year":"2003","unstructured":"Swiniarski RW, Skowron A (2003) Rough set methods in feature selection and recognition. Pattern Recognit Lett 24(6):833\u2013849","journal-title":"Pattern Recognit Lett"},{"key":"1371_CR34","doi-asserted-by":"crossref","first-page":"3459","DOI":"10.1016\/j.ins.2011.04.018","volume":"181","author":"MF Tasgetiren","year":"2011","unstructured":"Tasgetiren MF, Pan QK, Suganthan PN, Chen A (2011) A discrete artificial bee colony algorithm for the total flowtime minimization in permutation flow shops. Inf Sci 181:3459\u20133475","journal-title":"Inf Sci"},{"key":"1371_CR35","first-page":"451","volume":"3641","author":"XY Wang","year":"2005","unstructured":"Wang XY, Yang J, Peng NS, Teng XL (2005) Finding minimal rough set reducts with particle swarm optimization. Lect Notes Artif Intell 3641:451\u2013460","journal-title":"Lect Notes Artif Intell"},{"key":"1371_CR36","doi-asserted-by":"crossref","unstructured":"Wang XY, Yang J, Teng X, Xia W, Jensen R (2007) Feature selection based on rough sets and particle swarm optimization. Pattern Recognit Lett 28:459\u2013471","DOI":"10.1016\/j.patrec.2006.09.003"},{"key":"1371_CR37","first-page":"693","volume":"33","author":"SKM Wong","year":"1985","unstructured":"Wong SKM, Ziarko W (1985) On optimal decision rules in decision tables. Bull Pol Acad Sci 33:693\u2013696","journal-title":"Bull Pol Acad Sci"},{"key":"1371_CR38","unstructured":"Wroblewski J (1995) Finding mininmal reducts using genetic algorithm. In: Proceedings of the second annual joint conference on information sciences, Wrightsville Beach, NC, pp 186\u2013189"},{"key":"1371_CR39","first-page":"1029","volume":"4426","author":"DY Ye","year":"2007","unstructured":"Ye DY, Chen ZJ, Liao JK (2007) A new algorithm for minimum attribute reduction based on binary particle swarm optimization with vaccination. Lect Notes Artif Intell 4426:1029\u20131036","journal-title":"Lect Notes Artif Intell"},{"key":"1371_CR40","first-page":"223","volume":"222","author":"DY Ye","year":"2013","unstructured":"Ye DY, Chen ZJ, Ma SL (2013) A novel and better fitness evaluation for rough set based minimum attribute reduction problem. Inf Sci 222:223\u2013233","journal-title":"Inf Sci"},{"key":"1371_CR41","doi-asserted-by":"crossref","unstructured":"Yu H, Wang GY, Lan FK (2008) Solving the attribute reduction problem with ant colony optimization. In: Proceedings of RSCTC 2008, lecture notes in artificial intelligence 5306, pp 242\u2013251","DOI":"10.1007\/978-3-540-88425-5_25"},{"key":"1371_CR42","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/978-3-642-30976-2_40","volume":"7331","author":"H Zhang","year":"2012","unstructured":"Zhang H, Ye DY (2012) An artificial bee colony algorithm approach for routing in VLSI. Lect Notes Comput Sci 7331:334\u2013341","journal-title":"Lect Notes Comput Sci"},{"key":"1371_CR43","doi-asserted-by":"crossref","first-page":"989","DOI":"10.1002\/int.10128","volume":"18","author":"WX Zhang","year":"2003","unstructured":"Zhang WX, Mi JS, Wu WZ (2003) Approaches to knowledge reductions in inconsistent systems. Int J Intell Syst 18:989\u20131000","journal-title":"Int J Intell Syst"},{"key":"1371_CR44","doi-asserted-by":"crossref","unstructured":"Zhang X, Song P (2010) An attribute reduction algorithm based on clustering and attribute-activity sorting. In: Proceedings of international conference on computational and information sciences, pp 709\u2013712","DOI":"10.1109\/ICCIS.2010.176"},{"issue":"8","key":"1371_CR45","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1007\/s00500-011-0690-7","volume":"15","author":"J Zhou","year":"2011","unstructured":"Zhou J, Miao DQ, Pedrycz W, Zhang HY (2011) Analysis of alternative objective functions for attribute reduction in complete decision tables. Soft Comput 15(8):1601\u20131616","journal-title":"Soft Comput"},{"issue":"7","key":"1371_CR46","doi-asserted-by":"crossref","first-page":"3166","DOI":"10.1016\/j.amc.2010.08.049","volume":"217","author":"GP Zhu","year":"2010","unstructured":"Zhu GP, Kwong S (2010) G-best-guided artificial bee colony algorithm for numerical function optimization. Appl Math Comput 217(7):3166\u20133173","journal-title":"Appl Math Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1371-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-014-1371-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-014-1371-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T19:26:31Z","timestamp":1565637991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-014-1371-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,15]]},"references-count":46,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1371"],"URL":"https:\/\/doi.org\/10.1007\/s00500-014-1371-0","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,15]]}}}