Filters rank features independently of a downstream learner, wrappers evaluate candidate subsets through a learner, and embedded methods couple selection to model fitting [1]. The experimental baselines focus on filters, including mutual-information ranking and mRMR relevance-minus-redundancy selection [13]. Their tuned subset sizes and the proposed selector's fixed cap must be considered when interpreting accuracy differences.

Kuncheva's [2] index measures chance-corrected overlap for fixed-size subsets. The experiment below reports mean pairwise Jaccard overlap instead. These metrics are not interchangeable, and the size of a selected subset affects their interpretation. Selecting the full feature set yields perfect Jaccard stability without demonstrating an informative reduction. Accuracy, subset size, and stability must therefore be read together.

Rough-set reduction preserves a specified decision structure [5]. Fuzzy-rough methods permit graded relations and class approximations [6], [7], [14]. Jensen and Shen [10] explicitly extend fuzzy-rough selection to missing values using interval-valued fuzzy sets and interval dependency. Maji and Garai [11] develop interval type-2 fuzzy-rough attribute selection with a max-relevance/max-significance criterion. Interval representation within fuzzy-rough selection therefore predates this study. The present empirical object is a Gaussian-scale midpoint-gain variant evaluated after mean imputation, rather than a first interval fuzzy-rough criterion.

Incomplete information systems have been treated using relations that accommodate unknown values without requiring a unique imputation [15]. Such constructions motivate the use of admissible completion sets here. A specific completion-based dependency definition must state both its similarity relation and the decision classes it approximates. Table 1 compares representative design choices; its entries describe the approaches considered, rather than an exhaustive classification of the literature.

rough [7], [14] dependency, greedy beforehand point-valued imputation-search sensitive Information- Mutual information; Imputation beforehand Point labels expected Moderate; theoretic filters mRMR redundancy- [13] aware Embedded L1-regularized Imputation beforehand Point labels expected Depends on sparsity linear models learner and tuning Impute-then- mRMR after single Single-point imputation Point labels expected Inherits select imputation imputation variance Proposed Interval type-2 Completion-based Decision bounds proposed; Stability IT2-FRFS fuzzy-rough enclosure in general clean selection labels tested evaluated, no dependency framework; mean general imputation in tested guarantee variant

Missing-data theory supplies the MCAR, MAR, and MNAR distinction and explains the assumptions needed for incomplete-data analysis [3], [12]. Flexible imputation and chained equations provide alternative ways to represent missing-value uncertainty [16], [17]. The reported experiment uses uniform random masking only. Conclusions about informative missingness require a mechanism-specific design rather than extrapolation from the MCAR condition.

Label-noise models distinguish class-independent, class-dependent, and instance-dependent corruption [4]. Angluin and Laird [18] analyse learning from noisy examples, while Natarajan et al. [19] develop loss-based learning with noisy labels. The present experiment applies label noise only to downstream training folds; the selectors themselves use clean labels. It consequently evaluates prediction after selection under training noise, rather than robustness of the selection criterion to corrupted labels.

Interval type-2 (IT2) fuzzy sets use lower and upper membership functions to represent a footprint of uncertainty [8]. This representation is distinct from a calibrated probability interval. In feature selection, interval dependency and IT2 fuzzy-rough attribute criteria already appear in the direct predecessors above [10], [11]. The present construction and diagnostic experiment should be assessed against those methods, with explicit similarities, aggregation, and uncertainty assumptions.

The reviewed work supplies complementary tools for feature selection, incomplete-data analysis, and graded uncertainty. We combine these tools in a completion-based dependency framework, then evaluate a restricted similarity-scale implementation. This organization makes the theoretical construction explicit while keeping the empirical claim tied to the method actually described in the experimental setup.

RQ1 asks how incomplete feature values and uncertain decision memberships can be represented in a well-defined selection criterion. RQ2 asks whether the criterion improves subset stability and downstream accuracy relative to type-1 selection and classical filters. RQ3 asks how interval width and a missingness-adaptive envelope affect selection. The reported midpoint-scale experiment addresses only a restricted version of these questions.

H1 concerns whether interval selection improves subset stability over type-1 selection and mRMR. H2 concerns slower degradation as label-noise rates increase. H3 concerns whether missingness-adaptive intervals improve stability over fixed widths. These are research hypotheses, without a verified preregistration record. The reported experiment offers only a limited comparison relevant to H1; it has no noise-rate sweep for H2 and implements no adaptive envelope for H3.

Let U be a finite set of n objects and F a set of m features. The indicator Mij equals one when xij is observed. A completion specifies all unobserved values within nonempty admissible sets and, when needed, class memberships di(c) in [0,1]. Denote the joint admissible set by Ω. Fixed observed values are retained in every completion. A supplied soft-label vector alone does not determine an uncertainty interval; label bounds require an explicit calibration or elicitation rule. Table 2 lists the notation

C (ω)) Admissible-completion envelope of a missing cell, with width parameter omega

ij

ρ (x , x ) Fuzzy similarity between objects under feature subset P

P i k

d (c) Soft-label probability of class c for object i μ (x ) Interval-valued decision memberships

D,L,U] i

LOW(ρ , μ ) Fuzzy lower approximation of the decision, Eq. (2) POS (D) Maximum of class-specific lower approximations 112 Conservative dependency enclosure, Eq. (4) γP (D) Δ (f ∣ P) Interval-valued dependency gain of adding feature f

[L,U]

λ, η Injected missingness rate and label-noise rate

For each cell, Eq. (1) bounds a chosen membership function over its admissible completion set. Infima and suprema are used because endpoint completions need not attain the extrema, and a nonlinear membership function need not have its extrema at the endpoints of the value interval. For a completion ω in Ω, define a per-feature similarity in [0,1] and aggregate it by the minimum over features in P, with similarity one for the empty subset. Eq. (2) defines the Kleene–Dienes lower approximation for each decision class c. Its positive region iPOSP(D)(xi; ω)s = maxc LOW(ρP, dc)(xi; ω) . Eqs. (3) and (4) form conservative endpoint enclosures. The resulting Gaussian relation is a reflexive symmetric fuzzy tolerance; transitivity is not assumed, and equivalence-based reduct properties do not follow automatically.

μA(xij) = [μL,ij, μU,ij], μL,ij = inf μA(v), μU,ij = sup μA(v).

v⊂C (1)

ij v⊂Cij

LOW(ρP, dc)(xi; ω) = min max{1 − ρP(xi, xk; ω), dk(c;ω)}. (2)

xk∈U

LOWL,P,c(xi) = inf LOW(ρP, dc)(xi;ω), LOWU,P,c(xi) = sup LOW(ρP, dc)(xi; ω). (3)

ω∈Ω ω∈Ω 1 n 1 n

γP(D; ω) = ∑i=1 POSP(D)(xi; ω), γP = ∑i=1 inf POSP(D)(xi; ω), γ ‾P =

n n ω∈Ω

1 (4)

∑i=1 sup POSP(D)(xi;ω).

The interval [γP, γ ̅P] encloses the dependency at every joint completion, but the sum of objectwise extrema can be wider than the attainable range of γP. Define the gain by paired completions: ΔL(f|P) = inf{ω ∈ Ω} [γ{P∪{f}}(D; ω) − γP(D; ω)] and ΔU analogously with a supremum. If only dependency enclosures are available, [γ̲ − γ ̅P, γ ̅{P∪{f}} − γ̲ ] is a conservative gain enclosure, not generally a tight range. The

{P∪{f}} P

conservative search admits a candidate only when its lower gain bound exceeds a positive tolerance ε. It is a heuristic and does not solve a simultaneous maximum-dependency and minimum-cardinality problem.

f is admissible given P if ΔL(f ∣ P) ≥ ε > 0; f interval-dominates f′ if ΔL( f ∣ P ) > ΔU(f ∣ P). (5)

The completion-based framework constructs value and decision bounds, derives similarity relations, evaluates dependency enclosures, and performs a conservative forward search. Each stage requires an explicit parameterization and a common admissible set Ω. Algorithm 1 states this conceptual search. The experiment in Section 5 evaluates a different midpoint-gain rule on imputed values and uncertain similarity scales. Completion envelopes are estimated from observed training information and any defensible domain constraints. Decision-membership bounds require their own evidence or elicitation; they do not follow automatically from a soft-label vector.

Similarity bounds are propagated using operations that preserve enclosures. Sharing completion variables across objects can make independently propagated bounds conservative.

Class-specific lower approximations are combined into positive regions and normalized dependency values. Diagnostics report interval width and whether the enclosure remains informative.

The conservative search adds a feature with a lower gain bound above ε and stops when none meets that condition or a feature cap is reached. No minimal-reduct guarantee follows from this rule.

For a missing cell, Cij may be based on local observed values, domain knowledge, or a missingness model. Restricting the set improves informativeness only if the restriction is defensible: A narrow but misspecified envelope can exclude the true value. Envelope construction must use training information during predictive evaluation. The proposed local and mechanism-aware construction is not implemented in the reported

The dependency criterion quantifies how objects similar under P belong to the same decision classes [6], [7]. Its completion-based enclosure separates the attained dependency at a fixed completion from uncertainty across completions. High lower bounds support stronger conservative statements than high midpoints alone; a wide interval indicates sensitivity or conservative bound propagation, rather than establishing that a point estimate is an imputation artefact.

Single imputation supplies one completed table, while multiple imputation explicitly propagates uncertainty under a statistical model [16], [17]. The present enclosure represents a different uncertainty set and is valid only relative to that set. It provides a conservative admission rule when the gain bound is computed correctly; it does not establish robustness to values or mechanisms excluded from Ω.

Algorithm 1 starts with the empty subset and ranks admissible candidates by their lower gain bound, breaking ties by the upper bound and then a fixed feature order. With minimum aggregation of feature similarities and the Kleene–Dienes implication, dependency is nondecreasing as features are added at each fixed completion. Nonnegative gains alone therefore cannot identify a reduct. A positive tolerance limits small additions but does not ensure inclusion minimality or globally optimal cardinality.

A backward pass could test whether deleting any retained feature preserves a stated dependency target; such a pass and its target must be specified before calling the result a reduct. Algorithm 1 returns a conservative subset and diagnostics. In Section 5, the tested implementation uses midpoint dependency gains, ε = 0.002, and a cap of 20 features; it does not implement the lower-bound admission rule or completion-envelope memberships.

Algorithm 1. Conceptual completion based conservative forward search.

Input: joint admissible set Ω, feature set F, decision classes, tolerance ε > 0, optional feature cap k_max 1: specify admissible value and decision-membership bounds 2: construct per-feature similarities for each admissible completion 3: use enclosure-preserving operations when exact completion optimization is unavailable 4: retain the common completion variables in paired gain definitions 5: initialize P ← ∅ 6: while unselected features remain and |P| < k_max do 7: compute valid gain bounds Δ_L(f|P), Δ_U(f|P) for every f ∈ F \ P 8: form A ← {f ∈ F \ P : Δ_L(f|P) ≥ ε} 9: if A is empty, stop 10: choose f* maximizing Δ_L; break ties by Δ_U and fixed feature order 11: update P ← P ∪ {f*} 12: end while 13: record dependency widths and enclosure diagnostics 14: report whether the tolerance or feature cap ended the search Output: conservative subset P and diagnostic report; no minimality certificate

A dense pairwise relation requires O(n²) storage. Evaluating a subset of p features directly costs O(n²p), including the lower approximations over a fixed number of decision classes. A forward search that evaluates all remaining features at k steps costs O(n² Σ_{t = 0}^{k − 1}(m − t)(t + 1)) without reuse; cached minimum relations can reduce repeated work but add storage and implementation choices. Exact optimization over coupled completions may introduce further cost. Restricting the infimum to sampled neighbours changes the lower approximation and generally raises it, so it is an approximation requiring validation. Calibrated envelopes and explicit label bounds are assumptions, not guarantees supplied by interval arithmetic.

The manuscript reports a four-dataset experiment: Breast cancer (569 objects, 30 features, two classes), wine (178, 13, three), an 800-row digits subsample (64 features, ten classes), and a synthetic make_classification table (800 objects, 20 features, eight informative and four redundant, class separation 0.8). The first three use scikit-learn datasets of UCI origin1 [20]. Ten seeds inject 15% MCAR missingness. All selectors receive mean-imputed values and clean labels; 10% label noise is applied only to downstream training folds. Folds and corruption realizations are reported as shared across selectors. It remains necessary to verify whether imputation, scaling, ranking, and subset-size tuning were refitted inside each outer training fold, so the reported cross-validation scores require verification of that nesting.

The baselines are all features, mutual-information ranking, a ReliefF implementation with 200 sampled points and five nearest hits and misses [21], and relevance-minus-redundancy mRMR using quantile-binned mutual information [13]. The tested Interval Type-2 Fuzzy-Rough Feature Selection (IT2-FRFS) uses Gaussian similarities with scale bounds [0.8,1.4] times the feature standard deviation, dependency-interval midpoints for ranking and gain, ε = 0.002, and a cap of 20 features. This is an interval-scale implementation on completed data, rather than Algorithm 1. Baseline subset sizes are tuned using five-fold k-Nearest Neighbors (kNN) accuracy on clean labels; the IT2 count follows its stopping rule. Downstream evaluation uses stratified five-fold cross-validation with kNN (k = 5) and logistic regression. Stability is pairwise Jaccard overlap across ten

https://archive.ics.uci.edu/seeds. Two-dataset ablations use a point scale of 1.0 and wider scale bounds [0.6,1.8]. Reported Friedman, Wilcoxon, and Holm analyses treat 40 dataset–seed combinations as blocks [22–24]; their dependence is addressed in Section 5.5. The reported software is Python 3.12 with NumPy, SciPy, scikit-learn, statsmodels, and matplotlib on one CPU core.

Table 3 reports the principal comparison. Mean kNN accuracy across the four dataset means is 0.8738 for IT2-FRFS, 0.8964 for mRMR, 0.9093 for ReliefF, and 0.8951 for all features. The selector reaches min(20,m) features on every dataset: 20 on breast cancer and digits, 13 on wine, and 20 on the synthetic table. Its wine and synthetic scores therefore coincide with all features. Relative to all features, the displayed means imply deficits of 1.36 percentage points on breast cancer and 7.18 points on digits. ReliefF selects an average of 14.15 features across the four dataset means and has the highest kNN accuracy on breast cancer and the synthetic table; mRMR leads on wine and all features leads on digits. These descriptive differences characterize the reported pipeline.

Fig. 1 shows that ranking behaviour varies by dataset. IT2-FRFS reaches approximately 91.9% on breast cancer with three features, but the mRMR curve is higher at that size. On digits its early ordering is substantially weaker than the other ranking selectors. Logistic-regression results in Table 3 are more favourable to IT2-FRFS relative to all features: The displayed means imply gains of 1.17 percentage points on digits and 0.66 points on breast cancer. mRMR remains higher on both datasets. These observations are compatible with learner-specific effects of compact subsets; they do not isolate an interval-specific regularization mechanism.

Table 4 compares fixed point and interval scales on two datasets. On breast cancer all variants select 20 features, but equal counts do not imply identical subsets. The displayed kNN means range from 0.9283 to 0.9309, a spread of 0.26 percentage points, and Jaccard values span 0.017. On the synthetic table every variant selects all features and the scores coincide. Reported dependency widths of 0.324–0.361 are much larger than ε = 0.002, but width alone does not determine the midpoint gain or prove why stopping failed. The ablation offers no clear interval-scale benefit at this operating point and does not test the adaptive missingness envelopes of H3.

kNN accuracy LR accuracy Features Jaccard 0.9283 ± 0.0130 0.9369 ± 0.0118 20.0 0.739 0.9295 ± 0.0125 0.9367 ± 0.0118 20.0 ± 0.0 0.734 0.9309 ± 0.0137 0.9382 ± 0.0115 20.0 0.751 0.7961 ± 0.0152 0.8317 ± 0.0096 20.0 1.000 0.7961 ± 0.0152 0.8317 ± 0.0096 20.0 ± 0.0 1.000 0.7961 ± 0.0152 0.8317 ± 0.0096 20.0 1.000

At the sole corruption setting, 15% MCAR plus 10% noise in downstream training labels, H2 cannot be evaluated as a degradation curve. Table 3 gives ReliefF improvements over all features of 6.01 percentage points on the synthetic table and 1.79 points on wine; mRMR gains 2.59 points on wine. Every selected subset trails all features on digits. IT2-FRFS has higher displayed Jaccard overlap than mRMR on breast cancer (0.734 versus 0.650), lower overlap on digits (0.381 versus 0.801), and trivial perfect overlap where it selects all features. Pooled Jaccard means are approximately 0.779 for both IT2-FRFS and ReliefF and 0.711 for mRMR. These comparisons do not establish a general stability advantage, particularly because subset sizes

Table 5 preserves the reported Friedman statistic (χ²(4) = 56.73, p = 1.4 × 10⁻¹¹) and paired Wilcoxon results with Holm correction. The signs of the displayed pooled differences favour all four baselines over IT2-FRFS. However, repeated corruption seeds on each of only four datasets are not 40 independent sampled datasets. Treating them as interchangeable inferential blocks can overstate precision for cross-dataset claims, and raw paired outcomes are needed to verify ties, ranks, and p values. The tests are therefore reported as calculations from the original campaign, while the present conclusions rely on descriptive dataset-level differences rather than declaring a broadly established significance result [23].

The reported implementation reaches its cap on every dataset and offers no consistent predictive or stability advantage over the established filters. Its poorest kNN result occurs on digits; full-set selection explains identical wine and synthetic outcomes. The fixed-width ablation changes breast-cancer kNN accuracy by at most 0.26 percentage points and is degenerate on the synthetic table. Logistic-regression improvements over all features on two datasets warrant learner-specific investigation, without establishing that interval scales caused the gains.

Mean imputation and midpoint gains distinguish the tested implementation from the completion-based framework. Missing values filled with column means can alter pairwise similarities, while wide scale intervals may change ordering without preserving the lower-gain admission criterion. These are plausible explanations for the observed cap behaviour, rather than identified causal mechanisms. Testing them requires traceable gain trajectories, fold-specific preprocessing, comparable subset budgets, and an implemented completion-envelope variant. Scaling ε relative to dependency or width is a candidate design change whose effect remains to be tested.

The evidence is limited to four datasets, one MCAR rate, one downstream training-noise rate, a 20-feature cap, kNN and logistic regression, and fixed-width ablations on two datasets. H2 and H3 remain untested in their stated form. H1 receives mixed descriptive evidence, partly confounded by full-set selection and differing subset sizes. The absence of confirmed validation nesting limits claims of out-of-sample prediction.

The numerical results are reported at proof-of-concept scale. Independent regeneration requires the experiment code, raw paired outcomes, fold indices, and execution record; a verified release is not specified.

Completion-based bounds may be conservative because dependent uncertainties are propagated independently. Their validity depends on defensible completion sets, while their usefulness depends on informativeness. Dense similarity computation limits scale, and approximate neighbour relations change the criterion. A lower-gain rule can reject all candidates, whereas midpoint selection can keep adding features until a cap; these are different failure modes of different search rules. The reported experiment evaluates only the latter implementation.

Probabilistic completion models and multiple imputation offer alternatives for representing missing-data uncertainty [12]. Their validity rests on assumptions different from an admissible-set enclosure. Comparing these approaches should match training information and subset budgets. Likewise, missingness-aware prediction may reduce the value of selection for accuracy while leaving measurement cost and interpretability relevant. Stability and predictive accuracy should remain separate reported outcomes, especially where perfect overlap is obtained by retaining every feature.