30 August 2021 in IEEE Transactions on Knowledge and Data Engineering
The embedded representation and clustering tasks both play important roles in relational data analysis and mining. Traditional methods mainly employ graph structure to describe relational data, but intuitive pairwise connections among nodes are insufficient to model high-order data in the real-world, such as the relations between proteins and polypeptide chains. Hypergraphs are a generalization of graphs, and hypergraphs can well model high-order data. When modeling relational data in the real world, hypergraphs are often accompanied by node attributes, i.e. attributed hypergraphs. Besides this, how to integrate the structural information and attribute information appropriately is another important task, while has not been investigated systematically. In this paper, we propose Adaptive Hypergraph Auto-Encoder(AHGAE) to learn node embeddings in low-dimensional space. Our method can utilize the high-order relation to generate embedding for clustering. It is composed of two procedures, i.e. the adaptive hypergraph Laplacian smoothing filter and the relational reconstruction auto-encoder. It has the advantage of integrating more complex data relations compared with graph-based methods, which leads to better modeling and clustering performance. The proposed method has been evaluated on hypergraph datasets and benchmark graph datasets. Experimental results and comparison with the state-of-the-art methods have demonstrated the effectiveness of our proposed method.
31 August 2020 in IEEE Access
Graph clustering is a fundamental task in data analysis and has attracted considerable attention in recommendation systems, mapping knowledge domain, and biological science. Because graph convolution is very effective in combining the feature information and topology information of graph data, some graph clustering methods based on graph convolution have achieved superior performance. However, current methods lack the consideration of structured information and the process of graph convolution. Specifically, most of existing methods ignore the implicit interaction between topology information and feature information, and the stacking of a small number of graph convolutional layers leads to insufficient learning of complex information. Inspired by graph convolutional network and auto-encoder, we propose a deep graph structured clustering network that applies a deep clustering method to graph structured data processing. Deep graph convolution is employed in the backbone network, and evaluates the result of each iteration with node feature and topology information. In order to optimize the network without supervision, a triple self-supervised module is designed to help update parameters for overall network. In our model, we exploit all information of the graph structured data and perform self-supervised learning. Furthermore, improved graph convolution layers significantly alleviate the problem of clustering performance degradation caused by over-smoothing. Our model is designed to perform on representative and indirect graph datasets, and experimental results demonstrate that our model achieves superior performance over state-of-the-art models.
3 September 2022 in Neural Computing and Applications
21 April 2022 in Information Systems
25 May 2021 in IEEE Access
Recently, recommender systems based on Graph Convolution Network (GCN) have become a research hotspot, especially in collaborative filtering. However, most GCN-based models have inferior embedding propagation mechanism, leading to low information extraction efficiency. Besides, the existing methods suffer from high computational complexity for large user-item interaction graphs. In order to solve the above problems, we propose LII-GCCF that integrates Linear transformation, Initial residual and Identity mapping into the Graph Convolutional Collaborative Filtering model. First, initial residual and identity mapping are applied to optimize the information propagation of graph convolution, which privide abundant interaction and alleviate information loss problem. Second, LII-GCCF removes the unnecessary nonlinear transformation based on the characteristics of collaborative filtering to simplify the graph convolution process. Comprehensive experiments are conducted on two public datasets, and the results demonstrate that LII-GCCF has a significant improvement over other state-of-the-art methods.