The study, authored by Palash Dutta of the Department of Mathematics at Dibrugarh University in Assam, India, presents a comprehensive examination of the mathematical foundations of HyFS, its capacity to absorb other fuzzy frameworks, and its behavior under complement operations. The central object of the theory is a pair of independent membership degrees, one optimistic and one pessimistic, bound together by a hyperbolic relation. That pairing captures a familiar feature of human judgment: when experts assess an uncertain proposition, they often hold an optimistic estimate and a pessimistic estimate simultaneously, and the gap between them encodes hesitation. Rather than treating that hesitation as a separate, tightly constrained quantity, HyFS lets the two degrees vary independently within a hyperbolic constraint, giving the model a wider expressive range without demanding extra parameters from the user.

To understand why this matters, it helps to trace the lineage of generalized fuzzy sets. Atanassov’s intuitionistic fuzzy sets, introduced in 1986, added a non-membership degree to Zadeh’s membership degree, with the two summing to at most one. Yager’s Pythagorean fuzzy sets relaxed that constraint, allowing the squares of the two degrees to sum to at most one, and his later q-rung orthopair fuzzy sets generalized further, permitting the sum of the q-th powers to stay within one. Subsequent frameworks, including (n, m)-rung orthopair fuzzy sets, (n, m)-power root fuzzy sets, Fermatean fuzzy sets, and quintic fuzzy sets, have pushed the rung ever higher, each extension buying additional representational freedom at the cost of additional structure to define, verify, and compute with. The proliferation has been so rapid that a natural question has arisen in the community: how much of this accumulating machinery is actually necessary?

Dutta’s answer is a formal demonstration of HyFS’s generality. The study shows that q-rung orthopair fuzzy sets, (n, m)-rung orthopair fuzzy sets, and (n, m)-power root fuzzy sets can all be embedded into the hyperbolic framework, meaning that any information representable in those systems can be faithfully carried inside HyFS. Embedding results of this kind are the mathematical equivalent of a compatibility guarantee: they establish that adopting the simpler framework does not force a loss of expressive power for the models it subsumes. In practical terms, a decision analyst who has spent years encoding expert judgments as orthopair memberships can translate that work into the hyperbolic setting without discarding anything, while gaining the simpler constraint structure that HyFS imposes.

That simplicity translates directly into performance. The paper includes a comparative analysis of computational complexity, runtime, and scalability, and finds that HyFS achieves superior results, a benefit the author attributes to its simple, parameter-free structure. Where rival frameworks require users to select rung parameters or manage power and root operations that grow computationally expensive, the hyperbolic relation is fixed by the geometry of the model itself. For large-scale applications, the difference is not academic. Multi-criteria decision engines that evaluate thousands of alternatives, or real-time analytics pipelines that must recompute uncertainty scores as data streams in, are acutely sensitive to the per-comparison cost of the underlying set operations. A framework that strips away tunable parameters also removes a source of analyst discretion and, with it, a potential source of inconsistency between studies.

A second major contribution concerns complement operations, the fuzzy analogue of logical negation. In classical set theory, the complement of a set is unambiguous: everything outside it. In fuzzy theory, negation is a design choice, formalized through fuzzy negation functions that can behave in different ways at the boundary between membership and non-membership. The study investigates both classical complements and mixed-type complements built from different fuzzy negation functions within the hyperbolic setting, and verifies that the resulting operations satisfy the properties one would demand of a coherent logic. De Morgan’s laws, the familiar duality linking union with intersection through negation, hold. Distributivity holds. Difference operations are well defined. These verifications matter because fuzzy frameworks that look plausible on individual operations sometimes fail exactly these algebraic tests, producing decision systems in which negating a negation does not return the original judgment, or in which combining criteria behaves differently depending on the order of operations.

The logical consistency established on paper is then stress-tested against two real-world case studies. The first applies a hyperbolic fuzzy version of the CoCoSo method, a combined compromise solution technique for multi-criteria decision-making, to the evaluation of cryptocurrency investments. Cryptocurrencies are a natural proving ground for uncertainty models: their prices are volatile, the criteria that investors weigh, from risk to liquidity to technological maturity, are difficult to quantify crisply, and expert opinion diverges sharply. The second case study applies a hyperbolic fuzzy version of the OCRA method, an operational competitiveness ratings approach, to sustainable transportation planning, a domain where environmental, economic, and social criteria must be balanced under deep uncertainty. In both cases, the author reports that the framework confirmed its accuracy, stability, and scalability, supporting the claim that the theory survives contact with messy applied problems rather than remaining a purely formal exercise.

The case studies also connect the new work to a growing applied literature on hyperbolic fuzzy decision-making. Earlier studies have deployed hyperbolic fuzzy environments in COVID-19 associated problems, extended the TODIM method to hyperbolic settings, built hyperbolic fuzzy TOPSIS procedures for multi-criteria decisions, evaluated Agriculture 4.0 decision support systems, integrated hyperbolic fuzzy sets into construction contract dispute mitigation, identified crime-prone zones, and prioritized solar panels. What the new paper adds to this line of work is the foundational layer: a systematic account of where HyFS sits relative to the broader family of generalized fuzzy sets, what its algebra guarantees, and how fast it runs. That kind of groundwork is often what determines whether a framework gets adopted widely or remains a specialist tool, because practitioners need assurance that the operations they rely on daily are sound and that migrating between frameworks will not silently change results.

The implications reach beyond decision science. The paper positions HyFS as a promising tool for uncertainty modeling, data analytics, and real-time decision-making applications, and the scalability results are particularly relevant as machine learning systems increasingly must reason under uncertainty at scale. Fuzzy sets and their generalizations underpin applications ranging from control systems to medical diagnosis to recommendation engines, and the choice of uncertainty representation propagates through every downstream computation. A framework that can express the same information as q-rung orthopair or power root models while computing faster and requiring no parameter tuning offers a compelling default for engineers who currently face an alphabet soup of competing options. The embedding results also suggest a path for gradual adoption: existing orthopair-based systems can be reinterpreted within the hyperbolic framework rather than rebuilt from scratch.

There are, of course, open questions that the study leaves for future work. The reported case studies demonstrate accuracy, stability, and scalability, but broader empirical validation across additional domains and larger benchmark suites would strengthen the performance claims, and the interplay between hyperbolic fuzzy sets and probabilistic or machine learning approaches to uncertainty remains to be explored in depth. No datasets were generated or analyzed during the study itself, so the empirical evidence rests on the two case studies presented. Still, the paper’s core message is likely to resonate in a field that has spent four decades adding layers of generality: sometimes the most powerful move is not another extension, but a demonstration that a cleaner structure already contains what the extensions were reaching for. If the embedding and performance results hold up under wider scrutiny, hyperbolic fuzzy sets may become the framework that other generalized fuzzy models are measured against, and the humble hyperbola may earn a permanent place in the mathematics of uncertainty.

Subject of Research: Mathematical foundations, embeddings, and complement operations of hyperbolic fuzzy sets for uncertainty modeling and decision-making

Article Title: Mathematical foundations, structural embeddings, and complement operations in hyperbolic fuzzy set theory

Article References: Dutta, P. (2026). Mathematical foundations, structural embeddings, and complement operations in hyperbolic fuzzy set theory. International Journal of Data Science and Analytics, 22(1), Article 336. https://doi.org/10.1007/s41060-026-01330-3

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01330-3

Keywords: hyperbolic fuzzy sets, fuzzy set theory, q-rung orthopair fuzzy sets, complement operations, De Morgan's laws, computational complexity, multi-criteria decision-making, CoCoSo, OCRA, cryptocurrency investment, sustainable transportation, uncertainty modeling

Palash Dutta of the Department of Mathematics at Dibrugarh University in Assam, India, conducted a systematic comparison between Diophantine fuzzy models and a far simpler framework known as hyperbolic fuzzy sets. The Diophantine family includes several prominent variants that have attracted considerable attention in multi-criteria decision-making literature: linear Diophantine fuzzy sets, q-rung linear Diophantine fuzzy sets, generalized Diophantine fuzzy sets, and their fractional extensions. These models share a common design philosophy, embedding multiple reference parameters that users can tune to shape how membership and non-membership information is combined. On paper, that flexibility sounds like a strength. In practice, according to the new findings, it may be the very thing that undermines them.

The core problem Dutta set out to test is a trade-off that has received surprisingly little rigorous scrutiny. Every additional reference parameter in a fuzzy model increases its representational flexibility, but it also opens the door to what the study calls parameter-induced distortion. When users must choose parameter values, the model’s decision boundaries shift depending on those choices, and different users, or the same user on different occasions, can arrive at different conclusions from identical data. In high-stakes applications such as medical diagnosis, renewable energy selection, or infrastructure contracting, where fuzzy methods are routinely deployed, that kind of instability is not a theoretical curiosity. It is a practical liability.

To quantify the problem, the study employed two complementary evaluation strategies. The first was a threshold-based binary classification experiment across an expanded dataset of sixty cases, a sample size determined in advance through a priori power analysis rather than chosen after the fact. Crucially, the experiment used dual cut-offs, deliberately exposing how sensitive each model’s classifications were to the parameters embedded in its formulation. The second strategy was a direct assessment of computational complexity, measuring how each framework’s mathematical machinery scales as problem size grows. Together, the two approaches were designed to answer a deceptively simple question: does the extra flexibility of Diophantine models buy anything that matters?

The answer, at least within this experimental design, was an emphatic no. Hyperbolic fuzzy sets, which contain no reference parameters at all, achieved one hundred percent classification accuracy and perfect self-consistency across the full range of threshold values tested in a continuous, full-spectrum sensitivity analysis. The Diophantine variants told a very different story. Plagued by parameter-induced over-prediction and under-prediction, their accuracies collapsed to a range of roughly 43 to 55 percent. The best performer among them, the generalized Diophantine fuzzy set framework, still managed only 68.33 percent. In classification terms, several of the parameterized models performed worse than a coin flip, a result that raises uncomfortable questions about published applications relying on them.

The magnitude of the gap was not merely statistically detectable but practically enormous. Effect size analysis using Cohen’s d yielded values exceeding 3.0 for every comparison between the hyperbolic framework and its Diophantine rivals, a threshold far beyond the conventional benchmarks for large effects in the behavioral and computational sciences. In plain terms, the difference between the two families of models is not a marginal improvement that might vanish under slightly different conditions. It is a chasm, and the study attributes it directly to a structural feature: the parameter-free multiplicative formulation of hyperbolic fuzzy sets, which captures interaction effects transparently without the parametric sensitivity that warps Diophantine decision boundaries.

Computational results reinforced the picture. The hyperbolic framework maintains a lean linear, or O(N), complexity, meaning its cost grows in direct proportion to the size of the problem. The parameter-heavy Diophantine alternatives, by contrast, carry substantial computational overhead stemming from the extra operations their reference parameters require. For small illustrative examples in academic papers, that overhead is easy to overlook. But fuzzy decision models are increasingly proposed for large-scale, real-world systems, from agriculture decision support platforms to construction contract evaluation and solar panel prioritization, and at scale, the difference between linear scaling and parameter-burdened computation becomes consequential.

The study is careful to define its terms, and those definitions sharpen the critique. Sensitivity, in this context, means responsiveness to parameter variations, and the hyperbolic framework exhibits zero sensitivity while Diophantine models are highly sensitive. Subjectivity means dependence on user-defined choices, which the parameter-free approach eliminates entirely. Stability refers to consistency across conditions, and here the contrast is between perfect stability for the hyperbolic model and narrow optimal windows for its rivals, meaning Diophantine models perform acceptably only within limited ranges of parameter settings. Even the celebrated unity constraint, the bounding condition on membership and non-membership grades that Diophantine models relax in the name of generality, turns out to impose only a trivial, non-restrictive burden on the hyperbolic formulation while its relaxation introduces distortion elsewhere.

None of this means the Diophantine research program is without value. These frameworks emerged from a genuine mathematical lineage stretching from Atanassov’s intuitionistic fuzzy sets through Yager’s orthopair generalizations, Pythagorean and Fermatean variants, and a flourishing ecosystem of rung-based extensions. Each generation promised a wider space of admissible membership grades, and each attracted a wave of applications. What the new study challenges is the assumption that wider admissible spaces and more tunable parameters translate into better decisions. Flexibility, the findings suggest, is only a virtue if the person wielding it knows precisely how to wield it, and even then, the model’s output may say more about the chosen parameters than about the underlying problem.

The implications reach well beyond one corner of fuzzy mathematics. Multi-criteria decision-making methods built on parameterized fuzzy sets are embedded in software used for site selection, supplier evaluation, disease diagnosis, and disaster response planning. If the classification reliability of the underlying model can swing by tens of percentage points depending on parameter choices, then the credibility of those applications deserves fresh scrutiny. The study’s message is a bracing one for a field that has rewarded novelty and generality: sometimes the mathematically robust, globally scalable, and highly reliable choice is the one with fewer knobs to turn, and the burden of proof now lies with the complex models to demonstrate that their flexibility earns its keep.

Subject of Research: Comparative reliability and computational complexity of Diophantine fuzzy models versus hyperbolic fuzzy sets in decision-making

Article Title: A critical survey on critical issues of diophantine fuzzy models in light of hyperbolic fuzzy sets

Article References: Dutta, P. (2026). A critical survey on critical issues of diophantine fuzzy models in light of hyperbolic fuzzy sets. International Journal of Data Science and Analytics, 22(1), Article 327. https://doi.org/10.1007/s41060-026-01311-6

Image Credits: AI Generated

DOI: 10.1007/s41060-026-01311-6

Keywords: fuzzy sets, Diophantine fuzzy sets, hyperbolic fuzzy sets, multi-criteria decision-making, classification accuracy, sensitivity analysis, computational complexity, scalability, parameter sensitivity, uncertainty modeling, decision stability, effect size

The research, led by Amna Wasim and Muhammad Saeed of the University of Management and Technology in Lahore, together with Muhammad Haris Saeed, Muhammad Salman Habib of Hanyang University ERICA Campus, and Mehran Ullah of the University of the West of Scotland, builds on a construct known as intuitionistic fuzzy soft sets. To understand why this matters, it helps to unpack the idea. Fuzzy sets allow an element to belong to a category partially, with a membership degree between zero and one, which is useful when evidence is ambiguous. Intuitionistic fuzzy sets go a step further by pairing each membership degree with a non-membership degree, capturing the hesitation or doubt that remains after both sides of the judgment are recorded. Soft sets, in turn, attach these fuzzy judgments to parameters, so that a decision-maker can describe an object, such as a network message, through a family of approximate descriptions rather than a single crisp label. The combination yields a flexible language for reasoning under uncertainty, one that has found applications from medical diagnosis to pattern recognition.

Yet the authors identified a persistent weakness in how intuitionistic fuzzy soft sets have been used for prioritization tasks. Existing approaches lack effective mechanisms for comparing structured domains while preserving the order relations embedded in them. In a cybersecurity setting, this is not a cosmetic flaw. Threat indicators do not arrive as an unordered pile; they come with dependencies, where one signal only makes sense in light of another, and where some features logically precede others in the chain of reasoning that leads from raw traffic to a confirmed attack. If a prioritization method ignores these order relations, its outputs can become inconsistent and hard to interpret, and the resulting ranking of messages may shuffle in ways that no analyst can defend.

The new framework rests on three mathematical pillars. The first is a similarity mapping mechanism designed to compare ordered intuitionistic fuzzy soft structures. Crucially, the comparison operates at two levels: same-level comparisons, which evaluate structures that occupy equivalent positions in their respective hierarchies, and compatible-level comparisons, which relate structures across levels in a controlled way. This dual capability allows the system to judge how closely a new incoming message resembles known threat patterns without flattening the hierarchical context in which those patterns live. Similarity, in this framework, is not a loose resemblance score but a structure-aware relation that keeps the ordering of features intact.

The second pillar is the notion of order-isomorphism, a concept borrowed from order theory that captures structural equivalence between domains. Two domains are order-isomorphic when there is a mapping between them that preserves the ordering in both directions: whenever one element precedes another in the first domain, its image precedes the corresponding element in the second, and vice versa. In practical terms, order-isomorphism gives the framework a rigorous test for when two structured descriptions of network behavior can be treated as equivalent, so that knowledge learned about one can be transferred to the other without silently breaking the dependency structure. This is the kind of guarantee that ad hoc similarity scores cannot provide, and it is what allows the prioritization outcomes to remain consistent as messages flow through the system.

The third pillar brings in topological sorting, a classical algorithmic technique for ordering the nodes of a directed graph so that every edge points forward in the sequence. The authors use topological sorting to identify optimal feature-to-threat correspondences while maintaining the hierarchical dependencies among features. Instead of treating each feature as an independent vote on whether a message is malicious, the method resolves the dependency graph first, producing an ordering in which upstream features are settled before downstream ones are evaluated. The result is a prioritization pipeline in which the ranking of messages emerges from a coherent traversal of the dependency structure rather than from a flat aggregation that could contradict itself.

Assembled together, these three components form an integrated prioritization pipeline that was experimentally validated on the NSL-KDD dataset, a refined and widely used benchmark for network intrusion detection research. The empirical results are competitive and notably balanced. The proposed approach attained the highest test accuracy reported in the study, 0.8365, along with an F1-score of 0.8383, a harmonic mean of precision and recall that indicates the system is not trading one for the other in a lopsided way. Perhaps most significant for operational security is the improved recall of 0.7444, because recall measures the proportion of actual attacks that the system detects. In cybersecurity, a missed attack, a false negative, is often far more costly than a false alarm, so improvements in recall translate directly into fewer undetected intrusions slipping past the perimeter.

The authors did not stop at headline metrics. They subjected the framework to statistical significance testing to confirm that the observed performance differences were not artifacts of random variation, and they ran sensitivity analysis and perturbation analysis to probe how the system behaves when inputs are deliberately disturbed. The fact that the prioritization mechanism held up under these stress tests supports the central claim of the paper: that integrating order-preserving similarity, structural equivalence, and topological reasoning within the intuitionistic fuzzy soft set paradigm produces prioritization that is more reliable, more consistent, and more interpretable than approaches that ignore the ordering of features. Interpretability matters here as much as accuracy, because security analysts need to understand why a particular message was escalated, and a ranking that respects explicit dependency relations is far easier to audit than an opaque score.

The broader significance of the work lies in its demonstration that classical mathematical structure and modern uncertainty modeling can reinforce each other. Intuitionistic fuzzy soft sets supply the vocabulary for reasoning about vague and hesitant evidence, while order theory and graph algorithms supply the discipline needed to keep that reasoning coherent across hierarchical levels. The study received no external funding, and the authors declare no competing financial interests, and the article is published open access under a Creative Commons Attribution 4.0 license, making the full technical apparatus available to any research team that wants to build on it. The work was accepted on 13 August 2026 and published on 2 September 2026 as part of the journal’s early-access program, which shares peer-reviewed, citable research ahead of final formatting.

Looking forward, the framework suggests a template that could extend beyond network traffic. Any domain in which decisions must be prioritized under uncertainty and hierarchical dependency, from triaging alerts in industrial control systems to ranking diagnostic signals in medicine, shares the same structural anatomy that this approach is designed to handle. The combination of same-level and compatible-level similarity comparisons, order-isomorphism as a certificate of structural equivalence, and topological sorting as a dependency-aware ordering engine offers a principled alternative to flat scoring pipelines. For defenders of large networks, the message of the study is straightforward: the order in which evidence is considered is not a detail but a first-class part of the decision problem, and mathematics that preserves that order can catch attacks that flatter, order-blind methods let through.

Subject of Research: Order-preserving structural mapping in intuitionistic fuzzy soft sets for prioritizing uncertain, hierarchically dependent network threat messages

Article Title: Order-preserving structural mapping for message prioritization in intuitionistic fuzzy soft sets

Article References: Wasim, A., Saeed, M. H., Saeed, M., Habib, M. S., & Ullah, M. (2026). Order-preserving structural mapping for message prioritization in intuitionistic fuzzy soft sets. Complex & Intelligent Systems. https://doi.org/10.1007/s40747-026-02481-3

Image Credits: AI Generated

DOI: 10.1007/s40747-026-02481-3

Keywords: intuitionistic fuzzy soft sets, cybersecurity, message prioritization, order-isomorphism, topological sorting, similarity mapping, NSL-KDD dataset, intrusion detection, uncertainty modeling, false negatives, recall, Complex & Intelligent Systems

To understand why this matters, it helps to trace the lineage of the underlying mathematics. Fuzzy sets, introduced by Lotfi Zadeh in 1965, replaced the rigid yes-or-no logic of classical set theory with degrees of membership, allowing an element to belong to a set partially. Hesitant fuzzy sets, proposed by Vicenç Torra in 2010, went a step further by permitting several possible membership values for a single element, capturing the situation where a panel of experts offers conflicting assessments rather than a single consensus figure. Dual hesitant fuzzy sets then added a second dimension: alongside multiple possible membership degrees, they allow multiple possible non-membership degrees, so an evaluator can simultaneously express hesitation about how well an option performs and hesitation about how badly it fails.

The new paper builds on two prominent extensions of that dual structure. Probabilistic dual hesitant fuzzy sets attach probability weights to each possible membership and non-membership value, acknowledging that some expert opinions are more likely or better supported than others. Interval-valued dual hesitant fuzzy sets, by contrast, replace single numbers with intervals, which is useful when an assessor can only bound a judgment rather than pin it down. Each extension captures something the other misses. Probabilities encode the relative credibility of individual assessments; intervals encode the inherent imprecision of the assessments themselves. Yan’s contribution is the probabilistic interval-valued dual hesitant fuzzy set, or PIVDHFS, which fuses both properties into a single representation. In a PIVDHFS, each element carries a set of interval-valued membership degrees and a set of interval-valued non-membership degrees, and each of those interval values is associated with a probability. The result is a data structure that can model disagreement among experts, imprecision within each expert’s judgment, and the unequal reliability of different judgments, all simultaneously.

Representing information this way is only useful if you can compute with it, and that requires a way to measure how different two PIVDHFSs are. Distance measures are the workhorses of fuzzy decision theory: they underpin ranking methods, clustering, pattern recognition, and medical diagnosis applications. The paper defines the operational laws of PIVDHFSs and then derives a family of distance formulas. The probabilistic interval-valued dual hesitant fuzzy weighted distance treats each attribute with a fixed importance weight. The ordered weighted distance instead assigns weights to positions in an ordered sequence, so that the largest deviations can be emphasized or downplayed depending on the decision-maker’s risk posture. The hybrid weighted distance combines both ideas, weighting attributes and positions at the same time, and the generalized hybrid weighted distance adds a tunable parameter that lets the analyst adjust how aggressively large differences are penalized. Together these measures give decision-makers a flexible toolkit for comparing alternatives described in this rich uncertain format.

A second, often overlooked problem in multi-attribute decision-making is determining how much each criterion should matter in the first place. When attribute weights are unknown, subjective assignment invites bias, so objective weighting methods infer importance directly from the data. The study enhances one such method, CRITIC, which stands for criteria importance through intercriteria correlation. The original CRITIC, introduced by Diakoulaki and colleagues in 1995, assigns higher weights to criteria that carry more information, measured by standard deviation, and that are less redundant with other criteria, measured by correlation. Yan’s version incorporates the Spearman correlation coefficient, a rank-based measure of association, within the PIVDHFS context. Rank correlation is more robust than the Pearson coefficient when the underlying data are ordinal or non-linear, which is precisely the character of hesitant fuzzy assessments. The enhanced CRITIC therefore extracts objective weights from the structure of the probabilistic interval-valued data itself, reducing the influence of arbitrary human judgment on the weighting stage.

With distances and weights in hand, the framework turns to ranking. TOPSIS, the technique for order of preference by similarity to ideal solution, is one of the most widely used methods in operations research. Its logic is intuitive: the best alternative is the one that is simultaneously closest to a hypothetical positive ideal solution and farthest from a negative ideal one. The paper extends TOPSIS to operate directly on PIVDHFSs, using the newly developed distance measures to compute each alternative’s separation from the ideal and anti-ideal points. The extended PIVDHF-CRITIC-TOPSIS pipeline thus proceeds in three stages: encode expert evaluations as PIVDHFSs, derive objective attribute weights with the Spearman-enhanced CRITIC method, and rank alternatives by their relative closeness computed through the new distance family.

The framework was put to the test on a problem with genuine industrial stakes: digital supplier selection for a new energy vehicle manufacturer in China. Digital suppliers provide the software platforms, data services, and connected-technology capabilities that modern electric vehicle production increasingly depends on, and choosing among them involves criteria that are hard to quantify precisely, such as technological maturity, data security posture, service responsiveness, and long-term partnership potential. Evaluations from multiple experts naturally conflict, and confidence in each assessment varies. The PIVDHFS format captured this layered uncertainty, and the extended framework produced a complete ranking of candidate suppliers. The author validated the result in two ways. A sensitivity analysis varied key parameters, including the generalized distance parameter and the derived attribute weights, to check whether the ranking was an artifact of particular settings. A comparative study then applied alternative decision methods to the same data to confirm that the proposed approach yields consistent and scientifically rational outcomes.

What makes this work notable in the broader landscape of decision science is its position at the confluence of several research threads that had previously advanced separately. Probabilistic dual hesitant fuzzy sets have been applied to risk evaluation, sustainable supplier selection, and rainfall analysis, while interval-valued dual hesitant fuzzy sets have supported emergency response evaluation and aggregation-based decision models. Distance measures for dual hesitant structures have found uses ranging from image segmentation to medical diagnosis. By unifying the probabilistic and interval-valued extensions and wiring them into an objective weighting scheme and a classical ranking method, the new framework offers a template that other researchers can adapt. The same architecture could, in principle, support green supplier selection, renewable energy assessment, medical diagnosis, or any domain where expert judgment is hesitant, imprecise, and unevenly reliable.

The practical implications extend to the fast-growing field of digital supply chain management. Recent literature on supplier selection in digital manufacturing has emphasized resilience, cyber risk, and data-driven simulation, and machine learning approaches have been proposed for modeling supplier performance under disruption. Yet the front end of those pipelines, the structured elicitation of expert judgment about candidates, still relies heavily on decision frameworks that assume crisp numbers or single-layer fuzziness. A representation that preserves probabilities, intervals, and dual hesitation through every stage of weighting and ranking could feed cleaner, more honest inputs into downstream analytics. For industries such as electric vehicles, where supply chains span continents and technology cycles are measured in months, the difference between a robust ranking and a fragile one can translate into millions in procurement outcomes.

There are, of course, limits worth noting. The framework’s sophistication comes at the cost of computational and elicitation overhead: asking experts to supply interval-valued memberships, non-memberships, and probabilities for every attribute of every alternative is demanding, and the quality of the output depends on the quality of those inputs. The study itself reports validation through a single real-world case, supplemented by sensitivity and comparative analyses, which is a solid but not exhaustive evidence base. Still, the paper represents a careful piece of mathematical engineering, defining operational laws, deriving a graded family of distance measures, enhancing an objective weighting method with a rank correlation coefficient, and demonstrating the whole pipeline on a decision that manufacturers actually face. As uncertain, expert-mediated judgments continue to pervade high-stakes industrial and environmental choices, tools that quantify hesitation rather than papering over it are likely to become standard equipment in the decision scientist’s toolkit.

Subject of Research: Multi-attribute decision-making using probabilistic interval-valued dual hesitant fuzzy sets with distance measures and an extended TOPSIS framework

Article Title: Multi-attribute decision-making based on probabilistic interval-valued dual hesitant fuzzy sets and extended TOPSIS

Article References: Yan, L. (2026). Multi-attribute decision-making based on probabilistic interval-valued dual hesitant fuzzy sets and extended TOPSIS. International Journal of Machine Learning and Cybernetics, 17(10), Article 486. https://doi.org/10.1007/s13042-026-03294-z

Image Credits: AI Generated

DOI: 10.1007/s13042-026-03294-z

Keywords: fuzzy sets, multi-attribute decision-making, TOPSIS, CRITIC method, distance measures, dual hesitant fuzzy sets, supplier selection, uncertainty modeling, operations research, new energy vehicles, Spearman correlation, decision science

The core problem the researchers tackle is clustering: deciding how to partition a sprawling network of resource-constrained devices into groups, each led by a cluster head that aggregates and relays traffic. Clustering reduces energy drain and improves throughput, but most existing methods rely on simple distance metrics, conventional fuzzy logic, or isolated reinforcement learning agents. In large-scale industrial settings, where communication quality fluctuates and devices join and leave unpredictably, those approaches struggle. The authors argue that the missing ingredient is a principled way to handle uncertainty while still seeing the network as a whole, rather than as a collection of independent nodes.

AG-T2FRC begins by constructing an industrial network graph that integrates three kinds of information: node characteristics, communication quality, and dynamic topology relationships. This graph representation is significant because it captures context that distance-based schemes ignore. Two devices may be physically close but separated by machinery that degrades their radio link, or far apart yet connected by a reliable wired or high-quality wireless path. By encoding these relationships explicitly, the framework gives downstream decision-making a far richer picture of which devices should actually be grouped together.

The second pillar of the framework is a Type-2 fuzzy confidence estimation mechanism. Type-2 fuzzy logic extends ordinary fuzzy logic by modeling uncertainty about the membership functions themselves, effectively adding a second layer of imprecision handling. In practice, this means that when the system evaluates whether a cluster formation decision is sound, it does not merely output a crisp yes or no, or even a single membership grade. Instead, it quantifies how confident it is in that grade, which is exactly the kind of reasoning needed when radio conditions are noisy and device states are only partially observable. The confidence information produced here becomes the foundation for everything that follows.

Those confidence signals then feed a reinforcement learning-based dynamic clustering strategy. Reinforcement learning agents learn by trial and reward, and here the reward structure is shaped by the fuzzy confidence estimates, steering the agent toward cluster-head selections, node assignments, and topology adaptations that are both high-performing and robust to uncertainty. The framework continuously optimizes which devices act as cluster heads, how the remaining nodes attach to them, and how the overall structure adapts as conditions change. This coupling of fuzzy uncertainty quantification with learning-based optimization is what distinguishes AG-T2FRC from prior reinforcement learning or fuzzy-only clustering schemes.

A distinctive and pragmatic feature of the work is its hardware-aware complexity model. Sophisticated algorithms are worthless on an edge device if they exceed its CPU budget, drain its battery, or overflow its memory. The researchers therefore evaluate computational feasibility directly in terms of CPU cycles, execution latency, energy consumption, and memory requirements. This means the framework is not just theoretically elegant but explicitly engineered to run on the modest microcontrollers and embedded processors that dominate real industrial deployments, a constraint that much of the clustering literature leaves unexamined.

To validate the approach, the team conducted extensive simulations in NS-3, a widely used discrete-event network simulator, with network sizes scaling from 150 to 2,000 devices. They also tested multiple robustness scenarios, including node mobility and node failures, which are precisely the disturbances that plague industrial environments. The results showed that AG-T2FRC achieves improved throughput, energy efficiency, reliability, and adaptation capability compared with recent reinforcement learning-based and fuzzy-based clustering approaches. The scalability tests matter particularly: a method that works for 150 devices but collapses at 2,000 would be of limited use in modern factories, where device counts routinely reach into the thousands.

The significance of this work extends beyond a single algorithm. Industrial IoT networks sit at the intersection of operational technology and information technology, and their failure modes are costly: production line stoppages, safety hazards, and data loss. Prior research has documented persistent challenges in securing and managing these networks, and a growing body of literature applies fuzzy systems, reinforcement learning, and graph methods to IoT problems individually. AG-T2FRC’s contribution is the integration of all three into a single uncertainty-aware pipeline, so that the network’s own structure becomes an input to intelligent, self-correcting decision-making at the edge.

The framework also reflects a broader trend toward edge intelligence, in which computation is pushed away from centralized cloud servers and onto the devices themselves. Centralized clustering requires global state information and constant control signaling, which consumes bandwidth and introduces latency. By making clustering decisions locally, with a learning agent guided by fuzzy confidence and graph context, AG-T2FRC reduces dependence on distant infrastructure. The authors describe the result as a scalable and uncertainty-aware form of edge intelligence suited to dynamic IIoT environments, positioning the work within the ongoing shift toward autonomous network management.

There are, of course, the usual caveats that accompany simulation-based networking research. The reported gains come from NS-3 experiments rather than physical deployments, and real factory floors add electromagnetic interference, protocol heterogeneity, and safety certification constraints that simulators approximate only imperfectly. The authors also note that no datasets were generated or analyzed during the study, meaning the evaluation rests entirely on simulated scenarios. Nonetheless, the combination of graph-aware context, Type-2 fuzzy uncertainty handling, reinforcement learning, and explicit hardware feasibility modeling offers a credible template for the next generation of self-organizing industrial networks, and the work, supported in part by the National Natural Science Foundation of China, is likely to influence how researchers think about clustering under uncertainty in the years ahead.

Subject of Research: Adaptive clustering for Industrial Internet of Things networks using graph-aware Type-2 fuzzy logic and reinforcement learning

Article Title: A graph-aware Type-2 fuzzy reinforcement clustering framework for adaptive and hardware-efficient industrial internet of things networks

Article References: Duan, C., Wang, Y., Zhang, P., Li, S., & Luo, S. (2026). A graph-aware Type-2 fuzzy reinforcement clustering framework for adaptive and hardware-efficient industrial internet of things networks. Cluster Computing, 29(14), Article 806. https://doi.org/10.1007/s10586-026-06624-6

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06624-6

Keywords: Industrial Internet of Things, graph-based clustering, Type-2 fuzzy logic, reinforcement learning, edge intelligence, adaptive clustering, hardware-aware optimization, network topology, energy efficiency, NS-3 simulation, cluster computing, uncertainty modeling

The study, published in Discover Artificial Intelligence by Harish Kumar, Anuradha Taluja, N. Partheeban, Shashi Mehrotra and colleagues, introduces a Confidentiality-Preserving Spiking Neural Transformer, or CP-SNT, designed to detect breast cancer from histopathology images while keeping sensitive medical records locked away from prying eyes. The motivation is straightforward: most AI diagnostic systems chase accuracy alone, while noise, staining variation, structural heterogeneity, and class imbalance quietly erode their reliability, and centralized cloud training or inference exposes raw images to breach and unauthorized access. Regulatory frameworks increasingly demand strict confidentiality for medical images, and the authors argue that privacy is no longer an optional add-on but a core requirement for any medical AI system that hopes to reach the clinic. CP-SNT was built to answer accuracy, robustness, uncertainty modeling, and data security in a single end-to-end pipeline rather than treating them as separate engineering problems.

The journey of an image through the framework begins with cleanup. Histopathology slides are notoriously corrupted by uneven illumination, staining artifacts, and sensor noise, and conventional smoothing filters tend to blur the very cellular boundaries that pathologists rely on. The researchers therefore apply a Robust Double-Weighted Guided Image Filtration module, an edge-preserving denoising method that computes local linear coefficients through a regularized least-squares minimization. In practical terms, the filter assumes a local affinity between a guidance image and the input, allowing homogeneous regions to be smoothed while fine morphological features such as nuclear boundaries, glandular structures, and tissue architectures are preserved. The team also explored content-aware seam carving to strip away low-information background regions, but their experiments showed that structural fidelity, measured by the SSIM metric, degrades noticeably once more than ten seams are removed, so aggressive seam removal was rejected as unsuitable for diagnostic preprocessing.

Once the image is clean, the framework moves into feature extraction using a Discrete Quaternion Quadratic Phase Fourier Transform, a mouthful of a name that hides an elegant idea. Instead of processing the red, green, and blue channels of a stained slide independently, as classical Fourier methods do, the quaternion representation encodes all three channels as a single hypercomplex value, R i plus G j plus B k. This allows the transform to capture inter-channel color dependencies and phase correlations simultaneously, which is crucial because staining intensity varies from lab to lab and slide to slide. The resulting frequency- and phase-domain coefficients preserve magnitude and phase information together, yielding compact discriminative features that are more robust to staining variability and texture heterogeneity than raw pixel intensities. In effect, the transform converts the visual complexity of tissue into a mathematical fingerprint that downstream networks can learn from more reliably.

The heart of the system is a hybrid classifier that fuses two very different computational philosophies. The first component is a Probabilistic Spiking Neural Network, a biologically inspired model in which neurons communicate through discrete spikes rather than continuous activation values. Each neuron maintains a membrane potential governed by a decay dynamic, and instead of firing deterministically when a threshold is crossed, it fires stochastically with a probability given by a sigmoid function of its membrane potential. In a worked example from the paper, a feature vector encoding texture intensity, edge sharpness, and color variation is weighted and summed to a potential of 1.34, producing a spike probability of roughly 0.79; a random draw below that value triggers a spike, above it the neuron stays silent. This probabilistic, sparse encoding explicitly models uncertainty, resists noisy feature variation, reduces overfitting, and emphasizes salient discriminative patterns while suppressing redundant activations, which is precisely the kind of behavior medical diagnosis demands when ambiguity is routine.

The second component, a Causality-Aware Transformer Network, takes the spike-encoded embeddings and applies causal self-attention, computing query, key, and value matrices scaled by the square root of the feature dimension. Where the spiking network excels at local, uncertainty-aware encoding, the transformer captures long-range contextual dependencies across the tissue patch and models causal interactions between features, helping the model avoid spurious correlations that plague purely correlational attention. The authors also incorporate metaheuristic optimization, drawing on the Farmer Ants Optimization Algorithm for feature selection and hyperparameter tuning, balancing exploration and exploitation to speed convergence and avoid the fragility of manual tuning. Ablation-style analysis attributes gains to each stage: the guided filtration contributes about 1.28 percent, the quaternion transform about 0.83 percent, the spiking network a substantial 1.45 percent, and the causal attention module about 0.32 percent, while the encryption layer preserves privacy without measurable loss of accuracy.

The privacy layer is where the framework earns its confidentiality-preserving name. A module called PrivTuner applies homomorphic encryption, a family of cryptographic techniques that allow arithmetic to be performed directly on ciphertext, so that model parameters and inference data can be processed without ever being decrypted. This means training gradients and diagnostic predictions can be computed on encrypted representations of patient images, shielding records from cloud operators, network intermediaries, and potential attackers alike. The team measured encryption and decryption time, inference latency, memory usage, and communication overhead, and reported that the added cost is modest relative to the security gained, though they candidly note that a comprehensive trade-off analysis of encryption overhead, computational complexity, and scalability remains future work. This distinguishes the approach from most prior privacy-conscious designs, which rely on federated learning or blockchain architectures rather than embedding encrypted-domain computation inside a modern hybrid deep learning model.

The experimental evidence is compelling. Evaluated on two public benchmarks, BreakHis and the Breast Histopathology Images dataset, together totaling 16,116 images spanning magnifications from 40x to 400x and patch-level samples of benign and malignant tissue, CP-SNT achieved accuracies of 98.60 percent and 98.37 percent respectively, with precision above 98.1 percent and F1-scores near 98.2 percent. Five-fold cross-validation yielded a mean accuracy of 98.62 percent with a standard deviation of only 0.23, indicating strong stability and resistance to overfitting, and paired t-tests confirmed that improvements over CNN-based, transformer-based, and hybrid baselines were statistically significant at P less than 0.05. Crucially, the model was also tested on an external Invasive Ductal Carcinoma dataset that played no role in development or tuning, where it reached a validation accuracy of 95.73 percent, test accuracy of 95.41 percent, precision of 98.83 percent, recall of 93.89 percent, an F1-score of 96.30 percent, and an ROC-AUC of 98.45 percent, demonstrating genuine generalization beyond the datasets it was built on.

The authors are appropriately candid about limitations. Validation so far rests on public datasets rather than large multicenter clinical cohorts, the multi-module architecture is computationally heavier than simpler deep learning methods, and the system currently performs binary benign-versus-malignant classification without tumor subtyping or built-in explainability. Borderline tissue patterns and complex morphologies remain sources of error, and the encryption overhead analysis is still preliminary. Future work, they write, will target heterogeneous clinical data, deeper privacy-performance trade-off studies, explainable AI techniques, multi-class subtype classification, and real-time clinical deployment. Even so, the study marks a notable convergence of two research frontiers that have largely progressed in parallel: neuromorphic, spike-based computing that mimics the brain’s event-driven efficiency, and cryptographic computation that treats patient privacy as a first-class architectural constraint. If the framework’s accuracy holds up in clinical settings, it suggests a future in which the most sensitive medical images can be analyzed by powerful AI without ever being exposed in the clear, a combination that could reshape how hospitals, laboratories, and cloud providers collaborate on the next generation of diagnostic intelligence.

Subject of Research: A privacy-preserving spiking neural transformer framework for breast cancer detection in histopathology images using homomorphic encryption

Article Title: Spiking neural transformer based confidentiality preserving framework for breast cancer detection in histopathology images

Article References: Spiking neural transformer based confidentiality preserving framework for breast cancer detection in histopathology images. (n.d.). https://doi.org/10.1007/s44163-026-02179-y

Image Credits: AI Generated

DOI: 10.1007/s44163-026-02179-y

Keywords: breast cancer detection, histopathology, spiking neural network, transformer, homomorphic encryption, privacy-preserving AI, medical imaging, deep learning, uncertainty modeling, BreakHis dataset, causal attention, secure healthcare analytics

The framework at the heart of this work is formal concept analysis, a mathematical theory introduced by Rudolf Wille in 1982 that has since become a cornerstone of knowledge engineering. In its classical form, formal concept analysis takes a formal context, essentially a table stating which objects possess which attributes, and derives from it a lattice of concepts. Each concept pairs a set of objects, called its extent, with the set of attributes they all share, called its intent. The resulting lattice is not just a list; it is a hierarchy, revealing how general and specific concepts nest inside one another. Biologists have used it to classify species, engineers to organize software libraries, and data miners to surface association rules in transaction data.

But the classical theory assumes the table is complete: every cell is a definite yes or no. The moment question marks appear, the elegant machinery stalls. A patient may or may not exhibit a symptom, a customer may or may not have bought a product, and the raw data simply does not say. Researchers have long responded by considering completions, hypothetical fully specified tables consistent with what is known. Among all possible completions, two stand out: the least completion, which fills every unknown with the most conservative answer possible, and the greatest completion, which fills them with the most generous one. Concepts in these two boundary tables bracket the truth, but computing them, and then computing their concept lattices, can be expensive, and the relationship between what they contain and what the incomplete table itself can reveal has remained murky.

That is precisely the gap the Xi’an team set out to close. Their starting point is a family of structures called partially-known formal concepts, introduced in earlier work to capture two intuitive modes of uncertainty: objects that jointly certainly possess a set of attributes, and objects that jointly possibly possess them. These ideas echo the possibility-theoretic reading of formal concept analysis developed by Didier Dubois, Florence Dupin de Saint-Cyr, and Henri Prade, and the interval-set perspective of Ying-Yu Yao, which treats an uncertain set as a pair of lower and upper bounds. Partially-known formal concepts come in three specific flavors, known as SE-ISI, ISE-SI, and ISE-ISI concepts, each defined through different combinations of upper and lower derivation operators that probe the incomplete context from different directions. Together with the classical formal concepts found in the least and greatest completions, they form four types of concepts, each illuminating a different facet of the same patchy data.

The first major contribution of the new paper is a thorough map of the connections among these four types. Because every one of them is ultimately defined by the same upper and lower derivation operators, the authors suspected, and then proved, that deep structural relationships must bind them. They show precisely how a partially-known concept relates to concepts in the least and greatest completions, establishing conditions under which one can be recovered from the other. This is more than an exercise in mathematical housekeeping. It means that knowledge extracted from a completed version of the data, which may be easier to compute in some settings, can be translated back into statements about the partially-known concepts of the raw incomplete table, and vice versa. The incomplete context, in other words, is not a impoverished cousin of a complete one; it carries enough structure to reconstruct much of what the completions would tell you, if you know how to read it.

The second contribution turns this theory into construction methods. The concept lattice of a partially-known structure, the hierarchical arrangement of all its concepts, can be built from the corresponding formal concept lattices of the completions, rather than from scratch. The authors also examine the relationships among the three kinds of partially-known concepts from two complementary viewpoints: the level of single concepts, and the level of entire collections of extents and intents. On both levels they demonstrate explicit methods for mutual conversion, showing how an SE-ISI concept can be transformed into an ISE-SI concept, and how the families of extents and intents of one type relate to those of another. These conversion procedures give practitioners a kind of Rosetta Stone: once any one of the four concept structures has been computed, the others become accessible through systematic translation rather than independent, redundant computation.

The practical payoff arrives in the third contribution: algorithms. Tian and colleagues designed algorithms that acquire partially-known formal concepts directly from already-computed formal concepts, leveraging the theoretical connections to avoid re-deriving everything from the incomplete table. They then stress-tested these algorithms experimentally, and crucially, they did so under different data missing mechanisms, the statistical regimes that statisticians distinguish as missing completely at random, missing at random, and more structured forms of absence. This matters because real datasets do not lose entries uniformly; missingness often correlates with the very attributes that matter most. An algorithm that is stable only under idealized random deletion would be of limited use in practice. The experiments, whose underlying datasets the authors have made available in a public repository, demonstrate that the proposed methods are both feasible and stable across these regimes, with a particularly striking result: when the incomplete contexts contain relatively few concepts, the algorithms exhibit superior performance.

That last finding may sound like a limitation, but it points to a sweet spot that is common in applied settings. Many real tables, especially those built from expert judgment or curated ontologies, are small in object and attribute counts even when riddled with unknowns. For such data, the new approach offers a way to squeeze every defensible drop of knowledge out of what is known, without pretending to know what is not. The work also connects to a broader research program on three-way concept analysis and concept-cognitive learning, in which the same Xi’an group and collaborators worldwide have been developing tools for reasoning under partial information, from attribute reduction in three-way concept lattices to dynamic updating of concepts as new data arrives. The new paper can be read as a unifying chapter in that program, tying together threads that had previously been studied in isolation.

For the wider field of artificial intelligence, the significance lies in the growing recognition that uncertainty is not noise to be cleaned away but structure to be modeled. Machine learning systems increasingly must operate on incomplete knowledge graphs, partially observed relational data, and sparse feature matrices, and formal concept analysis offers a symbolic, interpretable complement to statistical and neural approaches. By proving that the four concept types of an incomplete context form a coherent, inter-translatable system, and by delivering algorithms that exploit this coherence, the study gives knowledge engineers a principled toolkit for a problem that will only grow as data-hungry systems meet an imperfect world. The mathematics of missing entries, it turns out, has its own hidden lattice, and we are only beginning to climb it.

Subject of Research: Connections among formal and partially-known formal concepts in incomplete formal contexts

Article Title: A further understanding for four types of concepts in incomplete contexts based on their connections

Article References: Tian, X., Ren, R., Wei, L., & She, Y. (2026). A further understanding for four types of concepts in incomplete contexts based on their connections. Applied Intelligence, 56(15), Article 460. https://doi.org/10.1007/s10489-026-07311-0

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07311-0

Keywords: formal concept analysis, incomplete formal contexts, partially-known formal concepts, concept lattices, three-way concept analysis, missing data, knowledge acquisition, derivation operators, concept-cognitive learning, data mining, applied intelligence, uncertainty modeling

T-spherical fuzzy sets are a generalization that has been gaining traction because they let modelers record three independent degrees of membership: a positive degree expressing support for an alternative, a neutral or abstinence degree expressing indecision, and a negative degree expressing opposition. Where an ordinary fuzzy set records a single number between zero and one, and intuitionistic or picture fuzzy sets record two or three tightly constrained degrees, the T-spherical framework adds a tunable parameter t that controls how many graded levels each membership degree can take. This makes the framework expressive enough to represent panel opinions in which several experts disagree in structured ways, but it also raises a subtle mathematical question: how do you measure how different two such rich, multi-dimensional judgments are?

That question is answered by divergence measures, the information-theoretic cousins of distance functions. A divergence quantifies the discrepancy between two uncertain descriptions, and it underpins everything from clustering algorithms to decision rules. The most famous example, the Kullback-Leibler divergence, compares probability distributions by averaging the logarithm of their likelihood ratios. Researchers had already extended the Kullback-Leibler idea to T-spherical fuzzy sets, but the new paper documents a serious practical flaw in that extension: whenever any of the membership, non-membership, or abstinence components approaches zero, the logarithm drives the divergence toward an undefined value. Since zero evaluations are common in real-world rating data, the existing measure can simply fail to produce an answer precisely when practitioners need one.

A second existing measure, developed earlier by Huang and colleagues, suffers from the opposite problem. Its formulation is built on exponential terms, which means it produces unbounded positive values. Even small differences between two T-spherical fuzzy values can yield enormous divergence numbers, which makes interpretation difficult and can distort downstream rankings. In other words, the two available tools for measuring disagreement in this framework were either undefined at boundary cases or numerically explosive, leaving a genuine gap in the toolbox for anyone working with T-spherical fuzzy data.

The authors close that gap by constructing new divergence measures and then rigorously verifying their axiomatic properties. In the fuzzy-set literature, a divergence measure is not just any formula that outputs a number; it must satisfy axioms such as being zero only when the two sets are identical, being symmetric in its arguments, and behaving monotonically as the sets become more different. The paper carries out a thorough mathematical investigation to show that the proposed measures meet these requirements, ensuring theoretical soundness rather than merely plausible behavior. This axiomatic grounding matters because downstream algorithms inherit the reliability, or the flaws, of the divergence they are built upon.

From the new divergence, the team builds two practical engines. The first is a divergence-based version of TOPSIS, a widely used multi-criteria decision-making technique whose name stands for Technique for Order of Preference by Similarity to Ideal Solution. Classical TOPSIS ranks alternatives by their geometric closeness to an ideal option and their remoteness from an anti-ideal one. The new formulation replaces the usual distance computations with the proposed divergence, so the ranking of alternatives reflects information-theoretic disagreement between fuzzy evaluations rather than simple Euclidean separation. Alongside it, the authors introduce a fresh method for determining the weights of criteria when the underlying data are spherical fuzzy, addressing the perennial problem that some evaluation criteria matter more than others and that those weights are themselves uncertain.

The second application pushes the divergence into machine learning territory: the authors extend a pattern classification algorithm so that it can operate on T-spherical fuzzy descriptions. Classification with fuzzy divergence works by measuring how far an unclassified object’s fuzzy feature profile diverges from the profiles of known classes, assigning the object to the class with the smallest divergence. Because the new measures stay defined across the full range of possible evaluations, the classifier does not stumble on boundary cases that would crash or distort a Kullback-Leibler-based approach.

To demonstrate that the framework survives contact with reality, the researchers validate it through a case study on selecting an all-rounder cricketer for a test-match competition under uncertain and imprecise evaluation conditions. The scenario is a natural fit for the method: cricket all-rounders must be judged simultaneously on batting, bowling, and fielding, and scouts’ opinions about each skill are naturally expressed with degrees of agreement, hesitation, and disagreement. The T-spherical fuzzy representation captures those layered opinions, and the divergence-based TOPSIS method converts them into a defensible ranking of candidates.

Crucially, the authors do not stop at a single worked example. They conduct sensitivity analyses to check whether small perturbations in the fuzzy evaluations or the criterion weights destabilize the ranking, comparative analyses to benchmark the new measures against the existing Kullback-Leibler-style and exponential-style alternatives, and numerical experiments to probe behavior across parameter settings. The reported results confirm that the proposed framework is stable, effective, and superior to prior approaches in the tested scenarios, and that it enhances both the interpretability and the reliability of decisions made under T-spherical fuzzy conditions. Interpretability is the quieter but arguably more important gain: because the divergence values remain bounded and defined, decision makers can actually read the numbers they are given rather than wrestling with infinities or wildly scaled outputs.

The significance of the work extends beyond cricket selection boards. Multi-criteria decision making under uncertainty appears in supplier selection, medical diagnosis, environmental assessment, and recommender systems, and pattern classification with fuzzy features is relevant wherever expert-labeled data carry hesitation and dissent. By supplying divergence measures that are axiomatically sound and numerically robust across the entire evaluation range, the study gives researchers and practitioners a dependable foundation for building such systems on T-spherical fuzzy data. The paper, published open access on 24 September 2026 in the Journal of Big Data, was supported by Rajamangala University of Technology Phra Nakhon, and its authors declare no competing interests. As fuzzy frameworks grow richer to match the messiness of human judgment, the mathematics for comparing those judgments must keep pace, and this contribution marks a substantial step in that direction.

Subject of Research: Divergence measures for T-spherical fuzzy sets applied to multi-criteria decision making and pattern classification

Article Title: Divergence measures for T-spherical fuzzy sets with applications to multi-criteria decision making and pattern classification

Article References: Khan, M. J., Al-Kenani, A. N., Muangchoo, K., & Ekvittayaniphon, S. (2026). Divergence measures for T-spherical fuzzy sets with applications to multi-criteria decision making and pattern classification. Journal of Big Data. https://doi.org/10.1186/s40537-026-01565-8

Image Credits: AI Generated

DOI: 10.1186/s40537-026-01565-8

Keywords: T-spherical fuzzy sets, divergence measures, multi-criteria decision making, TOPSIS, pattern classification, fuzzy set theory, uncertainty modeling, Kullback-Leibler divergence, criteria weights, sports analytics, cricket, Journal of Big Data

The study, published in the journal Cleaner Engineering and Technology, introduces an intuitionistic fuzzy deep neural network (IFDNN) method designed to overcome one of the most stubborn problems in industrial safety engineering: uncertainty. Traditional risk assessment models, however sophisticated, ultimately force messy, incomplete, and subjective real-world information into neat numerical categories. The researchers argue that this simplification is precisely where safety margins are lost, because the world of pipeline integrity is governed not by crisp numbers but by vague expert judgments, sparse inspection records, and damage mechanisms that evolve in ways no single probability distribution can capture.

Lead author Tri Wahono and colleagues Imam Mukhlash, Endah R.M. Putri, and Agung Purniawan built their model on a mathematical foundation first laid out in 1986, when mathematician Krassimir Atanassov extended classical fuzzy set theory. Ordinary fuzzy logic, pioneered by Lotfi Zadeh in 1965, allows an element to belong to a set to a partial degree, capturing the vagueness of linguistic judgments such as “corrosion risk is fairly high.” Intuitionistic fuzzy sets go one step further by assigning each element both a membership degree and a non-membership degree, with the gap between them representing an explicit hesitation component. This three-part structure means the model does not merely say how strongly a factor contributes to risk, but also how strongly it does not, and how much doubt remains in between.

The new framework unfolds in three carefully sequenced stages. First, the team anchored their approach in two established industry standards, the Kent Muhlbauer pipeline risk model and the American Petroleum Institute’s RP 581 risk-based inspection methodology, which together organize pipeline threats into eight main factors and thirty-one sub-factors. Failure probability is evaluated against corrosion, third-party damage, sabotage, incorrect operation, and geohazards, while consequences are assessed across safety, environmental, and financial dimensions, each rated on a scale from one to five. In the second stage, these numerical ratings are transformed into triangular intuitionistic fuzzy numbers through a fuzzification process, allowing every judgment about the pipeline to carry its own envelope of uncertainty.

At the heart of the method sits an intuitionistic fuzzy inference system built on the Mamdani architecture, which propagates fuzzy, rather than fixed, output values through a rule base of conditional statements. For the probability of failure alone, combining five input factors across five linguistic categories generates 3,125 distinct intuitionistic fuzzy implications, while the three consequence factors generate another 125. Each rule computes a membership degree through a sup-min operator and a non-membership degree through an inf-max operator, aggregating thousands of rules into a coherent fuzzy picture of risk. A tunable defuzzification operator then converts these fuzzy outputs back into crisp numbers, with a parameter that lets analysts decide how sensitive the final risk score should be to lingering uncertainty.

The third stage is where deep learning enters. The intuitionistic fuzzy membership and non-membership degrees produced by the inference system become the training inputs for a deep neural network constructed in TensorFlow-Keras. After systematic experimentation, the researchers settled on a feedforward architecture with four fully connected hidden layers of 128, 64, 32, and 16 neurons, using the Gaussian error linear unit (GELU) activation function, which outperformed ReLU and SiLU alternatives. Trained with the Adam optimizer on data split into 70 percent training, 20 percent testing, and 10 percent validation subsets, the network achieved an R-squared of 0.99443 with a mean squared error of just 0.000101, performance the authors describe as robust across training, testing, and validation data alike.

The model was not tested on toy data. The case study drew on approximately 1,750 kilometers of onshore upstream oil and gas pipelines spread across 15 operational fields, divided into 19,405 sub-segments. Diameters ranged from 4 to 40 inches and asset ages from under a decade to more than half a century, capturing the full diversity of a mature pipeline estate, including aging networks near populated areas where decades of corrosion pose genuine integrity concerns. The network transports produced fluids from wells to processing facilities, produced water to injection wells, and crude oil to storage and refinery units, providing exactly the kind of heterogeneous operating conditions that break simpler models.

The comparative results are striking. Where the traditional Muhlbauer-based model classified the first of three representative pipeline segments as high risk, the intuitionistic fuzzy deep neural network downgraded it to medium risk after properly weighing the relative importance of each contributing factor. Segment 2 remained medium risk, while Segment 3, an aging transmission line near public and environmentally sensitive areas, was consistently flagged as highest risk by all three approaches. Crucially, the risk prioritization order survived the transition to the new model, with Segment 3 ranking above Segment 1 and Segment 2 last, demonstrating that the hybrid method sharpens resolution without distorting the underlying risk landscape. Corrosion emerged as the dominant driver of failure probability, pointing operators toward targeted interventions: high-resolution internal inspection, chemical injection programs suited to specific mechanisms such as microbiologically influenced corrosion or CO2 corrosion, protective coatings, and repair or replacement of sections failing fit-for-service criteria.

The practical implications extend well beyond academic benchmarking. Because risk-based inspection concentrates resources where they matter most, a model that more accurately distinguishes high-risk from low-risk equipment translates directly into fewer unnecessary inspections, longer intervals between interventions on genuinely safe segments, and lower lifecycle costs without sacrificing safety. The researchers emphasize that overestimating risk is expensive in its own right, since inspecting low-risk equipment more frequently drains budgets that could be protecting genuinely dangerous assets. They envision the framework transforming fixed-cycle inspection plans into predictive, risk-informed maintenance programs, though they caution that successful deployment requires user training, data validation, phased integration, and pilot testing. Limitations remain: the model has so far been validated only on onshore pipelines, does not yet capture interactions among multiple simultaneous threats, and would benefit from integration with real-time monitoring for dynamic risk prediction. Extending the framework to offshore systems and to the tangled dependencies among corrosion, mechanical damage, and material defects stands as the team’s next frontier in the ongoing effort to keep the world’s energy arteries safe.

Subject of Research: A hybrid intuitionistic fuzzy deep neural network method for risk assessment of oil and gas pipelines

Article Title: An intuitionistic fuzzy deep neural network method for risk assessment of oil and gas pipelines

Article References: Wahono, T., Mukhlash, I., Putri, E. R., & Purniawan, A. (2026). An intuitionistic fuzzy deep neural network method for risk assessment of oil and gas pipelines. Cleaner Engineering and Technology, 34, Article 101299. https://doi.org/10.1016/j.clet.2026.101299

Image Credits: AI Generated

DOI: 10.1016/j.clet.2026.101299

Keywords: oil and gas pipelines, risk assessment, intuitionistic fuzzy sets, deep neural networks, risk-based inspection, pipeline integrity management, artificial intelligence, corrosion, fuzzy logic, uncertainty modeling, machine learning, asset integrity