{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T18:00:52Z","timestamp":1782237652768,"version":"3.54.5"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:00:00Z","timestamp":1665014400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T00:00:00Z","timestamp":1665014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10489-022-04144-5","type":"journal-article","created":{"date-parts":[[2022,10,6]],"date-time":"2022-10-06T01:02:46Z","timestamp":1665018166000},"page":"13082-13109","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Rough set approximations based on a matroidal structure over three sets"],"prefix":"10.1007","volume":"53","author":[{"given":"Gang","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hua","family":"Mao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chang","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhiming","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lanzhen","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,6]]},"reference":[{"key":"4144_CR1","doi-asserted-by":"publisher","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\u201356. https:\/\/doi.org\/10.1007\/BF01001956","journal-title":"Int J Comput Inf Sci"},{"key":"4144_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-3534-4","volume-title":"Rough Sets: Theoretical Aspects of Reasoning About Data","author":"Pawlak Z","year":"1991","unstructured":"Pawlak Z (1991) Rough Sets: Theoretical Aspects of Reasoning About Data. Netherlands: Kluwer Academic Publishers, Dordrecht. https:\/\/doi.org\/10.1007\/978-94-011-3534-4"},{"key":"4144_CR3","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00500-021-06426-5","volume":"26","author":"M Atef","year":"2022","unstructured":"Atef M, Khalil AM, Li SF, Azzam A, Liu H, Atik AEFE (2022) Comparison of twelve types of rough approximations based on j-neighborhood space and j-adhesion neighborhood space. Soft Computing. 26:215\u201336. https:\/\/doi.org\/10.1007\/s00500-021-06426-5https:\/\/doi.org\/10.1007\/s00500-021-06426-5","journal-title":"Soft Computing."},{"key":"4144_CR4","doi-asserted-by":"publisher","first-page":"855","DOI":"10.1007\/s11047-018-9700-3","volume":"17","author":"A Skowron","year":"2018","unstructured":"Skowron A, Dutta S (2018) Rough sets:past, present, and future. Natural Computing. 17:855\u201376. https:\/\/doi.org\/10.1007\/s11047-018-9700-3https:\/\/doi.org\/10.1007\/s11047-018-9700-3","journal-title":"Natural Computing."},{"key":"4144_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0020-0255(98)00012-7","volume":"109","author":"YY Yao","year":"1998","unstructured":"Yao YY (1998) Constructive and algebraic methods of the theory of rough sets. Information Sciences. 109:21\u201347. https:\/\/doi.org\/10.1016\/S0020-0255(98)00012-7","journal-title":"Information Sciences."},{"issue":"1-4","key":"4144_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0020-0255(98)10006-3","volume":"111","author":"YY Yao","year":"1998","unstructured":"Yao YY (1998) Relational interpretations of neighborhood operators and rough set approximation operators. Inf Sci 111(1-4):239\u201359. https:\/\/doi.org\/10.1016\/S0020-0255(98)10006-3","journal-title":"Inf Sci"},{"key":"4144_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ijar.2019.11.002","volume":"116","author":"YY Yao","year":"2020","unstructured":"Yao YY (2020) Three-way granular computing, rough sets, and formal concept analysis. Int J Approx Reason 116:106\u201325. https:\/\/doi.org\/10.1016\/j.ijar.2019.11.002","journal-title":"Int J Approx Reason"},{"key":"4144_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.ins.2012.10.018","volume":"225","author":"YL Zhang","year":"2013","unstructured":"Zhang YL, Luo MK (2013) Relationships between covering-based rough sets and relation-based rough sets. Inf Sci 225:55\u201371. https:\/\/doi.org\/10.1016\/j.ins.2012.10.018","journal-title":"Inf Sci"},{"key":"4144_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ijar.2021.08.003","volume":"138","author":"GL Liu","year":"2021","unstructured":"Liu GL (2021) Rough set approaches in knowledge structures. Int J Approx Reason 138:78\u201388. https:\/\/doi.org\/10.1016\/j.ijar.2021.08.003https:\/\/doi.org\/10.1016\/j.ijar.2021.08.003","journal-title":"Int J Approx Reason"},{"key":"4144_CR10","doi-asserted-by":"publisher","first-page":"6727","DOI":"10.1007\/s00500-018-3616-9","volume":"23","author":"ZH Wang","year":"2019","unstructured":"Wang ZH, Wang H, Feng QR (2019) The structures and the connections on four types of covering rough sets. Soft Comput 23:6727\u201341. https:\/\/doi.org\/10.1007\/s00500-018-3616-9","journal-title":"Soft Comput"},{"key":"4144_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2012.02.065","volume":"200","author":"YY Yao","year":"2012","unstructured":"Yao YY, Yao BX (2012) Covering based rough set approximations. Inf Sci 200:91\u2013107. https:\/\/doi.org\/10.1016\/j.ins.2012.02.065https:\/\/doi.org\/10.1016\/j.ins.2012.02.065","journal-title":"Inf Sci"},{"key":"4144_CR12","doi-asserted-by":"publisher","first-page":"3965","DOI":"10.1007\/s00500-018-3321-8","volume":"23","author":"YL Zhang","year":"2019","unstructured":"Zhang YL, Li CQ, Li JJ (2019) On characterizations of a pair of covering-based approximation operators. Soft Comput 23:3965\u201372. https:\/\/doi.org\/10.1007\/s00500-018-3321-8","journal-title":"Soft Comput"},{"key":"4144_CR13","doi-asserted-by":"publisher","first-page":"7557","DOI":"10.1007\/s00500-018-03749-8","volume":"23","author":"XN Li","year":"2019","unstructured":"Li XN, Yi HJ, Wang ZH (2019) Approximation via a double-matroid structure. Soft Comput 23:7557\u201368. https:\/\/doi.org\/10.1007\/s00500-018-03749-8https:\/\/doi.org\/10.1007\/s00500-018-03749-8","journal-title":"Soft Comput"},{"key":"4144_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ins.2016.01.029","volume":"342","author":"XN Li","year":"2016","unstructured":"Li XN, Yi HJ, Liu SY (2016) Rough sets and matroids from a lattice-theoretic viewpoint. Inf Sci 342:37\u201352. https:\/\/doi.org\/10.1016\/j.ins.2016.01.029https:\/\/doi.org\/10.1016\/j.ins.2016.01.029","journal-title":"Inf Sci"},{"key":"4144_CR15","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s13042-014-0314-5","volume":"8","author":"LR Su","year":"2017","unstructured":"Su LR, Zhu W (2017) Closed-set lattice and modular matroid induced by covering-based rough sets. Int J Mach Learn Cybern 8:191\u2013201. https:\/\/doi.org\/10.1007\/s13042-014-0314-5","journal-title":"Int J Mach Learn Cybern"},{"key":"4144_CR16","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.tcs.2021.06.037","volume":"893","author":"LR Su","year":"2021","unstructured":"Su LR, Yu FS (2021) Matrix approach to spanning matroids of rough sets and its application to attribute reduction. Theor Comput Sci 893:105\u201316. https:\/\/doi.org\/10.1016\/j.tcs.2021.06.037","journal-title":"Theor Comput Sci"},{"key":"4144_CR17","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/j.ins.2019.02.034","volume":"485","author":"ZH Wang","year":"2019","unstructured":"Wang ZH, Feng QR, Wang H (2019) The lattice and matroid representations of definable sets in generalized rough sets based on relations. Inf Sci 485:505\u201320. https:\/\/doi.org\/10.1016\/j.ins.2019.02.034https:\/\/doi.org\/10.1016\/j.ins.2019.02.034","journal-title":"Inf Sci"},{"key":"4144_CR18","doi-asserted-by":"publisher","first-page":"141","DOI":"10.3233\/FI-2017-1601","volume":"156","author":"E Bartl","year":"2017","unstructured":"Bartl E, Konecny J (2017) Rough fuzzy concept analysis. Fundam Inform 156:141\u201368. https:\/\/doi.org\/10.3233\/fi-2017-1601","journal-title":"Fundam Inform"},{"key":"4144_CR19","doi-asserted-by":"publisher","first-page":"6085","DOI":"10.1007\/s00500-020-04744-8","volume":"24","author":"LQ Li","year":"2020","unstructured":"Li LQ, Jin Q, Yao BX, Wu JC (2020) A rough set model based on fuzzifying neighborhood systems. Soft Comput 24:6085\u201399. https:\/\/doi.org\/10.1007\/s00500-020-04744-8","journal-title":"Soft Comput"},{"key":"4144_CR20","doi-asserted-by":"publisher","first-page":"105269","DOI":"10.1016\/j.knosys.2019.105269","volume":"191","author":"MW Shao","year":"2020","unstructured":"Shao MW, Wu WZ, Wang XZ, Wang CZ (2020) knowledge reduction methods of covering approximate spaces based on concept lattice. Knowl-Based Syst 191:105269. https:\/\/doi.org\/10.1016\/j.knosys.2019.105269https:\/\/doi.org\/10.1016\/j.knosys.2019.105269","journal-title":"Knowl-Based Syst"},{"key":"4144_CR21","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.1007\/s00500-021-06393-x","volume":"26","author":"RK Huda","year":"2022","unstructured":"Huda RK, Banka H (2022) Efficient feature selection methods using PSO with fuzzy rough set a fitness function. Soft Comput 26:2501\u201321. https:\/\/doi.org\/10.1007\/s00500-021-06393-x","journal-title":"Soft Comput"},{"key":"4144_CR22","doi-asserted-by":"publisher","first-page":"8461","DOI":"10.1007\/s00500-021-05773-7","volume":"25","author":"S Moslemnejad","year":"2021","unstructured":"Moslemnejad S, Hamidzadeh J (2021) Weighted support vector machine using fuzzy rough set theory. Soft Comput 25:8461\u201381. https:\/\/doi.org\/10.1007\/s00500-021-05773-7","journal-title":"Soft Comput"},{"key":"4144_CR23","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.ijar.2021.11.001","volume":"142","author":"XL Niu","year":"2022","unstructured":"Niu XL, Sun ZD, Kong XZ (2022) A new type of dyad fuzzy \u03b2-covering rough set models base on fuzzy information system and its practical application. Int J Approx Reason 142:13\u201330. https:\/\/doi.org\/10.1016\/j.ijar.2021.11.001","journal-title":"Int J Approx Reason"},{"key":"4144_CR24","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.knosys.2018.11.022","volume":"165","author":"MJ Hu","year":"2019","unstructured":"Hu MJ, Yao YY (2019) Structured approximations as a basis for three-way decisions in rough set theory. Knowl-Based Syst 165:92\u2013109. https:\/\/doi.org\/10.1016\/j.knosys.2018.11.022","journal-title":"Knowl-Based Syst"},{"key":"4144_CR25","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s41066-019-00178-2","volume":"6","author":"H Mao","year":"2021","unstructured":"Mao H, Hu MJ, Yao YY (2021) Algebraic approaches to granular computing. Granular Comput 6:119\u201331. https:\/\/doi.org\/10.1007\/s41066-019-00178-2https:\/\/doi.org\/10.1007\/s41066-019-00178-2","journal-title":"Granular Comput"},{"key":"4144_CR26","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.ijar.2019.11.002","volume":"116","author":"Yao YY","year":"2020","unstructured":"Yao YY (2020) Three-way granular computing, rough sets, and formal concept analysis. Int J Approx Reason 116:106\u201325. https:\/\/doi.org\/10.1016\/j.ijar.2019.11.002","journal-title":"Int J Approx Reason"},{"key":"4144_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.ijar.2021.11.012","volume":"142","author":"YY Yao","year":"2022","unstructured":"Yao YY, Yang JL (2022) Granular rough sets and granular shadowed sets:Three-way approximations in Pawlak approximation spaces. Int J Approx Reason 142:231\u201347. https:\/\/doi.org\/10.1016\/j.ijar.2021.11.012https:\/\/doi.org\/10.1016\/j.ijar.2021.11.012","journal-title":"Int J Approx Reason"},{"key":"4144_CR28","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/j.ijar.2021.09.017","volume":"140","author":"PF Zhang","year":"2022","unstructured":"Zhang PF, Li TR, Luo C, Wang GQ (2022) AMF-DTRS: adaptive multi-granulation decision-theoretic rough sets. Int J Approx Reason 140:7\u201330. https:\/\/doi.org\/10.1016\/j.ijar.2021.09.017","journal-title":"Int J Approx Reason"},{"key":"4144_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41066-020-00247-x","volume":"7","author":"MK EI-Bably","year":"2022","unstructured":"EI-Bably MK, Fleifei KK, Embaby OA (2022) Topological approaches to rough approximations based on closure operators. Granular Comput 7:1\u201314. https:\/\/doi.org\/10.1007\/s41066-020-00247-xhttps:\/\/doi.org\/10.1007\/s41066-020-00247-x","journal-title":"Granular Comput"},{"key":"4144_CR30","doi-asserted-by":"publisher","first-page":"6865","DOI":"10.1007\/s00500-021-05693-6","volume":"25","author":"SE Han","year":"2021","unstructured":"Han SE (2021) Topological properties of locally finite covering rough sets and k-topological rough set structures. Soft Comput 25:6865\u201377. https:\/\/doi.org\/10.1007\/s00500-021-05693-6","journal-title":"Soft Comput"},{"key":"4144_CR31","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ijar.2021.10.001","volume":"140","author":"MA Khan","year":"2022","unstructured":"Khan MA, Patel VS (2022) A formal study of a generalized rough set model based on subset approximation structure. Int J Approx Reason 140:52\u201374. https:\/\/doi.org\/10.1016\/j.ijar.2021.10.001","journal-title":"Int J Approx Reason"},{"key":"4144_CR32","doi-asserted-by":"publisher","first-page":"11909","DOI":"10.1007\/s00500-020-05098-x","volume":"24","author":"ZH Wang","year":"2020","unstructured":"Wang ZH, Zhang XP, Deng JP (2020) The uncertainty measures for covering rough set models. Soft Comput 24:11909\u201329. https:\/\/doi.org\/10.1007\/s00500-020-05098-x","journal-title":"Soft Comput"},{"key":"4144_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijar.2022.01.010","volume":"144","author":"JJ Xie","year":"2022","unstructured":"Xie JJ, Hu BQ, Jiang HB (2022) A novel method to attribute reduction based on weighted neighborhood probalilistic rough sets. Int J Approx Reason 144:1\u201317. https:\/\/doi.org\/10.1016\/j.ijar.2022.01.010https:\/\/doi.org\/10.1016\/j.ijar.2022.01.010","journal-title":"Int J Approx Reason"},{"key":"4144_CR34","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1080\/0308107042000193561","volume":"33","author":"DW Pei","year":"2004","unstructured":"Pei DW, Xu ZB (2004) Rough set models on double universes. International Journal of General Systems. 33:569\u201381. https:\/\/doi.org\/10.1080\/0308107042000193561","journal-title":"International Journal of General Systems."},{"key":"4144_CR35","doi-asserted-by":"publisher","first-page":"1869","DOI":"10.1007\/s13042-018-0803-z","volume":"9","author":"MW Shao","year":"2018","unstructured":"Shao MW, Guo L, Wang CZ (2018) Connections between two-universe rough sets and formal concepts. Int J Mach Learn Cybern 9:1869\u201377. https:\/\/doi.org\/10.1007\/s13042-018-0803-z","journal-title":"Int J Mach Learn Cybern"},{"issue":"3","key":"4144_CR36","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.3233\/JIFS-151977","volume":"32","author":"BZ Sun","year":"2017","unstructured":"Sun BZ, Ma WM (2017) Fuzzy rough set over multi-universes and its application in decision making. J Intell Fuzzy Syst 32(3):1719\u201334. https:\/\/doi.org\/10.3233\/JIFS-151977","journal-title":"J Intell Fuzzy Syst"},{"key":"4144_CR37","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.knosys.2017.01.036","volume":"123","author":"BZ Sun","year":"2017","unstructured":"Sun BZ, Ma WM, Qian YH (2017) Multigranulation fuzzy rough set over two universes and its application to decision making. Knowl-Based Syst 123:61\u201374. https:\/\/doi.org\/10.1016\/j.knosys.2017.01.036https:\/\/doi.org\/10.1016\/j.knosys.2017.01.036","journal-title":"Knowl-Based Syst"},{"key":"4144_CR38","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.ins.2019.05.080","volume":"507","author":"BZ Sun","year":"2020","unstructured":"Sun BZ, Chen XT, Zhang LY, Ma WM (2020) Three-way decision making approach to conflict analysis and resolution using probabilistic rough set over two universes. Inf Sci 507:809\u201322. https:\/\/doi.org\/10.1016\/j.ins.2019.05.080","journal-title":"Inf Sci"},{"key":"4144_CR39","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1016\/j.ins.2020.02.044","volume":"521","author":"A Ug\u030cur","year":"2020","unstructured":"Ug\u030cur A, Diker M (2020) Generalized texatural rough sets:rough set models over two universes. Inf Sci 521:398\u2013421. https:\/\/doi.org\/10.1016\/j.ins.2020.02.044","journal-title":"Inf Sci"},{"key":"4144_CR40","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0888-613X(96)00071-0","volume":"15","author":"YY Yao","year":"1996","unstructured":"Yao YY (1996) Two views of the theory of rough sets in finite universes. Int J Approx Reason 15:291\u2013317. https:\/\/doi.org\/10.1016\/S0888-613X(96)00071-0https:\/\/doi.org\/10.1016\/S0888-613X(96)00071-0","journal-title":"Int J Approx Reason"},{"issue":"2","key":"4144_CR41","doi-asserted-by":"publisher","first-page":"2639","DOI":"10.3233\/JIFS-202081","volume":"41","author":"WQ Fu","year":"2021","unstructured":"Fu WQ, Khalil AM (2021) Graded rough sets based on neighborhood operator over two different universes and their applications in decision-making problems. J Intell Fuzzy Syst 41(2):2639\u201364. https:\/\/doi.org\/10.3233\/JIFS-202081","journal-title":"J Intell Fuzzy Syst"},{"key":"4144_CR42","doi-asserted-by":"publisher","unstructured":"Yang B (2022) Fuzzy covering-based rough set on two different universes and its application. Artif Intell Review, published online 17-January-2022. https:\/\/doi.org\/10.1007\/s10462-021-10115-y","DOI":"10.1007\/s10462-021-10115-y"},{"key":"4144_CR43","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.ins.2021.12.019","volume":"586","author":"HX Bai","year":"2022","unstructured":"Bai HX, Li DY, Ge Y, Wang JF, Cao F (2022) Spatial rough set-based geographical detectors for nominal target variables. Inf Sci 586:525\u201339. https:\/\/doi.org\/10.1016\/j.ins.2021.12.019","journal-title":"Inf Sci"},{"issue":"1","key":"4144_CR44","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/int.22298","volume":"36","author":"Z Bashir","year":"2021","unstructured":"Bashir Z, Mahnaz S, Malik MGA (2021) Conflict resolution using game theory and rough sets. Int J Intell Syst 36(1):237\u201359. https:\/\/doi.org\/10.1002\/int.22298","journal-title":"Int J Intell Syst"},{"key":"4144_CR45","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s00500-021-06509-3","volume":"26","author":"Z Bashir","year":"2022","unstructured":"Bashir Z, Wahab A, Rashid T (2022) Three-way decision with conflict analysis approach in the framework of fuzzy set theory. Soft Comput 26:309\u201326. https:\/\/doi.org\/10.1007\/s00500-021-06509-3https:\/\/doi.org\/10.1007\/s00500-021-06509-3","journal-title":"Soft Comput"},{"key":"4144_CR46","doi-asserted-by":"publisher","first-page":"13365","DOI":"10.1007\/s00500-021-06089-2","volume":"25","author":"M Das","year":"2021","unstructured":"Das M, Monanty D, Parida KC (2021) On the neutrosophic soft set with rough set theory. Soft Comput 25:13365\u201376. https:\/\/doi.org\/10.1007\/s00500-021-06089-2","journal-title":"Soft Comput"},{"key":"4144_CR47","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ijar.2022.01.007","volume":"143","author":"DD Guo","year":"2022","unstructured":"Guo DD, Jiang CM, Wu P (2022) Three-way decision based on confidence level change in rough set. Int J Approx Reasoin 143:57\u201377. https:\/\/doi.org\/10.1016\/j.ijar.2022.01.007","journal-title":"Int J Approx Reasoin"},{"key":"4144_CR48","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s00500-021-06499-2","volume":"26","author":"QZ Kong","year":"2022","unstructured":"Kong QZ, Xu WH, Zhang DX (2022) A comparative study of differnt granular structures induced from the information systems. Soft Comput 26:105\u201322. https:\/\/doi.org\/10.1007\/s00500-021-06499-2https:\/\/doi.org\/10.1007\/s00500-021-06499-2","journal-title":"Soft Comput"},{"key":"4144_CR49","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.knosys.2020.105556","volume":"105556","author":"GM Lang","year":"2020","unstructured":"Lang GM, Luo JF, Yao YY (2020) Three-way conflict analysis:a unification of models based on rough sets and formal concept analysis. Knowl-Based Syst 105556:194. https:\/\/doi.org\/10.1016\/j.knosys.2020.105556","journal-title":"Knowl-Based Syst"},{"key":"4144_CR50","doi-asserted-by":"publisher","first-page":"3333","DOI":"10.3233\/JIFS-18104","volume":"36","author":"H Mao","year":"2019","unstructured":"Mao H (2019) Approximation operators for semiconcepts. J Intell Fuzzy Syst 36:3333\u201343. https:\/\/doi.org\/10.3233\/JIFS-18104","journal-title":"J Intell Fuzzy Syst"},{"key":"4144_CR51","doi-asserted-by":"publisher","first-page":"87","DOI":"10.3390\/foods9040387","volume":"9","author":"R Roma","year":"2020","unstructured":"Roma R, Palmisano GO, Boni AD (2020) Insects as novel food:a consumer attitude analysis through the dominance-based rough set approach. Foods 9:87. https:\/\/doi.org\/10.3390\/foods9040387","journal-title":"Foods"},{"key":"4144_CR52","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s12553-018-0279-6","volume":"10","author":"PM Shakeel","year":"2020","unstructured":"Shakeel PM, Manogaran G (2020) Prostate cancer classification from prostate biomedical data using ant rough set algorithm with radial trained extreme learning neural network. Health Technol 10:157\u201365. https:\/\/doi.org\/10.1007\/s12553-018-0279-6","journal-title":"Health Technol"},{"key":"4144_CR53","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1088\/1757-899X\/798\/1\/012038 10.1088\/1757-899X\/798\/1\/012038","volume":"012038","author":"AK Sinha","year":"2020","unstructured":"Sinha AK, Namdev N (2020) Computational approach of tumor growth in human body with a significant technique the rough set. IOP Conf. Series: Mater Sci Eng 012038:798. https:\/\/doi.org\/10.1088\/1757-899X\/798\/1\/012038https:\/\/doi.org\/10.1088\/1757-899X\/798\/1\/012038","journal-title":"IOP Conf. Series: Mater Sci Eng"},{"issue":"1","key":"4144_CR54","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1515\/math-2020-0146","volume":"18","author":"G Wang","year":"2020","unstructured":"Wang G, Mao H (2020) Approximation operators based on preconcepts. Open Math 18 (1):400\u201316. https:\/\/doi.org\/10.1515\/math-2020-0146https:\/\/doi.org\/10.1515\/math-2020-0146","journal-title":"Open Math"},{"key":"4144_CR55","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.knosys.2019.05.016","volume":"180","author":"YY Yao","year":"2019","unstructured":"Yao YY (2019) Three-way conflict analysis:Reformulations and extensions of the Pawlak model. Knowl-Based Syst 180:26\u201337. https:\/\/doi.org\/10.1016\/j.knosys.2019.05.016","journal-title":"Knowl-Based Syst"},{"key":"4144_CR56","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"Whitney H","year":"1935","unstructured":"Whitney H (1935) On the abstract properties of linear dependence. American J Math 57:509\u201333. https:\/\/doi.org\/10.1007\/978-1-4612-2972-8_10","journal-title":"American J Math"},{"key":"4144_CR57","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566946.001.0001","volume-title":"Matroid Theory, 2nd. edn.","author":"Oxley J","year":"2011","unstructured":"Oxley J (2011) Matroid Theory, 2nd. edn. Oxford University Press, New York. https:\/\/doi.org\/10.1093\/acprof:oso\/9780198566946.001.0001https:\/\/doi.org\/10.1093\/acprof:oso\/9780198566946.001.0001"},{"key":"4144_CR58","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-9914-1_10","volume-title":"Matroid Theory","author":"Welsh DJA","year":"1976","unstructured":"Welsh DJA (1976) Matroid Theory. Academic Press Inc., London. https:\/\/doi.org\/10.1007\/978-1-4612-9914-1_10"},{"key":"4144_CR59","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-22815-6_10","volume":"11499","author":"M Restrepo","year":"2019","unstructured":"Restrepo M, Cornelis C (2019) Rough matroids based on dual approximation operators. Lecture Notes Comput Sci 11499:1\u201312. https:\/\/doi.org\/10.1007\/978-3-030-22815-6_10","journal-title":"Lecture Notes Comput Sci"},{"key":"4144_CR60","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ijar.2015.12.001","volume":"70","author":"GY Xu","year":"2016","unstructured":"Xu GY, Wang ZH (2016) A rough set approach to the characterization of transversal matroids. Int J Approx Reason 70:1\u201312. https:\/\/doi.org\/10.1016\/j.ijar.2015.12.001","journal-title":"Int J Approx Reason"},{"key":"4144_CR61","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10514-018-9778-6","volume":"43","author":"M Corah","year":"2019","unstructured":"Corah M, Michael N (2019) Distributed matroid-constrained submodular maximization for multi-robot exploration:theory and practice. Autonom Rob 43:485\u2013501. https:\/\/doi.org\/10.1007\/s10514-018-9778-6https:\/\/doi.org\/10.1007\/s10514-018-9778-6","journal-title":"Autonom Rob"},{"key":"4144_CR62","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2022.106272","volume":"106272","author":"SC Deng","year":"2022","unstructured":"Deng SC (2022) On clustering with discounts. Inf Process Lett 106272:177. https:\/\/doi.org\/10.1016\/j.ipl.2022.106272","journal-title":"Inf Process Lett"},{"key":"4144_CR63","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-019-01377-0","volume":"181","author":"C Kir\u00e1ly","year":"2020","unstructured":"Kir\u00e1ly C, Szigeti Z, Tanigawa SI (2020) Packing of arborescences with matroid constraints via matroid intersection. Math Program 181:85\u2013117. https:\/\/doi.org\/10.1007\/s10107-019-01377-0","journal-title":"Math Program"},{"key":"4144_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.08.012","volume":"890","author":"X Sun","year":"2021","unstructured":"Sun X, Xu DC, Guo LK, Li M (2021) Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. Theor Comput Sci 890:1\u201315. https:\/\/doi.org\/10.1016\/j.tcs.2021.08.012https:\/\/doi.org\/10.1016\/j.tcs.2021.08.012","journal-title":"Theor Comput Sci"},{"key":"4144_CR65","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10589-019-00114-9","volume":"74","author":"AM Tillmann","year":"2019","unstructured":"Tillmann AM (2019) Computing the spark:mixed-integer programming for the (vector) matroid girth problem. Comput Optim Appl 74:387\u2013441","journal-title":"Comput Optim Appl"},{"issue":"5","key":"4144_CR66","doi-asserted-by":"publisher","first-page":"606","DOI":"10.20965\/jaciii.2006.p0606","volume":"10","author":"N Ytow","year":"2006","unstructured":"Ytow N, Morse DR, Roberts DM (2006) Rough set approximation as formal concept. J Adv Comput Intell Intell Inf 10(5):606\u201311. https:\/\/doi.org\/10.20965\/jaciii.2006.p0606","journal-title":"J Adv Comput Intell Intell Inf"},{"key":"4144_CR67","doi-asserted-by":"publisher","unstructured":"Wan Q, Li JH, Wei L (2021) Optimal granule combination selection based on multi-granularity triadic concept analysis. Cognit Comput, publised online 09-November-2021. https:\/\/doi.org\/10.1007\/s12559-021-09934-6https:\/\/doi.org\/10.1007\/s12559-021-09934-6","DOI":"10.1007\/s12559-021-09934-6 10.1007\/s12559-021-09934-6"},{"key":"4144_CR68","doi-asserted-by":"publisher","unstructured":"Zhi HL, Qi JJ (2021) Common-possible concept analysis: a granule description viewpoint. Appl Intell, published online 25-June-2021. https:\/\/doi.org\/10.1007\/s10489-021-02499-9","DOI":"10.1007\/s10489-021-02499-9"},{"key":"4144_CR69","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-540-68123-6_35","volume":"4994","author":"FF Xu","year":"2008","unstructured":"Xu FF, Yao YY, Miao DQ (2008) Rough set approximations in formal concept analysis and knowledge spaces. Lecture Notes Comput Sci 4994:319\u201328. https:\/\/doi.org\/10.1007\/978-3-540-68123-6_35","journal-title":"Lecture Notes Comput Sci"},{"key":"4144_CR70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter B, Wille R (1999) Formal Concept Analysis: Mathematical Foundations. Heidelberg: Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-59830-2https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"4144_CR71","doi-asserted-by":"publisher","unstructured":"Vormbrock B, Wille R (2005) Semiconcept and protoconcept algebras: the basic theorems. In: Ganter B, Stumme G, Wille R (eds) Formal concept analysis: foundations and applications. Springer, Berlin, pp 34\u201348. https:\/\/doi.org\/10.1007\/11528784_2","DOI":"10.1007\/11528784_2"},{"key":"4144_CR72","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-0018-1","volume-title":"Lattice Theory: Foundation","author":"G Gr\u00e4tzer","year":"2011","unstructured":"Gr\u00e4tzer G. (2011) Lattice Theory: Foundation. Springer, Basel AG. https:\/\/doi.org\/10.1007\/978-3-0348-0018-1"},{"key":"4144_CR73","doi-asserted-by":"publisher","unstructured":"Wille R (1982) Restructuring lattice theory: an approach based on hierarchies of concepts, pp 445-70. In: Rival I (ed) Ordered Sets. Reidel Publishing Company, Dordrecht-Boston. https:\/\/doi.org\/10.1007\/978-94-009-7798-3_15","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"4144_CR74","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.knosys.2015.01.004","volume":"80","author":"YY Yao","year":"2015","unstructured":"Yao YY (2015) The two sides of the theory of rough sets. Knowl-Based Syst 80:67\u201377. https:\/\/doi.org\/10.1016\/j.knosys.2015.01.004","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"4144_CR75","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1093\/zoolinnean\/zlw019","volume":"181","author":"KG Heller","year":"2017","unstructured":"Heller KG, Ingrisch S, Liu CX, Shi FM, Hemp C, Warcha\u0142owska-\u015aliwa E, Rentz DCF (2017) Complex songs and cryptic ethospecies: the case of the Ducetia japonica group (Orthiptera: tettigonioidea: phaneropteridae:Phaneropterinae). Zool J Linn Soc 181 (2):286\u2013307. https:\/\/doi.org\/10.1093\/zoolinnean\/zlw019","journal-title":"Zool J Linn Soc"},{"key":"4144_CR76","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s43069-021-00092-x","volume":"2","author":"W Kordecki","year":"2021","unstructured":"Kordecki W (2021) Secretary problem:graphs, matroids and greedoids. Oper Res Forum 2:63. https:\/\/doi.org\/10.1007\/s43069-021-00092-x","journal-title":"Oper Res Forum"},{"key":"4144_CR77","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10107-019-01427-7","volume":"185","author":"D Szeszl\u00e9r","year":"2021","unstructured":"Szeszl\u00e9r D (2021) New polyhedral and algorithmic results on greedoids. Math Program 185:275\u201396. https:\/\/doi.org\/10.1007\/s10107-019-01427-7","journal-title":"Math Program"},{"key":"4144_CR78","unstructured":"Mao H, Wu ZY, Wang G, Liang SQ, Liu XQ, Cheng YL, Pan Z (2019) Software of interval three-way decisions pretreat for incomplete bioinformatics system. 15, May, V1.0 China 2019SR0715002"},{"key":"4144_CR79","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.orl.2021.04.005","volume":"49","author":"S Im","year":"2021","unstructured":"Im S, Moseley B, Zhou R (2021) The matroid cup game. Oper Res Lett 49:405\u201311. https:\/\/doi.org\/10.1016\/j.orl.2021.04.005","journal-title":"Oper Res Lett"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04144-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-04144-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-04144-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T19:29:49Z","timestamp":1744140589000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-04144-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,6]]},"references-count":79,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["4144"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-04144-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,6]]},"assertion":[{"value":"2 September 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"The authors declare that they have no conflicts of interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}