{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T00:09:57Z","timestamp":1760659797528,"version":"build-2065373602"},"reference-count":47,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100007741","name":"University of Hyderabad","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007741","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004541","name":"Ministry of Education, India","doi-asserted-by":"publisher","award":["F11\/9\/2019\\u2212U3(A)"],"award-info":[{"award-number":["F11\/9\/2019\\u2212U3(A)"]}],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Approximate Reasoning"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1016\/j.ijar.2025.109542","type":"journal-article","created":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T15:52:51Z","timestamp":1754495571000},"page":"109542","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Diversity among multiple reducts computation with application to ensemble of classification model"],"prefix":"10.1016","volume":"187","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6233-7122","authenticated-orcid":false,"given":"Abhimanyu","family":"Bar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.Y.","family":"Phani Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.S.V.S.","family":"Sai Prasad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/j.ijar.2025.109542_br0010","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01001956","article-title":"Rough sets","volume":"11","author":"Pawlak","year":"1982","journal-title":"Int. J. Comput. Inf. Sci."},{"key":"10.1016\/j.ijar.2025.109542_br0020","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1016\/j.knosys.2016.04.002","article-title":"Discrete particle swarm optimization approach for cost sensitive attribute reduction","volume":"102","author":"Dai","year":"2016","journal-title":"Knowl.-Based Syst."},{"issue":"2","key":"10.1016\/j.ijar.2025.109542_br0030","first-page":"119","article-title":"Computation of shortest reducts","volume":"23","author":"Susmaga","year":"1998","journal-title":"Found. Comput. Decision Sci."},{"issue":"12","key":"10.1016\/j.ijar.2025.109542_br0040","doi-asserted-by":"crossref","first-page":"3299","DOI":"10.1109\/TSMC.2016.2574538","article-title":"Measuring uncertainty of probabilistic rough set model from its three regions","volume":"47","author":"Zhang","year":"2016","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"1","key":"10.1016\/j.ijar.2025.109542_br0050","doi-asserted-by":"crossref","first-page":"55","DOI":"10.4018\/IJRSDA.2016010104","article-title":"A rough set theory approach for rule generation and validation using rses","volume":"3","author":"Rana","year":"2016","journal-title":"Int. J. Rough Sets Data Anal."},{"issue":"2","key":"10.1016\/j.ijar.2025.109542_br0060","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1504\/IJSN.2013.055939","article-title":"A rough set\u2013based effective rule generation method for classification with an application in intrusion detection","volume":"8","author":"Gogoi","year":"2013","journal-title":"Int. J. Secur. Netw."},{"key":"10.1016\/j.ijar.2025.109542_br0070","article-title":"An efficient and accurate rough set for feature selection, classification, and knowledge representation","author":"Xia","year":"2022","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"6","key":"10.1016\/j.ijar.2025.109542_br0080","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1007\/s10796-014-9496-3","article-title":"Rough set based classification of real world web services","volume":"17","author":"Own","year":"2015","journal-title":"Inf. Syst. Front."},{"issue":"7","key":"10.1016\/j.ijar.2025.109542_br0090","doi-asserted-by":"crossref","first-page":"1438","DOI":"10.1109\/TKDE.2017.2681671","article-title":"Enhancing binary classification by modeling uncertain boundary in three-way decisions","volume":"29","author":"Li","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ijar.2025.109542_br0100","series-title":"The Discernibility Matrices and Functions in Information Systems","first-page":"331","author":"Skowron","year":"1992"},{"key":"10.1016\/j.ijar.2025.109542_br0110","series-title":"Proceedings of ICETIT 2019","first-page":"449","article-title":"Multiple reducts computation in rough sets with applications to ensemble classification","author":"Bar","year":"2020"},{"key":"10.1016\/j.ijar.2025.109542_br0120","series-title":"International Symposium on Methodologies for Intelligent Systems","first-page":"448","article-title":"Computation of minimal cost reducts","author":"Susmaga","year":"1999"},{"key":"10.1016\/j.ijar.2025.109542_br0130","first-page":"1","article-title":"Coarsest granularity-based optimal reduct using a* search","author":"Bar","year":"2022","journal-title":"Granul. Comput."},{"key":"10.1016\/j.ijar.2025.109542_br0140","first-page":"1","article-title":"Approaches for coarsest granularity based near-optimal reduct computation","author":"Bar","year":"2022","journal-title":"Appl. Intell."},{"issue":"2","key":"10.1016\/j.ijar.2025.109542_br0150","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0031-3203(94)00094-3","article-title":"Recognition of handwritten numerals with multiple feature and multistage classifier","volume":"28","author":"Cao","year":"1995","journal-title":"Pattern Recognit."},{"issue":"1","key":"10.1016\/j.ijar.2025.109542_br0160","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.artint.2005.01.007","article-title":"Automatic identification of music performers with learning ensembles","volume":"165","author":"Stamatatos","year":"2005","journal-title":"Artif. Intell."},{"issue":"2","key":"10.1016\/j.ijar.2025.109542_br0170","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1007607513941","article-title":"An experimental comparison of three methods for constructing ensembles of decision trees: bagging, boosting, and randomization","volume":"40","author":"Dietterich","year":"2000","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ijar.2025.109542_br0180","series-title":"International Conference on Pattern Recognition and Image Analysis","first-page":"335","article-title":"Empirical study on weighted voting multiple classifiers","author":"Sun","year":"2005"},{"issue":"1\u20132","key":"10.1016\/j.ijar.2025.109542_br0190","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0004-3702(02)00190-X","article-title":"Ensembling neural networks: many could be better than all","volume":"137","author":"Zhou","year":"2002","journal-title":"Artif. Intell."},{"issue":"1","key":"10.1016\/j.ijar.2025.109542_br0200","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.inffus.2004.04.003","article-title":"Diversity in search strategies for ensemble feature selection","volume":"6","author":"Tsymbal","year":"2005","journal-title":"Inf. Fusion"},{"key":"10.1016\/j.ijar.2025.109542_br0210","series-title":"Proceedings of KDD-97","article-title":"Boosting and na\u0131ve Bayesian learning","author":"Elkan","year":"1997"},{"issue":"12","key":"10.1016\/j.ijar.2025.109542_br0220","doi-asserted-by":"crossref","first-page":"3728","DOI":"10.1016\/j.patcog.2007.04.022","article-title":"Eros: ensemble rough subspaces","volume":"40","author":"Hu","year":"2007","journal-title":"Pattern Recognit."},{"issue":"3","key":"10.1016\/j.ijar.2025.109542_br0230","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1109\/34.667881","article-title":"On combining classifiers","volume":"20","author":"Kittler","year":"1998","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/j.ijar.2025.109542_br0240","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.ins.2015.07.025","article-title":"Diversity techniques improve the performance of the best imbalance learning ensembles","volume":"325","author":"D\u00edez-Pastor","year":"2015","journal-title":"Inf. Sci."},{"issue":"4","key":"10.1016\/j.ijar.2025.109542_br0250","doi-asserted-by":"crossref","first-page":"3115","DOI":"10.1007\/s10462-020-09922-6","article-title":"Ensemble learning based on random super-reduct and resampling","volume":"54","author":"Jiang","year":"2021","journal-title":"Artif. Intell. Rev."},{"issue":"5","key":"10.1016\/j.ijar.2025.109542_br0260","doi-asserted-by":"crossref","first-page":"1638","DOI":"10.1016\/j.patcog.2014.11.001","article-title":"A novel dynamic rough subspace based selective ensemble","volume":"48","author":"Guo","year":"2015","journal-title":"Pattern Recognit."},{"key":"10.1016\/j.ijar.2025.109542_br0270","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1016\/j.knosys.2018.11.034","article-title":"Rough set based semi-supervised feature selection via ensemble selector","volume":"165","author":"Liu","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.ijar.2025.109542_br0280","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.engappai.2018.05.006","article-title":"New diversity measure for data stream classification ensembles","volume":"74","author":"Jackowski","year":"2018","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.ijar.2025.109542_br0290","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1016\/j.ins.2023.01.091","article-title":"An ensemble classifier through rough set reducts for handling data with evidential attributes","volume":"635","author":"Trabelsi","year":"2023","journal-title":"Inf. Sci."},{"year":"2022","author":"Abhimanyu","series-title":"Novel approaches for optimal near optimal reduct and multiple reducts computation","key":"10.1016\/j.ijar.2025.109542_br0300"},{"issue":"4","key":"10.1016\/j.ijar.2025.109542_br0310","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1023\/A:1016304305535","article-title":"Discretization: an enabling technique","volume":"6","author":"Liu","year":"2002","journal-title":"Data Min. Knowl. Discov."},{"issue":"7","key":"10.1016\/j.ijar.2025.109542_br0320","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1016\/j.ins.2008.11.020","article-title":"Discernibility matrix simplification for constructing attribute reducts","volume":"179","author":"Yao","year":"2009","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2025.109542_br0330","series-title":"Rough Computing: Theories, Technologies and Applications","first-page":"70","article-title":"Rough set-based feature selection: a review","author":"Jensen","year":"2008"},{"key":"10.1016\/j.ijar.2025.109542_br0340","series-title":"Transactions on Computational Science II","first-page":"100","article-title":"On reduct construction algorithms","author":"Yao","year":"2008"},{"key":"10.1016\/j.ijar.2025.109542_br0350","series-title":"Rough Sets and Current Trends in Computing","first-page":"450","article-title":"Parallel computation of reducts","author":"Susmaga","year":"1998"},{"key":"10.1016\/j.ijar.2025.109542_br0360","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.patrec.2020.07.004","article-title":"Minreduct: a new algorithm for computing the shortest reducts","volume":"138","author":"Rodr\u00edguez-Diez","year":"2020","journal-title":"Pattern Recognit. Lett."},{"issue":"11","key":"10.1016\/j.ijar.2025.109542_br0370","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1109\/TKDE.2011.89","article-title":"Sample pair selection for attribute reduction with rough set","volume":"24","author":"Chen","year":"2012","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"18","key":"10.1016\/j.ijar.2025.109542_br0380","doi-asserted-by":"crossref","first-page":"14801","DOI":"10.1007\/s00521-020-04833-7","article-title":"Breadth search strategies for finding minimal reducts: towards hardware implementation","volume":"32","author":"Choroma\u0144ski","year":"2020","journal-title":"Neural Comput. Appl."},{"issue":"14","key":"10.1016\/j.ijar.2025.109542_br0390","doi-asserted-by":"crossref","first-page":"5849","DOI":"10.1007\/s00500-018-3249-z","article-title":"An Arabic text categorization approach using term weighting and multiple reducts","volume":"23","author":"Al-Radaideh","year":"2019","journal-title":"Soft Comput."},{"year":"1991","author":"Pawalk","series-title":"Rough Sets: Theoretical Aspects of Reasoning About Data","key":"10.1016\/j.ijar.2025.109542_br0400"},{"key":"10.1016\/j.ijar.2025.109542_br0410","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/j.ins.2014.04.019","article-title":"Parallel attribute reduction algorithms using mapreduce","volume":"279","author":"Qian","year":"2014","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ijar.2025.109542_br0420","series-title":"2012 Federated Conference on Computer Science and Information Systems (FedCSIS)","first-page":"317","article-title":"On elimination of redundant attributes in decision tables","author":"Nguyen","year":"2012"},{"key":"10.1016\/j.ijar.2025.109542_br0430","article-title":"Keel data-mining software tool: data set repository, integration of algorithms and experimental analysis framework","volume":"17","author":"Alcal\u00e1-Fdez","year":"2011","journal-title":"J. Mult.-Valued Log. Soft Comput."},{"author":"Dua","key":"10.1016\/j.ijar.2025.109542_br0440"},{"author":"Arel-Bundock","key":"10.1016\/j.ijar.2025.109542_br0450"},{"issue":"9\u201310","key":"10.1016\/j.ijar.2025.109542_br0460","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1016\/j.artint.2010.04.018","article-title":"Positive approximation: an accelerator for attribute reduction in rough set theory","volume":"174","author":"Qian","year":"2010","journal-title":"Artif. Intell."},{"issue":"7","key":"10.1016\/j.ijar.2025.109542_br0470","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1109\/TKDE.2017.2659740","article-title":"Majority voting and pairing with multiple noisy labeling","volume":"31","author":"Sheng","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["International Journal of Approximate Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X25001835?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0888613X25001835?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T05:18:09Z","timestamp":1760591889000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0888613X25001835"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":47,"alternative-id":["S0888613X25001835"],"URL":"https:\/\/doi.org\/10.1016\/j.ijar.2025.109542","relation":{},"ISSN":["0888-613X"],"issn-type":[{"type":"print","value":"0888-613X"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Diversity among multiple reducts computation with application to ensemble of classification model","name":"articletitle","label":"Article Title"},{"value":"International Journal of Approximate Reasoning","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ijar.2025.109542","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"109542"}}