Trusted multi-view classification (TMC) aims to improve prediction reliability by integrating evidence from multiple views. Existing TMC methods extract evidence from single view and use a regularization term to shape the evidence distribution. However, existing methods typically enforce a uniform regularization objective across all views, overlooking critical view-specific biases: intra-view class ambiguity caused by confusable features and inter-view quality disparities reflected in evidence uncertainty. To address these issues, we propose an adaptive regularization strategy that enhances robustness on two levels. At the intra-view level, it quantifies feature ambiguity to apply targeted relaxation to confusable classes, preventing over-penalization of inherent uncertainty. At the inter-view level, it evaluates relative view quality to impose stronger constraints on unreliable views and suppress noise from low-quality ones. Extensive experiments across multiple benchmarks demonstrate the superiority and reliability of the proposed method.

Active retrieval-augmented generation (RAG) triggers external knowledge retrieval during generation based on model-side uncertainty signals to support knowledge-intensive, multi-hop reasoning. However, existing methods often retrieve only after producing a complete answer, failing to surface and fill information gaps in time; moreover, relying on a single internal signal as the trigger cannot adequately capture the multifaceted nature of uncertainty. We therefore propose a conflict-aware active RAG framework. We first decompose complex questions into a sequence of step-level sub-problems. At each step, we quantify local distributional uncertainty via a sliding-window peak token entropy, and estimate cross-sample consensus via the variation ratio computed over multiple Monte Carlo samples. After calibrating both signals onto a probabilistic scale, we quantify their conflict using a symmetric, bounded divergence over Bernoulli parameters, and fuse the three quantities into a single uncertainty score that gates retrieval. Experiments demonstrate the effectiveness of our framework.

Cross-modal retrieval aims to match videos and texts by mapping them into a shared feature space. Most existing approaches achieve alignment through contrastive learning based on one-to-one supervised pairs. However, these methods rely too much on supervised signals and do not fully use the unsupervised semantic relationships within each modality. As a result, samples that are semantically similar may be spread in the shared space, which hurts retrieval performance. To solve this problem, we propose a method called Leveraging Intra-Modal Consistency for Cross-Modal Alignment and Retrieval (LICA). Our method introduces a consistency constraint between intra-modal similarities and cross-modal similarity distributions. In this way, samples that are close in meaning stay closer together in the shared space. Experiments on standard text-video retrieval benchmarks show that LICA helps optimize the distribution of the cross-modal feature space and improves retrieval accuracy.

Medical image diagnosis inherently involves uncertainty due to artifacts, occlusions, and ambiguous visual patterns, often leading to high inter-observer variability. While deep neural networks offer strong predictive performance, their outputs tend to be overconfident and poorly calibrated, limiting their clinical reliability. We propose Conformal Focal Loss (CFL), a principled approach that leverages the focal loss and the statistical validity of conformal prediction to better characterize diagnostic uncertainty. By emphasizing hard or ambiguous examples, CFL enables more accurate estimation of both predictive confidence and ambiguity. We evaluate CFL on diagnostic tasks using both clean and noise-augmented datasets, demonstrating its ability to effectively identify uncertain cases while maintaining robust classification performance under label noise.

Trustworthy multi-view classification is essential for safety-critical applications, yet existing methods often fail when view quality degrades at test time due to noise or domain shifts. We propose a novel test-time adaptive fusion framework that leverages Conformal Prediction (CP) to transform pre-trained single-view classifier outputs into robust evidence representations. By integrating CP with Dempster-Shafer Theory, our approach dynamically generates well-calibrated evidence for each view, enabling reliable fusion under arbitrary view conditions without retraining. Extensive experiments demonstrate that our method achieves competitive performance on clean data and significantly outperforms prior methods in the presence of view corruption, offering a practical solution for robust multi-view classification in real-world scenarios.

Gradient-based methods provide a principled framework for Active Learning (AL), effectively quantifying a sample’s informativeness through the uncertainty captured from the model’s internal dynamics. However, their effectiveness is often hindered by the failure to disentangle epistemic and aleatoric uncertainty. This can lead to the suboptimal selection of noisy outliers over truly informative samples. To address this, we propose Dual-View Gradient Probes (DVGradProb), a framework that disentangles these uncertainties by probing gradients from two complementary spaces. Specifically, epistemic uncertainty is captured from the parameter space and introduce a novel metric for aleatoric uncertainty from the feature space. These metrics are integrated into a ratio-based acquisition function designed to filter out noisy outliers while prioritizing truly informative samples, those with high epistemic but low aleatoric uncertainty. Experiments on MNIST, CIFAR-10, and SVHN demonstrate that DVGradProb robustly outperforms baselines, validating the effectiveness of this uncertainty disentanglement strategy.

The performance of k-means clustering is often degenerate when dealing with high-dimensional and noisy scenarios. In this study, an end-to-end robust clustering method with low-rank linear embedding techniques (RCLR) is presented in conjunction with k-means. Sparse coefficients and a space projection matrix can be simultaneously learned. The global structures and local neighborhood properties are well captured in the learning procedures. Both the processes of clustering and dimensionality reduction are realized at the same time. The notions of clustering, dimensionality reduction, low-rank representation, and local property preservation are seamlessly integrated into a unified model. The limitation of error accumulation encountered in the previous two-stage clustering framework involving low-rank representation can be alleviated. This is the first attempt to introduce both the global and local geometrical structures into k-means directly, as well L2,1-norm is used as a basic metric instead of the conventional F-norm to further improve the robustness and interpretation of the model. The superiority of the proposed RCLR method is demonstrated by extensive experiments completed on various well-known benchmark datasets.

Labeling cerebral vessels requires domain knowledge in neurology and could be extremely laborious, and there is a scarcity of public annotated cerebrovascular datasets. Traditional machine learning or statistical models could yield decent results on thick vessels with high contrast while having poor performance on those regions of low contrast. In our work, we employ a statistic model as noisy labels and propose a Transformer-based architecture which utilizes Hessian shape prior as soft supervision. It enhances the learning ability of the network to tubular structures, so that the model can make more accurate predictions on refined cerebrovascular segmentation. Furthermore, to combat the overfitting towards noisy labels as model training, we introduce an effective label extension strategy that only calls for a few manual strokes on one sample. These supplementary labels are not used for supervision but only as an indicator to tell where the model keeps the most generalization capability, so as to further guide the model selection in validation. Our experiments are carried out on a public TOF-MRA dataset from MIDAS data platform, and the results demonstrate that our method shows superior performance on cerebrovascular segmentation which achieves Dice of 0.831±0.040 in the dataset.

Bladder cancer is a malignant disease with substantial morbidity and mortality. Bladder cancer staging is crucial to determine the effective treatments of bladder tumors in clinic. As to the superiority of feature learning, Deep Convolutional Neural Networks (DCNN) are widely used to predict the cancer stage based on medical images. However, most existing DCNN-based cancer staging methods are data-driven and neglect the domain knowledge and experiences of clinicians. Besides, the deep neural networks are short of model interpretability and may lead to risky diagnosis. To tackle the problems, we construct the diagnosis rules of bladder cancer staging based on the clinical experiences of tumor penetration into bladder wall. The diagnosis rules are extracted from Magnetic Resonance (MR) images and further integrated into DCNN for joint identification of tumor stage. The experiments validate that the integrated rules improve the model interpretability and guide DCNN to focus on the regions of tumor penetration and thereby produce precise prediction of cancer staging.

Shadowed sets provide a meaningful description of information granules by abstracting the corresponding fuzzy sets into three categories: full acceptance, full rejection, and uncertain (represented by shadows). One of the main motivating points to derive shadowed sets from fuzzy sets is the determination and explanation of the separation thresholds based on a specific optimization mechanism. The available optimization objective functions are mainly discussed on semantic interpretations and their mathematical properties; constructive algorithms for optimal solutions have rarely been reported. In this paper, the continuous and convex properties of Pedrycz's optimization objective function to construct shadowed sets, as well as the existence and uniqueness of solution points, are analyzed in detail. It is demonstrated that different approximation region partitions would be generated even under the same optimization model, which requires further criteria to make the constructed shadowed sets well-defined. To address this limitation, the notions of passive and active constrained shadowed sets are introduced. A fast algorithm to obtain the proposed constrained shadowed sets is also designed based on the analyzed mathematical properties. Its performance is then illustrated by some typical fuzzy sets and some real data from the UCI repository.

With the information overload in web services, micro-blog has been increasingly providing as a media for end-users to express their opinions. The notable feature of micro-blog articles is prone to be a burst of popularity during a short period. In addition, diverse interests make users bored in redundant items in most recommender systems. Therefore, providing users with diverse popular micro-blogs that suit their interesting topics is an important issue. In this paper, depending on forwarding number and comment number of micro-blogs, an effective model for popularity prediction is proposed to discover popular topics. Then, a MaxMin diversity algorithm based on content distance and popularity density is proposed to discover top k micro-blogs. Finally, we design a diverse personalized popularity attention (DPPA) recommendation approach for target user. We conduct extensive experiments on large scale micro-blog datasets. The experimental results show that our proposed approach can satisfy user's requirements with a higher recall than personal attention methods.