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.
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.
Multi-view clustering has emerged as a powerful approach to geological facies characterization because it can integrate heterogeneous well-log sequences. However, real-world well-log data are susceptible to severe localized environmental disturbances, such as borehole collapse. Moreover, conventional pairwise graph methods fail to capture the inherent high-order semantic correlations in sequential petrophysical data, whereas standard tensor methods indiscriminately retain high-frequency structural noise. To address these limitations, we propose Smooth Tensor Multi-View Clustering on Well Logs via Hypergraph Topology and Concurrent Group Sparsity (HTCGS). First, HTCGS introduces a source-view hypergraph topology-injection mechanism that propagates high-order geological manifold structures across heterogeneous modalities, thereby enabling robust geometric prealignment. Second, it employs a cross-view concurrent joint-group-sparsity regularizer that uses an -norm penalty to separate localized anomalies into an explicit cross-view error matrix, thereby preserving the latent subspace. Finally, HTCGS applies the Smooth Tensor Nuclear Norm (STNN) to the purified latent features, which acts as a low-pass tensor filter to extract global consensus information reflecting macroscopic geological continuity. The resulting unified objective is efficiently optimized using the Alternating Direction Method of Multipliers (ADMM). Extensive experiments on five benchmark datasets, comprising four well-log datasets and one seismic-facies dataset, show that HTCGS outperforms six recent representative multi-view clustering baselines.