{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:21:47Z","timestamp":1762323707129},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,5,14]],"date-time":"2014-05-14T00:00:00Z","timestamp":1400025600000},"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":["Int. J. Mach. Learn. & Cyber."],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s13042-014-0262-0","type":"journal-article","created":{"date-parts":[[2014,5,13]],"date-time":"2014-05-13T16:54:26Z","timestamp":1400000066000},"page":"435-442","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fast randomized algorithm with restart strategy for minimal test cost feature selection"],"prefix":"10.1007","volume":"6","author":[{"given":"Jingkuan","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,5,14]]},"reference":[{"key":"262_CR1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","volume":"11","author":"Z Pawlak","year":"1982","unstructured":"Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11:341\u2013356","journal-title":"Int J Comput Inf Sci"},{"key":"262_CR2","first-page":"1","volume":"2013","author":"H Zhao","year":"2013","unstructured":"Zhao H, Min F, Zhu W (2013) Test-cost-sensitive attribute reduction of data with normal distribution measurement errors. Math Probl Eng 2013:1\u201312","journal-title":"Math Probl Eng"},{"key":"262_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.ijar.2004.11.004","volume":"40","author":"D \u015al\u0229zak","year":"2006","unstructured":"\u015al\u0119zak D, Ziarko W (2006) The investigation of the bayesian rough set model. Int J Approx Reason 40:81\u201391","journal-title":"Int J Approx Reason"},{"issue":"1","key":"262_CR4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TCYB.2013.2245891","volume":"44","author":"XZ Wang","year":"2014","unstructured":"Wang XZ, He YL, Wang DD (2014) Non-naive bayesian classifiers for classification problems with continuous attributes. IEEE Trans Cybern 44(1):21\u201339","journal-title":"IEEE Trans Cybern"},{"key":"262_CR5","unstructured":"Nakamatsu K, Abe JM, Suzuki A (2000) Annotated semantics for defeasible deontic reasoning. In: Proceedings of rough sets and current trends in computing. Volume 2005 of LNCS. pp 470\u2013478"},{"key":"262_CR6","unstructured":"Nguyen HS (2000) On efficient construction of decision trees from large databases. In: Proceedings of rough sets and current trends in computing. Volume 2005 of LNCS. 354\u2013361"},{"issue":"8","key":"262_CR7","doi-asserted-by":"crossref","first-page":"1491","DOI":"10.1109\/TKDE.2011.67","volume":"24","author":"X Wang","year":"2012","unstructured":"Wang XZ, Dong LC, Yan JH (2012) Maximum ambiguity-based sample selection in fuzzy decision tree induction. Knowl Data Eng IEEE Trans 24(8):1491\u20131505","journal-title":"Knowl Data Eng IEEE Trans"},{"issue":"2","key":"262_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s13042-013-0156-6","volume":"5","author":"ZX Xie","year":"2014","unstructured":"Xie ZX, Xu Y (2014) Sparse group lasso based uncertain feature selection. Int J Mach Learn Cybern 5(2):201\u2013210","journal-title":"Int J Mach Learn Cybern"},{"key":"262_CR9","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s13042-012-0092-x","volume":"4","author":"T R\u00fcckstie\u00df","year":"2013","unstructured":"R\u00fcckstie\u00df T, Osendorfer C, van der Smagt P (2013) Minimizing data consumption with sequential online feature selection. Int J Mach Learn Cybern 4:235\u2013243","journal-title":"IInt J Mach Learn Cybern"},{"key":"262_CR10","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s13042-012-0121-9","volume":"4","author":"N Subrahmanya","year":"2013","unstructured":"Subrahmanya N, Shin YC (2013) A variational bayesian framework for group feature selection. Int J Mach Learn Cybern 4:609\u2013619","journal-title":"Int J Mach Learn Cybern"},{"key":"262_CR11","doi-asserted-by":"crossref","first-page":"4928","DOI":"10.1016\/j.ins.2011.07.010","volume":"181","author":"F Min","year":"2011","unstructured":"Min F, He H, Qian Y, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181:4928\u20134942","journal-title":"Inf Sci"},{"key":"262_CR12","doi-asserted-by":"crossref","unstructured":"Pan GY, Min F, Zhu W (2011) A genetic algorithm to the minimal test cost reduct problem. In: Proceedings of IEEE international conference on granular computing pp 539\u2013544","DOI":"10.1109\/GRC.2011.6122654"},{"key":"262_CR13","doi-asserted-by":"crossref","first-page":"1226","DOI":"10.1109\/TPAMI.2005.159","volume":"27","author":"HC Peng","year":"2005","unstructured":"Peng HC, Long FH, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. Pattern Anal Mach Intell IEEE Trans 27:1226\u20131238","journal-title":"Pattern Anal Mach Intell IEEE Trans"},{"key":"262_CR14","first-page":"1205","volume":"5","author":"L Yu","year":"2004","unstructured":"Yu L, Liu H (2004) Efficient feature selection via analysis of relevance and redundancy. J Mach Learni Res 5:1205\u20131224","journal-title":"J Mach Learni Res"},{"issue":"02","key":"262_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"AIA Itaia","year":"1986","unstructured":"Itaia AIA (1986) A fast and simple randomized parallel algorithm for maximal matching. Inf Proc Lett 22(02):77\u201380","journal-title":"Inf Proc Lett"},{"key":"262_CR16","first-page":"12","volume":"2013","author":"JK Li","year":"2013","unstructured":"Li JK, Min F, Zhu W (2013) Fast randomized algorithm for minimal test cost attribute reduction. Proc ICRITO. 2013:12\u201317","journal-title":"Proc ICRITO"},{"issue":"06","key":"262_CR17","first-page":"542","volume":"11","author":"AR Karlin","year":"1994","unstructured":"Karlin AR, Manasse MS, McGeoch LA, Owicki S (1994) Competitive randomized algorithms for nonuniform problems. Comput Sci 11(06):542\u2013571","journal-title":"Comput Sci"},{"key":"262_CR18","first-page":"514","volume":"5","author":"G Chen","year":"2002","unstructured":"Chen G, Xie X, Xu Y, Gu J (2002) Designing restart strategy for randomized algorithms and its application in solving the tsp. Chin J Comput 5:514\u2013519","journal-title":"Chin J Comput"},{"key":"262_CR19","unstructured":"Hoos HH (1998) Stochastic local search-methods, models, applications IOS"},{"key":"262_CR20","unstructured":"Hogg T, Williams CP (1994) Expected gains from parallelizing constraint solving for hard problems. In AAAI, CP, pp 331\u2013336"},{"key":"262_CR21","unstructured":"Blake CL, Merz CJ (1998) UCI repository of machine learning databases"},{"key":"262_CR22","doi-asserted-by":"crossref","unstructured":"Min F, Zhu W (2012) Attribute reduction of data with error ranges and test costs. Inf Sci 211:48\u201367","DOI":"10.1016\/j.ins.2012.04.031"},{"key":"262_CR23","doi-asserted-by":"crossref","unstructured":"He HP, Min F (2011) 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. Volume 6743 of LNAI, 244\u2013247","DOI":"10.1007\/978-3-642-21881-1_39"},{"key":"262_CR24","first-page":"1","volume":"2013","author":"H Zhao","year":"2013","unstructured":"Zhao H, Min F, Zhu W (2013) Cost-sensitive feature selection of numeric data with measurement errors. J Appl Math 2013:1\u201313","journal-title":"J Appl Math"},{"issue":"1-2","key":"262_CR25","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/j.ijar.2013.04.003","volume":"55","author":"F Min","year":"2014","unstructured":"Min F, Hu QH, Zhu W (2014) Feature selection with test cost constraint. Int J Approx Reason 55(1\u20132):167\u2013179","journal-title":"Int J Approx Reason"},{"issue":"1","key":"262_CR26","first-page":"12","volume":"26","author":"WX Zhang","year":"2003","unstructured":"Zhang WX, Mi JS, Wu WZ (2003) Knowledge reductions in inconsistent information systems. Chin J Comput Chin Edn 26(1):12\u201318","journal-title":"Chin J Comput Chin Edn"},{"issue":"12","key":"262_CR27","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. Knowl Data Eng IEEE Trans 16(12):1457\u20131471","journal-title":"Knowl Data Eng IEEE Trans"},{"key":"262_CR28","doi-asserted-by":"crossref","first-page":"3356","DOI":"10.1016\/j.ins.2008.05.010","volume":"178","author":"YY Yao","year":"2008","unstructured":"Yao YY, Zhao Y (2008) Attribute reduction in decision-theoretic rough set models. Inf Sci 178:3356\u20133373","journal-title":"Inf Sci"},{"key":"262_CR29","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized algorithms","author":"R Motwani","year":"1995","unstructured":"Motwani R (1995) Randomized algorithms. Cambridge university press, Cambridge"},{"key":"262_CR30","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/3-540-45365-2_22","volume-title":"Applications of evolutionary computing","author":"M Guntsch","year":"2001","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic tsp. In: Applications of evolutionary computing. Springer, New York 213\u2013222"},{"issue":"4","key":"262_CR31","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M Luby","year":"1993","unstructured":"Luby M, Sinclair A, Zuckerman D (1993) Optimal speedup of las vegas algorithms. Inf Proc Lett 47(4):173\u2013180","journal-title":"Inf Proc Lett"}],"container-title":["International Journal of Machine Learning and Cybernetics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0262-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13042-014-0262-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13042-014-0262-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T14:31:15Z","timestamp":1559485875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s13042-014-0262-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,14]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["262"],"URL":"https:\/\/doi.org\/10.1007\/s13042-014-0262-0","relation":{},"ISSN":["1868-8071","1868-808X"],"issn-type":[{"value":"1868-8071","type":"print"},{"value":"1868-808X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,14]]}}}