Query：
学者姓名：陈晓云
Refining：
Year
Type
Indexed by
Source
Complex
Co-
Language
Clean All
Abstract ：
Attribute graph clustering is an important tool to analyze and understand complex networks. In recent years, graph attention auto-encoder has been applied to attribute graph clustering as a learning method for unsupervised feature representation. However, the graph attention auto-encoder only learns the feature representation of the nodes, and needs to use traditional clustering algorithms such as k-means and spectral clustering to achieve the final clustering of nodes. During the optimization process, the clustering loss cannot be fed back to the auto-encoder and the extracted features are not necessarily suitable for downstream clustering tasks because the auto-encoder model for feature learning and the clustering model are mutually independent. To overcome this problem, we propose a cluster-guided graph attention auto-encoder (CGATAE), which introduces a cluster-guided pairwise feature relationship preservation-based non-negative matrix factorization model (FR-NMF) into the graph attention auto-encoder. The model CGATAE obtains the final clustering results while learning the cluster-oriented node feature representation. Experiments on five public attribute graph datasets verify the effectiveness of the CGATAE model, and its clustering quality is significantly better than the original graph attention auto-encoder model.
Keyword ：
Feature relationship preservation Feature relationship preservation Feature representations Feature representations Graph auto-encoder Graph auto-encoder Graph clustering Graph clustering Matrix factorization Matrix factorization
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zheng, Zhiwen , Chen, Xiaoyun , Huang, Musheng . Cluster-guided graph attention auto-encoder [J]. | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (3) . |
| MLA | Zheng, Zhiwen 等. "Cluster-guided graph attention auto-encoder" . | JOURNAL OF SUPERCOMPUTING 81 . 3 (2025) . |
| APA | Zheng, Zhiwen , Chen, Xiaoyun , Huang, Musheng . Cluster-guided graph attention auto-encoder . | JOURNAL OF SUPERCOMPUTING , 2025 , 81 (3) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Community detection is an important tool for analyzing and understanding large-scale complex networks. It can divide the network nodes into multiple communities, which have dense intra-community connections and sparse inter-community connections. Traditional community detection algorithms focus on non-attributed networks that contain only topological structures and ignore the attribute information on the nodes. Dual-channel attribute network community detection model optimizes the topology and attribute information as two channels, which can make full use of the two types of information and improve the clustering accuracy of the model. As a classical mathematical method of community detection, non-negative matrix factorization is only suitable for linear data, and cannot mine the nonlinear latent structural features. To address these limitations, this paper proposes a dual-channel attributed graph community detection algorithm based on kernel matrix factorization(KDACD). The nonlinear relations between nodes are learned by using kernel trick which projecting attribute features of nodes into high-dimensional Hilbert Spaces, and the robustness of the model is improved by sparse constraints and manifold regularization terms. Extensive experiments on 6 real-world datasets verify the effectiveness of the algorithm.
Keyword ：
Attributed graph community detection Attributed graph community detection kernel trick kernel trick manifold regularization manifold regularization non-negative matrix factorization non-negative matrix factorization unsupervised learning unsupervised learning
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zheng, Zhiwen , Chen, Xiaoyun , Lin, Xinyi . Kernel Based Dual-Channel Attributed Graph Community Detection [J]. | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING , 2024 , 11 (1) : 592-603 . |
| MLA | Zheng, Zhiwen 等. "Kernel Based Dual-Channel Attributed Graph Community Detection" . | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 11 . 1 (2024) : 592-603 . |
| APA | Zheng, Zhiwen , Chen, Xiaoyun , Lin, Xinyi . Kernel Based Dual-Channel Attributed Graph Community Detection . | IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING , 2024 , 11 (1) , 592-603 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Subspace clustering model based on self-representation learning often use l1,l2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1, \ell _2$$\end{document} or kernel norm to constrain self-representation matrix of the dataset. In theory, l1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1$$\end{document} norm can constrain the independence of subspaces, but which may lead to under-connection because the sparsity of the self-representation matrix. l2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _2$$\end{document} and nuclear norm regularization can improve the connectivity between clusters, but which may lead to over-connection of the self-representation matrix. Because a single regularization term may cause subspaces to be over or insufficiently divided, this paper proposes an elastic deep sparse self-representation subspace clustering network (EDS-SC), which imposes sparse constraints on deep features, and introduces the elastic network regularization mixed l1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _1$$\end{document} and l2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\ell _2$$\end{document} norm to constraint self-representation matrix. The network can extract deep sparse features and provide a balance between subspace independence and connectivity. Experiments on human faces, objects, and medical imaging datasets prove the effectiveness of EDS-SC network.
Keyword ：
Deep auto-encoder Deep auto-encoder Deep sparse feature Deep sparse feature Elastic net regularization Elastic net regularization Representation learning Representation learning Subspace clustering Subspace clustering
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Qiaoping , Chen, Xiaoyun , Li, Yan et al. Elastic Deep Sparse Self-Representation Subspace Clustering Network [J]. | NEURAL PROCESSING LETTERS , 2024 , 56 (2) . |
| MLA | Wang, Qiaoping et al. "Elastic Deep Sparse Self-Representation Subspace Clustering Network" . | NEURAL PROCESSING LETTERS 56 . 2 (2024) . |
| APA | Wang, Qiaoping , Chen, Xiaoyun , Li, Yan , Lin, Yanming . Elastic Deep Sparse Self-Representation Subspace Clustering Network . | NEURAL PROCESSING LETTERS , 2024 , 56 (2) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
As an important technology for recommendation system, attributed graph clustering has received extensive attention recently. Attributed graph clustering methods based on graph neural networks are the mainstream methods . However, their assumption that the attributes of adjacent nodes are similar is often not satisfied in the real world, which influences the clustering performance. To this end, this paper proposes an attributed graph subspace clustering algorithm with residual compensation guided by adaptive dual manifold regularization (ADMRGC). On the basis of the low rank representation subspace clustering (LRR) model, ADMRGC introduces attributed manifold regularization, topological manifold regularization and residual compensation, which make ADMRGC possible to utilize attributed similarity and topological similarity at the same time, thus solving the problem that traditional subspace clustering only considers attributed information. In addition, ADMRGC balances the contribution of node attributes and topology by adaptively weighting the dual manifold regularization, and uses the residual representation matrix to describe the difference between node attributed similarity and topological neighbor relationship. Therefore, ADMRGC can avoid the limitation of graph neural network models assuming that the attributes of adjacent nodes are similar. Experimental results on 7 public graph datasets show that ADMRGC can achieve the best clustering performance on both high-homophily and low-homophily datasets. Especially, for datasets with low homophily, ADMRGC as a shallow model can also achieve better clustering performance than state-of-the-art deep neural network models.
Keyword ：
Adaptive weight Adaptive weight Attributed graph clustering Attributed graph clustering Manifold regularization Manifold regularization Residual Residual Self-representation model Self-representation model
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Yan , Chen, Xiaoyun . Attributed graph subspace clustering with residual compensation guided by adaptive dual manifold regularization [J]. | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 255 . |
| MLA | Li, Yan et al. "Attributed graph subspace clustering with residual compensation guided by adaptive dual manifold regularization" . | EXPERT SYSTEMS WITH APPLICATIONS 255 (2024) . |
| APA | Li, Yan , Chen, Xiaoyun . Attributed graph subspace clustering with residual compensation guided by adaptive dual manifold regularization . | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 255 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Link prediction aims to predict missing links or eliminate spurious links by employing known complex network information. As an unsupervised linear feature representation method, matrix factorization (MF)-based autoencoder (AE) can project the high-dimensional data matrix into the low-dimensional latent space. However, most of the traditional link prediction methods based on MF or AE adopt shallow models and single adjacency matrices, which cannot adequately learn and represent network features and are susceptible to noise. In addition, because some methods require the input of symmetric data matrix, they can only be used in undirected networks. Therefore, we propose a deep manifold matrix factorization autoencoder model using global connectivity matrix, called DM-MFAE-G. The model utilizes PageRank algorithm to get the global connectivity matrix between nodes for the complex network. DM-MFAE-G performs deep matrix factorization on the local adjacency matrix and global connectivity matrix, respectively, to obtain global and local multi-layer feature representations, which contains the rich structural information. In this paper, the model is solved by alternating iterative optimization method, and the convergence of the algorithm is proved. Comprehensive experiments on different real networks demonstrate that the global connectivity matrix and manifold constraints introduced by DM-MFAE-G significantly improve the link prediction performance on directed and undirected networks.
Keyword ：
Autoencoder Autoencoder Deep matrix factorization Deep matrix factorization Graph representation learning Graph representation learning Link prediction Link prediction Manifold regularization Manifold regularization
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Xinyi , Chen, Xiaoyun , Zheng, Zhiwen . Deep manifold matrix factorization autoencoder using global connectivity for link prediction [J]. | APPLIED INTELLIGENCE , 2023 , 53 (21) : 25816-25835 . |
| MLA | Lin, Xinyi et al. "Deep manifold matrix factorization autoencoder using global connectivity for link prediction" . | APPLIED INTELLIGENCE 53 . 21 (2023) : 25816-25835 . |
| APA | Lin, Xinyi , Chen, Xiaoyun , Zheng, Zhiwen . Deep manifold matrix factorization autoencoder using global connectivity for link prediction . | APPLIED INTELLIGENCE , 2023 , 53 (21) , 25816-25835 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Existing methods based on graph convolutional neural network have made some achievements in graph clustering, but most of them do not consider how to obtain the most beneficial embedding representation for clustering when the clustering structure cannot be predicted, and cannot maximize the use of the graph structural and attributed information and their relationship. In this paper, we propose a marginalized graph autoencoder with subspace structure preserving, which adds a self-expressive layer to reveal the clustering structure of node attributes based on the marginalized graph autoencoder, so that the output of the autoencoder maintains the multi-subspace structure of the input feature matrix and matches the clustering target, resulting in a cluster-oriented graph representation to improve clustering performance. Experiments on four public datasets show that the algorithm can effectively improve the performance of the graph clustering. © 2023 IEEE.
Keyword ：
Convolutional neural networks Convolutional neural networks Graph algorithms Graph algorithms Graph neural networks Graph neural networks Graph structures Graph structures Learning systems Learning systems
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Li, Yan , Chen, Xiaoyun . Marginalized Graph Autoencoder with Subspace Structure Preserving [C] . 2023 : 70-76 . |
| MLA | Li, Yan et al. "Marginalized Graph Autoencoder with Subspace Structure Preserving" . (2023) : 70-76 . |
| APA | Li, Yan , Chen, Xiaoyun . Marginalized Graph Autoencoder with Subspace Structure Preserving . (2023) : 70-76 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
TSVM is designed to solve binary classification problems with less computational overhead by finding two hyperplanes and has been widely used to solve real-world problems. However, in real scenarios, the data used for learning is always scattered in different institutions or users. At the same time, people pay more attention to the issue of personal privacy leakage. Due to the complex privacy protection issues, simply collecting all the data for model training is no longer acceptable. Federated learning has recently been proposed to solve this problem. It completes model training by sharing model parameter updates in the form of data that remains local. But there is still no algorithm for twin support vector machines under the framework of federated learning. Combining the characteristics of twin support vector machine and federated learning, this paper proposes a federated twin support vector machine algorithm (FTSVM) and extends the twin support vector machine based on stochastic gradient descent into a federated support vector machine. We propose a unique initialization algorithm and integration algorithm to ensure the accuracy of the algorithm and the effectiveness of privacy protection. Accuracy experiments are carried out on five datasets, and the accuracy is basically the same as that of the TSVM based on gradient descent. Ablation experiments show that as the number of participants increases, the accuracy of the FTSVM is significantly higher than the average accuracy of the Stand-alone TSVM. Time experiments show that the time overhead of FTSVM increases linearly with the number of participants. These experiments demonstrate the accuracy, effectiveness, and possibility of application in real-world scenarios of our proposed FTSVM. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.
Keyword ：
Gradient methods Gradient methods Learning algorithms Learning algorithms Stochastic systems Stochastic systems Support vector machines Support vector machines Vectors Vectors
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Yang, Zhou , Chen, Xiaoyun . Federated Twin Support Vector Machine [C] . 2022 : 187-204 . |
| MLA | Yang, Zhou et al. "Federated Twin Support Vector Machine" . (2022) : 187-204 . |
| APA | Yang, Zhou , Chen, Xiaoyun . Federated Twin Support Vector Machine . (2022) : 187-204 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Multi-view clustering has attractive intensive attention and proved to be more effective than single-view clustering. The mining and effective utilization of information complementarity is core of multi-view clustering. In this paper, we propose a novel Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering (ARMSC) method, which adopts residual representation information to compensate the globally low rank consensus representation. The auto-weighted multi-view graph regularization term is constructed to preserve the local manifold structure of multiple features, which can automatically adjust the weights and the learned weights are adopt to measure the importance of each view's residual representation for final representation. Specifically, we formulate the graph regularized consistent representation using nuclear norm and a set of group effect residual compensation using Frobenius norm. Finally, we introduce a convex relaxation and alternating direction method to optimize the problem. Comprehensive and ablation experiments on seven real-world data sets illustrate the effectiveness and superiority of the proposed ARMSC over several state-of-the-art multi-view clustering approaches.
Keyword ：
Auto-weighted Auto-weighted Graph regularization Graph regularization Multi-view clustering Multi-view clustering Residual representation Residual representation Subspace clustering Subspace clustering
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Qiaoping , Chen, Xiaoyun , Chen, Wenjian . Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering [J]. | NEURAL PROCESSING LETTERS , 2022 , 54 (5) : 3851-3871 . |
| MLA | Wang, Qiaoping et al. "Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering" . | NEURAL PROCESSING LETTERS 54 . 5 (2022) : 3851-3871 . |
| APA | Wang, Qiaoping , Chen, Xiaoyun , Chen, Wenjian . Auto-Weighted Graph Regularization and Residual Compensation for Multi-view Subspace Clustering . | NEURAL PROCESSING LETTERS , 2022 , 54 (5) , 3851-3871 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
In most of the existing multi-view subspace clustering methods, the consistent shared information of the multi-view data is learned, and the contribution of each view is regarded as equally important to integrate the difference information of multiple views. However, possible noise or redundancy between different views is ignored due to the idea of treating each view as equally important, resulting in poor final clustering performance. Therefore, an algorithm of adaptive weighted multi-view subspace clustering guided by manifold regularization(MR-AWMSC) is proposed in this paper. The consistent global low-rank representation information for each view is learned by nuclear norm, and difference information from different views is described by group effect. According to the concept of manifold regularization, the weight of each view is adaptively learned, and the contribution degree to the difference information of each view is automatically assigned. The difference information is integrated by the adaptive weight and the consistent information is fused to obtain the final consensus representation. The consensus representation is constructed for clustering multi-view data. Experimental results on six public datasets demonstrate that MR-AWMSC effectively improves the multi-view clustering performance. © 2022 Journal of Pattern Recognition and Artificial Intelligence. All rights reserved.
Keyword ：
Artificial intelligence Artificial intelligence Clustering algorithms Clustering algorithms Pattern recognition Pattern recognition
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Lin, Yanming , Chen, Xiaoyun . Adaptive Weighted Multi-view Subspace Clustering Guided by Manifold Regularization [J]. | Pattern Recognition and Artificial Intelligence , 2022 , 35 (11) : 965-976 . |
| MLA | Lin, Yanming et al. "Adaptive Weighted Multi-view Subspace Clustering Guided by Manifold Regularization" . | Pattern Recognition and Artificial Intelligence 35 . 11 (2022) : 965-976 . |
| APA | Lin, Yanming , Chen, Xiaoyun . Adaptive Weighted Multi-view Subspace Clustering Guided by Manifold Regularization . | Pattern Recognition and Artificial Intelligence , 2022 , 35 (11) , 965-976 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
现有多视角子空间聚类方法大多学习多视角数据的一致共享信息,并将每个视角的贡献视为同等重要以集成多个视角的差异信息.然而此思想忽略不同视角间可能存在的噪声或冗余,导致最终聚类性能不佳.为此,文中提出流形正则引导的自适应加权多视角子空间聚类算法.算法采用核范数学习每个视角的一致性全局低秩表示信息并利用组效应刻画不同视角的差异信息.根据流形正则的思想,自适应学习每个视角的权重,自动为每个视角的差异信息分配贡献度.再根据自适应权重集成差异信息并融合一致信息,获得最终的共识表示.最后利用该共识表示实现聚类.在6个公开数据集上的实验表明文中算法能有效提升多视角聚类性能.
Keyword ：
多视角聚类 多视角聚类 子空间聚类 子空间聚类 流形正则 流形正则 自适应加权 自适应加权
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 林燕铭 , 陈晓云 . 流形正则引导的自适应加权多视角子空间聚类 [J]. | 模式识别与人工智能 , 2022 , 35 (11) : 965-976 . |
| MLA | 林燕铭 et al. "流形正则引导的自适应加权多视角子空间聚类" . | 模式识别与人工智能 35 . 11 (2022) : 965-976 . |
| APA | 林燕铭 , 陈晓云 . 流形正则引导的自适应加权多视角子空间聚类 . | 模式识别与人工智能 , 2022 , 35 (11) , 965-976 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
