<p>The process of decision making involves uncertainty due to lack of agreement among experts, inaccuracy in measurements and incomplete information. Current frameworks are inadequate in dealing with cases in which hesitation, indiscernibility, and parameterization may all take place simultaneously. The article proposes a new Hesitant Fuzzy Soft Rough Set (HFSRS) model that combines hesitant fuzzy soft sets and rough sets with dynamic <InlineEquation ID="IEq1"> <EquationSource Format="TEX">\(\:\varvec{\beta\:}\)</EquationSource> </InlineEquation> covers that changes approximation boundaries in relation to hesitant membership levels. The suggested framework deals with severe constraints such as the impossibility to model parameter-dependent hesitation, duality violation of the classical fuzzy rough sets, and fixed thresholding processes that cannot be used in a noisy environment. The three fundamental properties provided by mathematical formalization: (a) duality preservation to provide logical consistency important for safety-critical applications, (b) monotonicity to provide predictable behavior important to explainable AI systems, and (c) topological consistency to provide hierarchical uncertainty modeling. HFSRS is empirically validated using synthetically generated datasets (500 photovoltaic modules with three fault indicators adjusted to IEC 61215-2:2021 standards) to achieve 92 per cent accuracy versus 85 per cent on classical rough sets, 86 per cent on fuzzy rough sets, 88 per cent on intuitionistic fuzzy rough sets, with 35 per cent reduction in boundary region and AUC of 0.97 versus 0.92 on competing methods running 30 times The best 0.65 -threshold of the beta value balances accuracy and coverage. The HFSRS-TOPSIS algorithm provides practitioners with strong decision support, computational tractability of <InlineEquation ID="IEq2"> <EquationSource Format="TEX">\(\:\left(O\right(n\:\times\:\:m\:\times\:\:k\left)\right)\)</EquationSource> </InlineEquation> on a dataset of up to <InlineEquation ID="IEq3"> <EquationSource Format="TEX">\(\:{10}^{4}\)</EquationSource> </InlineEquation> objects.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A hybrid framework of hesitant fuzzy soft sets and rough sets for uncertainty modelling

  • Jahanvi,
  • Dinesh Kumar Nishad,
  • Rashmi Singh,
  • Saifullah Khalid

摘要

The process of decision making involves uncertainty due to lack of agreement among experts, inaccuracy in measurements and incomplete information. Current frameworks are inadequate in dealing with cases in which hesitation, indiscernibility, and parameterization may all take place simultaneously. The article proposes a new Hesitant Fuzzy Soft Rough Set (HFSRS) model that combines hesitant fuzzy soft sets and rough sets with dynamic \(\:\varvec{\beta\:}\) covers that changes approximation boundaries in relation to hesitant membership levels. The suggested framework deals with severe constraints such as the impossibility to model parameter-dependent hesitation, duality violation of the classical fuzzy rough sets, and fixed thresholding processes that cannot be used in a noisy environment. The three fundamental properties provided by mathematical formalization: (a) duality preservation to provide logical consistency important for safety-critical applications, (b) monotonicity to provide predictable behavior important to explainable AI systems, and (c) topological consistency to provide hierarchical uncertainty modeling. HFSRS is empirically validated using synthetically generated datasets (500 photovoltaic modules with three fault indicators adjusted to IEC 61215-2:2021 standards) to achieve 92 per cent accuracy versus 85 per cent on classical rough sets, 86 per cent on fuzzy rough sets, 88 per cent on intuitionistic fuzzy rough sets, with 35 per cent reduction in boundary region and AUC of 0.97 versus 0.92 on competing methods running 30 times The best 0.65 -threshold of the beta value balances accuracy and coverage. The HFSRS-TOPSIS algorithm provides practitioners with strong decision support, computational tractability of \(\:\left(O\right(n\:\times\:\:m\:\times\:\:k\left)\right)\) on a dataset of up to \(\:{10}^{4}\) objects.