{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:53:40Z","timestamp":1777704820846,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,6,21]]},"abstract":"<jats:p>Intelligent optimization algorithm combined with rough set theory to solve minimum attribute reduction (MAR) is time consuming due to repeated evaluations of the same position. The algorithm also finds in poor solution quality because individuals are not fully explored in space. This study proposed an algorithm based on quick extraction and multi-strategy social spider optimization (QSSOAR). First, a similarity constraint strategy was called to constrain the initial state of the population. In the iterative process, an adaptive opposition-based learning (AOBL) was used to enlarge the search space. To obtain a reduction with fewer attributes, the dynamic redundancy detection (DRD) strategy was applied to remove redundant attributes in the reduction result. Furthermore, the quick extraction strategy was introduced to avoid multiple repeated computations in this paper. By combining an array with key-value pairs, the corresponding value can be obtained by simple comparison. The proposed algorithm and four representative algorithms were compared on nine UCI datasets. The results show that the proposed algorithm performs well in reduction ability, running time, and convergence speed. Meanwhile, the results confirm the superiority of the algorithm in solving MAR.<\/jats:p>","DOI":"10.3233\/jifs-210133","type":"journal-article","created":{"date-parts":[[2021,5,18]],"date-time":"2021-05-18T13:41:54Z","timestamp":1621345314000},"page":"12023-12038","source":"Crossref","is-referenced-by-count":6,"title":["Minimum attribute reduction algorithm based on quick extraction and multi-strategy social spider optimization"],"prefix":"10.1177","volume":"40","author":[{"given":"Qianjin","family":"Wei","sequence":"first","affiliation":[{"name":"Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, China"}]},{"given":"Chengxian","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Information Security, Guilin University of Electronic Technology, Guilin, China"}]},{"given":"Yimin","family":"Wen","sequence":"additional","affiliation":[{"name":"Guangxi Key Laboratory of Trusted Software, Guilin University of Electronic Technology, Guilin, China"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-210133_ref1","doi-asserted-by":"crossref","first-page":"2441","DOI":"10.1007\/s00521-016-2804-8","article-title":"An improved social spider optimization algorithm based on rough sets for solving minimum number attribute reduction problem","volume":"30","author":"Abd El Aziz","year":"2018","journal-title":"Neural Computing and Applications"},{"key":"10.3233\/JIFS-210133_ref2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.knosys.2015.02.002","article-title":"Finding rough set reducts with fish swarm algorithm","volume":"81","author":"Chen","year":"2015","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-210133_ref3","doi-asserted-by":"crossref","first-page":"6374","DOI":"10.1016\/j.eswa.2013.05.041","article-title":"A swarm optimization algorithm inspired in the behavior of the social-spider","volume":"40","author":"Cuevas","year":"2013","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-210133_ref4","doi-asserted-by":"crossref","first-page":"105945","DOI":"10.1016\/j.knosys.2020.105945","article-title":"Multigranulation consensus fuzzy-rough based attribute reduction","volume":"198","author":"Ding","year":"2020","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-210133_ref5","doi-asserted-by":"crossref","first-page":"13547","DOI":"10.1007\/s00500-019-03891-x","article-title":"An opposition-based social spider optimization for feature selection","volume":"23","author":"Ibrahim","year":"2019","journal-title":"Soft Computing"},{"key":"10.3233\/JIFS-210133_ref6","doi-asserted-by":"crossref","first-page":"1457","DOI":"10.1109\/TKDE.2004.96","article-title":"Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches","volume":"16","author":"Jensen","year":"2004","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.3233\/JIFS-210133_ref7","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.ins.2018.07.001","article-title":"An incremental attribute reduction method for dynamic data mining","volume":"465","author":"Jing","year":"2018","journal-title":"Information Sciences"},{"key":"10.3233\/JIFS-210133_ref10","first-page":"681","article-title":"A heuristic algorithm for reduction of knowledge","volume":"36","author":"Miao","year":"1999","journal-title":"Journal of computer research and development"},{"key":"10.3233\/JIFS-210133_ref11","first-page":"113","article-title":"An information representation of the concepts and operations in rough set theory","volume":"10","author":"Miao","year":"1999","journal-title":"Journal of Software"},{"key":"10.3233\/JIFS-210133_ref12","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/j.jocs.2017.05.007","article-title":"Ant colony optimization with partial-complete searching for attribute reduction","volume":"25","author":"Min","year":"2018","journal-title":"Journal of Computational Science"},{"key":"10.3233\/JIFS-210133_ref13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"International Journal of Computer & Information Sciences"},{"key":"10.3233\/JIFS-210133_ref14","doi-asserted-by":"crossref","first-page":"113084","DOI":"10.1016\/j.eswa.2019.113084","article-title":"Rough set based lattice structure for knowledge representation in medical expert systems: Low back pain management case study","volume":"145","author":"Santra","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-210133_ref15","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1111\/coin.12301","article-title":"Integrated kitchen design and optimization based on the improved particle swarm intelligent algorithm","volume":"36","author":"Sun","year":"2020","journal-title":"Computational Intelligence"},{"key":"10.3233\/JIFS-210133_ref16","doi-asserted-by":"crossref","first-page":"2415","DOI":"10.3233\/JIFS-179530","article-title":"Swarm intelligence and ant colony optimization in accounting model choices","volume":"38","author":"Tang","year":"2020","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"10.3233\/JIFS-210133_ref17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.3233\/FI-2015-1284","article-title":"Applications of fuzzy rough set theory in machine learning: A survey","volume":"142","author":"Vluymans","year":"2015","journal-title":"Fundamenta Informaticae"},{"key":"10.3233\/JIFS-210133_ref18","first-page":"44","article-title":"Feature selection method based on rough sets and improved whale optimization algorithm","volume":"47","author":"Wang","year":"2020","journal-title":"Computer Science"},{"key":"10.3233\/JIFS-210133_ref19","doi-asserted-by":"crossref","first-page":"1521","DOI":"10.1049\/joe.2018.8310","article-title":"Multi-objective social spider optimisation algorithm","volume":"2018","author":"Wang","year":"2018","journal-title":"The Journal of Engineering"},{"key":"10.3233\/JIFS-210133_ref22","first-page":"2695","article-title":"An attribute reduction algorithm based on mutual information of particle swarm optimization","volume":"45","author":"Xu","year":"2017","journal-title":"Acta Electronica Sinica"},{"key":"10.3233\/JIFS-210133_ref24","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.procs.2016.08.083","article-title":"An innovative approach for attribute reduction using rough sets and flower pollination optimisation","volume":"96","author":"Yamany","year":"2016","journal-title":"Procedia Computer Science"},{"key":"10.3233\/JIFS-210133_ref25","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s11042-020-09736-2","article-title":"Modified whale optimization algorithm for underwater image matching in a UUV vision system","volume":"80","author":"Yan","year":"2021","journal-title":"Multimedia Tools and Applications"},{"key":"10.3233\/JIFS-210133_ref27","doi-asserted-by":"crossref","first-page":"9","DOI":"10.3390\/a10010009","article-title":"Elite opposition-based social spider optimization algorithm for global function optimization","volume":"10","author":"Zhao","year":"2017","journal-title":"Algorithms"},{"key":"10.3233\/JIFS-210133_ref28","doi-asserted-by":"crossref","first-page":"3717","DOI":"10.3233\/JIFS-179594","article-title":"Data mining method based on rough set and fuzzy neural network","volume":"38","author":"Zhou","year":"2020","journal-title":"Journal of Intelligent & Fuzzy Systems"},{"key":"10.3233\/JIFS-210133_ref29","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.engappai.2017.06.004","article-title":"A simplex method-based social spider optimization algorithm for clustering analysis","volume":"64","author":"Zhou","year":"2017","journal-title":"Engineering Applications of Artificial Intelligence"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:06Z","timestamp":1777455726000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210133"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":23,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210133","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]}}}