At present, most collaborative filtering algorithms use similarity as a criterion. In order to alleviate problems of cold start and sparsity in recommender system, a Collaborative Filtering Algorithm Combined with the Singular Value Decomposition (SVD) and Trust Factors (CFSVD-TF) is presented. Further mining data features, we use the SVD to mining data features to gain the implicit Items feature space, then the items-based similarity are computed by using the improved cosine similarity. The trust factor is integrated into the similarity space to generate the computable trust model. Finally, to evaluate the proposed CFSVD-TF approach, the accuracy of the CFSVD-TF algorithm has significantly improved than the traditional CF algorithm in MovieLens datasets.

Hyperspectral imagery (HSI) classification, which attempts to assign hyperspectral pixels with proper labels, has drawn significant attention in various applications. Recently, the graph-based semi-supervised learning (SSL) approaches have shown the outstanding ability to handle the situation of limited labeled data for classification task. However, it is hard to construct the pairwise adjacent graph due to the high dimensionality of hyperspectral data. Besides, the graph-based SSL models are usually decided by a single classifier, which fail to effectively learn the complex structures and intrinsic properties of HSI. To address these problems, we propose a novel graph-based SSL classification model for HSI, which is based on Random Multi-Graphs construction and Ensemble strategy (RMGE). Specifically, the anchor graph (AG) is constructed with spatial-spectral features, which integrates the spatial characteristics extracted by local binary pattern (LBP) on each selected spectrum, preserving fine structures of local region. In order to enhance the discriminative capability of the classifier and avoid the trivial solution, the maximum entropy regularization is added into adjacent AG model. In addition, to capture the diversity of HSI data effectively, we design the ensemble framework by employing multiple AGs to learn HSI features. Experiments conducted on real hyperspectral datasets indicate that the proposed RMGE shows better performance than that of state-of-the-art approaches.

No abstract

No abstract

Graph-based semi-supervised learning methods, which deal well with the situation of limited labeled data, have shown dominant performance in practical applications. However, the high dimensionality of hyperspectral images (HSI) makes it hard to construct the pairwise adjacent graph. Besides, the fine spatial features that help improve the discriminability of the model are often overlooked. To handle the problems, this paper proposes a novel spatial-spectral HSI classification method via multiple random anchor graphs ensemble learning (RAGE). Firstly, the local binary pattern is adopted to extract the more descriptive features on each selected band, which preserves local structures and subtle changes of a region. Secondly, the adaptive neighbors assignment is introduced in the construction of anchor graph, to reduce the computational complexity. Finally, an ensemble model is built by utilizing multiple anchor graphs, such that the diversity of HSI is learned. Extensive experiments show that RAGE is competitive against the state-of-the-art approaches.