SYShanshan Yu

Shanshan Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Shanshan Yu has a total of 15 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Tensor-Based Uncoupled and Incomplete Multi-View Clustering

    by Yapeng Liu, Wei Guo, Weiyu Li, Jingfeng Su, Qianlong Zhou, Shanshan Yu

    Multi-view clustering demonstrates strong performance in various real-world applications. However, real-world data often contain incomplete and uncoupled views. Missing views can lead to the loss of latent information, and uncoupled views create obstacles for cross-view learning. Existing methods rarely consider incomplete and uncoupled multi-view data simultaneously. To address these problems, a novel method called Tensor-based Uncoupled and Incomplete Multi-view Clustering (TUIMC) is proposed to effectively handle incomplete and uncoupled data. Specifically, the proposed method recovers missing samples in a low-dimensional feature space. Subsequently, the self-representation matrices are paired with the optimal views through permutation matrices. The coupled self-representation matrices are integrated into a third-order tensor to explore high-order information of multi-view data. An efficient algorithm is designed to solve the proposed model. Experimental results on five widely used benchmark datasets show that the proposed method exhibits superior clustering performance on incomplete and uncoupled multi-view data.


  • Open Access

    Constrained Symmetric Non-Negative Matrix Factorization with Deep Autoencoders for Community Detection

    by Wei Zhang, Shanshan Yu, Ling Wang, Wei Guo, Man-Fai Leung

    Recently, community detection has emerged as a prominent research area in the analysis of complex network structures. Community detection models based on non-negative matrix factorization (NMF) are shallow and fail to fully discover the internal structure of complex networks. Thus, this article introduces a novel constrained symmetric non-negative matrix factorization with deep autoencoders (CSDNMF) as a solution to this issue. The model possesses the following advantages: (1) By integrating a deep autoencoder to discern the latent attributes bridging the original network and community assignments, it adeptly captures hierarchical information. (2) Introducing a graph regularizer facilitates a thorough comprehension of the community structure inherent within the target network. (3) By integrating a symmetry regularizer, the model’s capacity to learn undirected networks is augmented, thereby facilitating the precise detection of symmetry within the target network. The proposed CSDNMF model exhibits superior performance in community detection when compared to state-of-the-art models, as demonstrated by eight experimental results conducted on real-world networks.


  • Open Access

    Community Detection in Multiplex Networks Using Orthogonal Non-Negative Matrix Tri-Factorization Based on Graph Regularization and Diversity

    by Yuqi Yang, Shanshan Yu, Baicheng Pan, Chenglu Li, Man-Fai Leung

    In recent years, community detection has received increasing interest. In network analysis, community detection refers to the identification of tightly connected subsets of nodes, which are called “communities” or “groups”, in the network. Non-negative matrix factorization models are often used to solve the problem. Orthogonal non-negative matrix tri-factorization (ONMTF) exhibits significant potential as an approach for community detection within multiplex networks. This paper explores the application of ONMTF in multiplex networks, aiming to detect both shared and exclusive communities simultaneously. The model decomposes each layer within the multiplex network into two low-rank matrices. One matrix corresponds to shared communities across all layers, and the other to unique communities within each layer. Additionally, graph regularization and the diversity of private communities are taken into account in the algorithm. The Hilbert Schmidt Independence Criterion (HSIC) is used to constrain the independence of private communities. The results prove that ONMTF effectively addresses community detection in multiplex networks. It also offers strong interpretability and feature extraction capabilities. Therefore, it is an advanced method for community detection in multiplex networks.


  • Open Access

    Semi-Supervised Feature Selection of Educational Data Mining for Student Performance Analysis

    by Shanshan Yu, Yiran Cai, Baicheng Pan, Man-Fai Leung

    In recent years, the informatization of the educational system has caused a substantial increase in educational data. Educational data mining can assist in identifying the factors influencing students’ performance. However, two challenges have arisen in the field of educational data mining: (1) How to handle the abundance of unlabeled data? (2) How to identify the most crucial characteristics that impact student performance? In this paper, a semi-supervised feature selection framework is proposed to analyze the factors influencing student performance. The proposed method is semi-supervised, enabling the processing of a considerable amount of unlabeled data with only a few labeled instances. Additionally, by solving a feature selection matrix, the weights of each feature can be determined, to rank their importance. Furthermore, various commonly used classifiers are employed to assess the performance of the proposed feature selection method. Extensive experiments demonstrate the superiority of the proposed semi-supervised feature selection approach. The experiments indicate that behavioral characteristics are significant for student performance, and the proposed method outperforms the state-of-the-art feature selection methods by approximately 3.9% when extracting the most important feature.


  • Open Access

    Robust capped norm dual hyper-graph regularized non-negative matrix tri-factorization

    by Jiyang Yu, Baicheng Pan, Shanshan Yu, Man-Fai Leung

    Non-negative matrix factorization (NMF) has been widely used in machine learning and data mining fields. As an extension of NMF, non-negative matrix tri-factorization (NMTF) provides more degrees of freedom than NMF. However, standard NMTF algorithm utilizes Frobenius norm to calculate residual error, which can be dramatically affected by noise and outliers. Moreover, the hidden geometric information in feature manifold and sample manifold is rarely learned. Hence, a novel robust capped norm dual hyper-graph regularized non-negative matrix tri-factorization (RCHNMTF) is proposed. First, a robust capped norm is adopted to handle extreme outliers. Second, dual hyper-graph regularization is considered to exploit intrinsic geometric information in feature manifold and sample manifold. Third, orthogonality constraints are added to learn unique data presentation and improve clustering performance. The experiments on seven datasets testify the robustness and superiority of RCHNMTF.