Multi-view classification aims to improve prediction performance by integrating heterogeneous data sources, leveraging the complementary and consistent information across different views. However, existing approaches predominantly focus on consistency and complementarity, often overlooking the role of diversity, which is crucial for enhancing generalization and mitigating redundancy. To address these issues, we propose a Tri-perspective Multi-view Fusion and Classification (TMFC) framework that systematically unifies consistency, complementarity, and diversity principles. TMFC consolidates multi-view data into a meta-view through feature concatenation and generates diverse latent views via random mapping, preserving structural information while reducing redundancy. These latent views are optimized through a unified formulation that balances alignment, information enrichment, and feature distinctiveness, reformulated as a semidefinite programming problem and efficiently solved using the reformulation-linearization technique with a cutting-plane algorithm. Extensive experiments on real-world datasets demonstrate TMFC’s superiority over state-of-the-art methods, achieving significant improvements in accuracy, normalized mutual information, and adjusted rand index.

In cross-modal retrieval, the hashing technique has sparked a great revolution because of its competitive query speed and minimal storage. However, existing approaches may have critical limitations: 1) Label Intrinsic Relations. They barely explore category information inherent in labels and only consider labels as distinct entities, losing rich latent semantic information. 2) Modality-specific and Modality-coherence Semantics. They often construct a common subspace and an affinity matrix to learn modality-specific features and modality-coherence correlations, respectively. The former will lead to considerable quantization errors because the subspaces should be approximate rather than exactly equal. The latter is not scalable due to its high computational costs. 3) Non-relaxation Optimization Strategy. To solve constraints, some approaches relax the binary constraints to continuous, rising significant quantization errors. To mitigate these problems, we propose Disperse Asymmetric Subspace Relation Hashing, termed DASRH. In particular, it first embeds modality-specific kernel features into dispersed latent spaces, which can effectively fuse heterogeneous patterns. Additionally, it exploits fine-grained categories from labels by reconstructing collective semantic representations, making discriminative binary codes. Furthermore, it constructs an asymmetric consistent relation integration, preserving both inter-modal disparities and intra-class differences. In the optimization process, an effective alternative iterative optimization scheme is established. Theoretical analysis and comprehensive experiments highlight the advantages of our DASRH against cutting-edge technology.

Information granularity and information granules are fundamental concepts that permeate the entire area of granular computing. With this regard, the principle of justifiable granularity was proposed by Pedrycz, and subsequently a general two-phase framework of designing information granules based on Fuzzy C-means clustering was successfully developed. This design process leads to information granules that are likely to intersect each other in substantially overlapping clusters, which inevitably leads to some ambiguity and misperception as well as loss of semantic clarity of information granules. This limitation is largely due to imprecise description of boundary-overlapping data in the existing algorithms. To address this issue, the rough k -means clustering is introduced in an innovative way into Pedrycz's two-phase information granulation framework, together with the proposed local boundary fuzzy metric. To further strengthen the characteristics of support and inhibition of boundary-overlapping data, an augmented parametric version of the principle is refined. On this basis, a local boundary fuzzified rough k -means-based information granulation algorithm is developed. In this manner, the generated granules are unique and representative whilst ensuring clearer boundaries. The validity and performance of this algorithm are demonstrated through the results of comparative experiments.

In feature selection research, simultaneous multi-class feature selection technologies are popular because they simultaneously select informative features for all classes. Recursive feature elimination (RFE) methods are state-of-the-art binary feature selection algorithms. However, extending existing RFE algorithms to multi-class tasks may increase the computational cost and lead to performance degradation. With this motivation, we introduce a unified multi-class feature selection (UFS) framework for randomization-based neural networks to address these challenges. First, we propose a new multi-class feature ranking criterion using the output weights of neural networks. The heuristic underlying this criterion is that "the importance of a feature should be related to the magnitude of the output weights of a neural network". Subsequently, the UFS framework utilizes the original features to construct a training model based on a randomization-based neural network, ranks these features by the criterion of the norm of the output weights, and recursively removes a feature with the lowest ranking score. Extensive experiments on 15 real-world datasets suggest that our proposed framework outperforms state-of-the-art algorithms. The code of UFS is available at https://github.com/SVMrelated/UFS.git.

Cross-modal hashing utilize the advantages of hash codes to enable flexible retrieval across different modalities, greatly improving the retrieval efficiency of heterogeneous modes. However, most existing approach do not fully take modal intrinsic semantic properties and semantic category structure into consideration during learning the latent subspace. In addition, previous theory works commonly focus on binary pairwise similarity, without investigating the rich semantic contained in the label matrix. To alleviate these problems, in this study, we present a novel cross-media retrieval approach, termed SEmantic preserving Asymmetric discrete Hashing (SEAH), which constructs an asymmetric scheme to learn the binary codes from the common representation to maintain the similarity. Specially, we incorporate label matrix and hash codes into a mutual mapping framework, the learned hash codes are more discriminative. Moreover, we introduce the Augmented Lagrange Multiplier (ALM) algorithm for optimization, which make it easier to solve the objective functions. Comprehensive systematically experiments on two benchmark datasets demonstrate that our approach achieves promising performance gain and outperforms the several state-of-the-art works.

Rough K-Means (RKM) is an efficient clustering algorithm for overlapping datasets, and has captured increasing attention in recent years. RKM algorithms are the main focus on the further description of uncertain objects located in boundary regions in order to improve the performance. However, most available RKM algorithms fail to pay attention to the influence of imbalanced clusters, together with imbalanced spatial distributions (i.e., the cluster density) and differing cluster sizes (i.e., the number of object ratios). This paper seeks to address this deficiency and examines in detail some adverse effects caused by imbalanced clusters. To mitigate adverse effects of imbalanced clusters and decrease the computational cost, an interval type-2 fuzzy local measure for the RKM clustering is proposed, on the basis of which, a novel RKM clustering algorithm has been developed that specifically gives due consideration to imbalanced clusters. The effectiveness and superiority of this algorithm are demonstrated through simulation and experimental analysis.

Due to the strong intermittency and volatility and the increasing proportion of photovoltaic (PV) power in the power grid, the PV power prediction becomes more and more important for the reliability of the power grid. Neural network is a popular model that used for PV power prediction. However, traditional neural networks prediction model that relies solely on the offline training cannot adapt well to the dynamic changes of PV power station. To cope with this problem, the very short-term online forecasting model for PV power based on two-stage resource allocation network (RAN) is presented. Firstly, the RAN model is offline trained to determine the initial structure. Thereafter, the initial RAN model is used for online forecasting, in this stage, the forecasting model is further updated. The simulation results show that the two-stage RAN model can effectively improve the forecasting accuracy of the PV power output.

With the rapid development of microgrids, generator excitation control for multi-machine systems to improve the stability of power systems has become a key technical problem. This paper presents an excitation controller design for a typical two-machine system. According to the characteristics of strong nonlinearity, load disturbance and time-varying uncertainty, conventional PID control schemes cannot meet the high quality requirement of excitation control for two- machine systems. A Resource Allocation Network (RAN) based neural PID adaptive generator excitation control is proposed for two-machine systems. The parameters of the PID controller can be adjusted dynamically according to the RAN-enabled online model. The validity of the proposed control strategy is demonstrated by the simulation results.