Haoyuan Zou
Research Subjects
Haoyuan Zou has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Dingxian Wang
Upwork, Seattle, USA
1 shared publication - Guandong Xu
The Education University of Hong Kong, Hong Kong, China
1 shared publication - Hongzhi Yin
The University of Queensland
1 shared publication - Li He
University of Technology Sydney Broadway Sydney Australia
1 shared publication - Xianzhi Wang
University of Technology Sydney, Sydney, Australia
1 shared publication
Latest Publications
- Open Access
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 60-68
Simplifying Graph-based Collaborative Filtering for Recommendation
Graph Convolutional Networks (GCNs) are a popular type of machine learning models that use multiple layers of convolutional aggregation operations and non-linear activations to represent data. Recent studies apply GCNs to Collaborative Filtering (CF)-based recommender systems (RSs) by modeling user-item interactions as a bipartite graph and achieve superior performance. However, these models face difficulty in training with non-linear activations on large graphs. Besides, most GCN-based models could not model deeper layers due to the over-smoothing effect with the graph convolution operation. In this paper, we improve the GCN-based CF models from two aspects. First, we remove non-linearities to enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we obtain the initialization of the embedding for each node in the graph by computing the network embedding on the condensed graph, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse interaction data. The proposed model is a linear model that is easy to train, scalable to large datasets, and shown to yield better efficiency and effectiveness on four real datasets.
- 27 February 2023
- Published by Association for Computing Machinery (ACM)
- p. 60-68
Open AccessSimplifying Graph-based Collaborative Filtering for Recommendation
Graph Convolutional Networks (GCNs) are a popular type of machine learning models that use multiple layers of convolutional aggregation operations and non-linear activations to represent data. Recent studies apply GCNs to Collaborative Filtering (CF)-based recommender systems (RSs) by modeling user-item interactions as a bipartite graph and achieve superior performance. However, these models face difficulty in training with non-linear activations on large graphs. Besides, most GCN-based models could not model deeper layers due to the over-smoothing effect with the graph convolution operation. In this paper, we improve the GCN-based CF models from two aspects. First, we remove non-linearities to enhance recommendation performance, which is consistent with the theories in simple graph convolutional networks. Second, we obtain the initialization of the embedding for each node in the graph by computing the network embedding on the condensed graph, which alleviates the over smoothing problem in graph convolution aggregation operation with sparse interaction data. The proposed model is a linear model that is easy to train, scalable to large datasets, and shown to yield better efficiency and effectiveness on four real datasets.