Barakeel Fanseu Kamhoua
Skip Abstract Section
Abstract
Attributed graph clustering (AGC) is an important problem in graph mining as more and more complex data in real-world have been represented in graphs with attributed nodes. While it is a common practice to leverage both attribute and structure information for improved clustering performance, most existing AGC algorithms consider only a specific type of relations, which hinders their applicability to integrate various complex relations into node attributes for AGC. In this article, we propose GRACE, an extended graph convolution framework for AGC tasks. Our framework provides a general and interpretative solution for clustering many different types of attributed graphs, including undirected, directed, heterogeneous and hyper attributed graphs. By building suitable graph Laplacians for each of the aforementioned graph types, GRACE can seamlessly perform graph convolution on node attributes to fuse all available information for clustering. We conduct extensive experiments on 14 real-world datasets of four different graph types. The experimental results show that GRACE outperforms the state-of-the-art AGC methods on the different graph types in terms of clustering quality, time, and memory usage.
- [1] . 2006. Higher order learning with graphs. In Proceedings of the 23rd International Conference on Machine Learning.Google Scholar
Digital Library
- [2] . 2017. Attributed graph clustering: An attribute-aware graph embedding approach. In Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining., , and (Eds.), ACM, 305–308.
DOI: Google ScholarDigital Library - [3] . 2007. Using PageRank to locally partition a graph. Internet Mathematics 4,
01 (2007), 35–64.DOI: Google ScholarCross Ref
- [4] . 2021. Hypergraph convolution and hypergraph attention. Pattern Recognit. 110 (2021), 107637.
DOI: Google ScholarCross Ref - [5] . 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 6 (2003), 1373–1396.
DOI: Google ScholarDigital Library - [6] . 2010. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2010), 1548–1560.Google Scholar
- [7] . 2011. Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2011), 1548–1560.
DOI: Google ScholarDigital Library - [8] . 2020. Generalizing the hypergraph Laplacian via a diffusion process with mediators. Theoretical Computer Science 806, 1 (2020), 416–428.
DOI: Google ScholarDigital Library - [9] . 2014. Signal denoising on graphs via graph filtering. In Proceedings of the 2014 IEEE Global Conference on Signal and Information Processing.872–876.
DOI: Google ScholarCross Ref - [10] . 2011. Clustering large attributed graphs: A balance between structural and attribute similarities. ACM Transactions on Knowledge Discovery from Data 5, 2 (2011), 12:1–12:33.
DOI: Google ScholarDigital Library - [11] . 2005. Laplacians and the cheeger inequality for directed graphs. Annals of Combinatorics 9, 1 (2005), 1–19.
DOI: Google ScholarCross Ref - [12] . 2012. Community detection based on structural and attribute similarities. In Proceedings of the International Conference on Digital Society. 7–12.Google Scholar
- [13] . 2005. Efficient non-parametric function induction in semi-supervised learning. In Proceedings of the 10th International Workshop on Artificial Intelligence and Statistics.Society for Artificial Intelligence and Statistics, 96–103.Google Scholar
- [14] . 2004. Kernel k-means: Spectral clustering and normalized cuts. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 551–556.Google ScholarDigital Library
- [15] . 2004. K-means clustering via principal component analysis. In Proceedings of the 21st International Conference on Machine Learning. 29.Google ScholarDigital Library
- [16] . 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In Proceedings of the 2005 SIAM International Conference on Data Mining. SIAM, 606–610.Google ScholarCross Ref
- [17] . 2017. Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization. J. of Global Optimization 74, 4 (2019), 861–877.Google Scholar
- [18] . 2022. A graph neural network framework for social recommendations. IEEE Transactions on Knowledge and Data Engineering 34, 5 (2022), 2033–2047.
DOI: Google ScholarCross Ref - [19] . 2018. Hypergraph neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence.Google Scholar
- [20] . 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Google ScholarDigital Library
- [21] . 2018. CFOND: Consensus factorization for co-clustering networked data. IEEE Transactions on Knowledge and Data Engineering 31, 4 (2018), 706–719.Google ScholarDigital Library
- [22] . 2020. Heterogeneous graph transformer. In Proceedings of The Web Conference 2020. Association for Computing Machinery, 2704–2710.Google Scholar
- [23] . 2021. Knowledge-aware coupled graph neural network for social recommendation. Proceedings of the AAAI Conference on Artificial Intelligence 35, 5 (2021), 4115–4122. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/16533.Google ScholarCross Ref
- [24] Vaibhav Vaibhav, Po-Yao Huang, and Robert E. Frederking. 2019. RWR-GAE: Random walk regularization for graph auto encoders. arXiv:1908.04003. Retrieved from https://arxiv.org/abs/1908.04003.Google Scholar
- [25] . 2017. Joint weighted nonnegative matrix factorization for mining attributed graphs. In Proceedings of the Advances in Knowledge Discovery and Data Mining—21st Pacific-Asia Conference., , , , , and (Eds.),
Lecture Notes in Computer Science , Vol. 10234, 368–380.DOI: Google ScholarCross Ref - [26] . 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8 (2000), 888–905.
DOI: Google ScholarDigital Library - [27] . 2021. HyperGraph convolution based attributed HyperGraph clustering. In Proceedings of the 30th ACM International Conference on Information and Knowledge Management.Google Scholar
- [28] . 2016. Variational graph auto-encoders. In Proceedings of the NIPS Workshop on Bayesian Deep Learning.Google Scholar
- [29] . 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the International Conference on Learning Representations.Google Scholar
- [30] . 2012. Symmetric nonnegative matrix factorization for graph clustering. In Proceedings of the 2012 SIAM International Conference on Data Mining. SIAM, 106–117.Google ScholarCross Ref
- [31] . 2018. Hypergraph clustering: A modularity maximization approach. Appl. Netw. Sci. 5, 1 (2020), 52.
DOI: Google ScholarCross Ref - [32] . 2000. Algorithms for non-negative matrix factorization. In Proceedings of the Advances in Neural Information Processing Systems., , and (Eds.), MIT, 556–562. Retrieved from http://papers.nips.cc/paper/1861-algorithms-for-non-negative-matrix-factorization.Google Scholar
- [33] . 2012. Efficient hypergraph clustering. In Proceedings of the 15th International Conference on Artificial Intelligence and Statistics.Google Scholar
- [34] . 2012. Learning to discover social circles in ego networks. In Proceedings of the Advances in Neural Information Processing Systems. , , , and (Eds.), Vol. 25. Curran Associates, Inc., 539–547. Retrieved from https://proceedings.neurips.cc/paper/2012/file/7a614fd06c325499f1680b9896beedeb-Paper.pdf.Google Scholar
- [35] . 2020. Scalable graph convolutional networks with fast localized spectral filter for directed graphs. IEEE Access 8 (2020), 105634–105644.
DOI: Google ScholarCross Ref - [36] . 2021. Higher-order attribute-enhancing heterogeneous graph neural networks. arXiv:2104.07892. Retrieved from https://arxiv.org/abs/2104.07892.Google Scholar
- [37] . 2017. Inhomogeneous hypergraph clustering with applications. In Proceedings of the Advances in Neural Information Processing Systems. , , , , , , and (Eds.), Vol. 30. Curran Associates, Inc., 2308–2318. Retrieved from https://proceedings.neurips.cc/paper/2017/file/a50abba8132a77191791390c3eb19fe7-Paper.pdf.Google ScholarDigital Library
- [38] . 2018. Deeper insights into graph convolutional networks for semi-supervised learning. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence. AAAI.Google ScholarCross Ref
- [39] . 2019. Spectral clustering in heterogeneous information networks. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence; The 31st Innovative Applications of Artificial Intelligence Conference; The 9th AAAI Symposium on Educational Advances in Artificial Intelligence. AAAI, 4221–4228.
DOI: Google ScholarDigital Library - [40] . 2021. Graph filter-based multi-view attributed graph clustering. In Proceedings of the 30th International Joint Conference on Artificial Intelligence. (Ed.), International Joint Conferences on Artificial Intelligence Organization, 2723–2729.
DOI: Main Track .Google ScholarCross Ref - [41] . 2021. Federated social recommendation with graph neural network. ACM Transactions on Intelligent Systems and Technology (2021).
DOI: Google ScholarDigital Library - [42] . 2004. A tutorial on spectral clustering. Statistics and Computing 17, 4 (2004), 395–416.
DOI: Google ScholarDigital Library - [43] . 2019. Spectral-based graph convolutional network for directed graphs. arXiv:1907.08990. Retrieved from https://arxiv.org/abs/1907.08990.Google Scholar
- [44] . 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability.281–297.Google Scholar
- [45] . 1967. Some methods for classification and analysis of multivariate observations. In Proceedings of the 5th Berkeley Symposium on Mathematical Statistics and Probability. University of California Press, 281–297.Google Scholar
- [46] . 2013. Clustering and community detection in directed networks: A survey. Physics Reports 533, 4 (2013), 95–142.
DOI: Google ScholarCross Ref - [47] . 2012. Learning to discover social circles in ego networks. In Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012., , , , and (Eds.), 548–556. Retrieved from http://papers.nips.cc/paper/4532-learning-to-discover-social-circles-in-ego-networks.Google Scholar
- [48] . 2003. Clustering relational data using attribute and link information. In Proceedings of the Text Mining and Link Analysis Workshop, 18th International Joint Conference on Artificial Intelligence. 9–15.Google Scholar
- [49] . 2018. Adversarially regularized graph autoencoder for graph embedding. In Proceedings of the IJCAI. 2609–2615.Google ScholarCross Ref
- [50] . 2014. Deepwalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 701–710.Google ScholarDigital Library
- [51] . 2016. Community detection using nonnegative matrix factorization with orthogonal constraint. In Proceedings of the 2016 8th International Conference on Advanced Computational Intelligence. 49–54.
DOI: Google ScholarCross Ref - [52] . 2002. On the laplacian eigenvalues and metric parameters of hypergraphs. Linear and Multilinear Algebra 50, 1 (2002), 1–14.
DOI: Google ScholarCross Ref - [53] . 2021. Spectral clustering of attributed multi-relational graphs. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining.Association for Computing Machinery, 1431–1440.
DOI: Google ScholarDigital Library - [54] . 2017. Hypergraph p-Laplacian: A differential geometry view. In AAAI. 3984–3991. https://www.aaai.org/ocs/index.php/AAAI/AAAI18/paper/view/17386.Google Scholar
- [55] . 2011. Symmetrizations for clustering directed graphs.In Proceedings of the 14th International Conference on Extending Database Technology. Association for Computing Machinery, New York, NY, 343–354. Google ScholarDigital Library
- [56] . 2015. SPECTRAL CLUSTERING IN HETEROGENEOUS NETWORKS. Statistica Sinica 25, 3 (2015), 1081–1106. Retrieved from http://www.jstor.org/stable/24721222.Google Scholar
- [57] . 2020. Heterogeneous graph neural network for recommendation. In ICML Workshop.Google Scholar
- [58] . 2013. The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine 30, 3 (2013), 83–98.
DOI: Google ScholarCross Ref - [59] . 2020. Network embedding for community detection in attributed networks. ACM Transactions on Knowledge Discovery from Data 14, 3 (2020), 36:1–36:25.
DOI: Google ScholarDigital Library - [60] . 2009. RankClus: Integrating clustering with ranking for heterogeneous information network analysis.In Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology. Association for Computing Machinery, New York, NY, 565–576.
DOI: Google ScholarDigital Library - [61] . 2009. Ranking-based clustering of heterogeneous information networks with star network schema. Ranking-based clustering of heterogeneous information networks with star network schema. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 797–806.
DOI: Google ScholarDigital Library - [62] . 2009. Ranking-based clustering of heterogeneous information networks with star network schema. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Association for Computing Machinery, 797–806.
DOI: Google ScholarDigital Library - [63] . 2020. Hypergraph clustering based on PageRank. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & and Data Mining. 1970–1978.
DOI: Google ScholarDigital Library - [64] . 2020. Digraph inception convolutional networks. In Proceedings of the Advances in Neural Information Processing Systems. , , , , and (Eds.), Vol. 33. Curran Associates, Inc., 17907–17918. Retrieved from https://proceedings.neurips.cc/paper/2020/file/cffb6e2288a630c2a787a64ccc67097c-Paper.pdf.Google Scholar
- [65] . 2018. Graph attention networks. In Proceedings of the International Conference on Learning Representations. Retrieved from https://openreview.net/forum?id=rJXMpikCZ.Google Scholar
- [66] . 2019. Attributed graph clustering: A deep attentional embedding approach. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. (Ed.), Association for the Advancement of Artificial Intelligence, 3670–3676.
DOI: Google ScholarCross Ref - [67] . 2017. Mgae: Marginalized graph autoencoder for graph clustering. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 889–898.Google ScholarDigital Library
- [68] . 2016. Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining., , , , , and (Eds.), ACM, 1225–1234.
DOI: Google ScholarDigital Library - [69] . 2016. Semantic community identification in large attribute networks. In Proceedings of the 30th AAAI Conference on Artificial Intelligence. and (Eds.), AAAI,265–271. Retrieved from http://www.aaai.org/ocs/index.php/AAAI/AAAI16/paper/view/11964.Google ScholarCross Ref
- [70] . 2021. Self-supervised heterogeneous graph neural network with co-contrastive learning. In Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. Association for Computing Machinery, 1726–1736.
DOI: Google ScholarDigital Library - [71] . 2020. MEGA: Multi-view semi-supervised clustering of hypergraphs. Proceedings of the VLDB Endowment 13, 5 (2020), 698–711.
DOI: Google ScholarDigital Library - [72] . 2019. Simplifying graph convolutional networks. In Proceedings of the 36th International Conference on Machine Learning. 6861–6871.Google Scholar
- [73] . 2021. A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems 32, 1 (2021), 4–24.
DOI: Google ScholarCross Ref - [74] . 2014. Robust multi-view spectral clustering via low-rank and sparse decomposition. In Proceedings of the AAAI.Google ScholarCross Ref
- [75] . 2019. How powerful are graph neural networks?. In Proceedings of the International Conference on Learning Representations. Retrieved from https://openreview.net/forum?id=ryGs6iA5Km.Google Scholar
- [76] . 2003. Document clustering based on non-negative matrix factorization. In Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval., , , , and (Eds.), ACM, 267–273.
DOI: Google ScholarDigital Library - [77] . 2012. A model-based approach to attributed graph clustering. In Proceedings of the 2012 ACM SIGMOD International Conference on Management of Data.
DOI: Google ScholarDigital Library - [78] . 2012. A model-based approach to attributed graph clustering. In Proceedings of the ACM SIGMOD International Conference on Management of Data., , , , and (Eds.), ACM, 505–516.
DOI: Google ScholarDigital Library - [79] . 2014. GBAGC: A general Bayesian framework for attributed graph clustering. ACM Transactions on Knowledge Discovery from Data 9, 1 (2014), 5:1–5:43.
DOI: Google ScholarDigital Library - [80] . 2019. HyperGCN: A new method for training graph convolutional networks on hypergraphs. In Proceedings of the Advances in Neural Information Processing Systems. Curran Associates, Inc., 1509–1520.Google Scholar
- [81] . 2015. Network representation learning with rich text information. In Proceedings of the 24th International Joint Conference on Artificial Intelligence. and (Eds.), AAAI,2111–2117. Retrieved from http://ijcai.org/Abstract/15/299.Google ScholarDigital Library
- [82] . 2013. Community detection in networks with node attributes. In Proceedings of the 2013 IEEE 13th International Conference on Data Mining., , , , and (Eds.), IEEE Computer Society, 1151–1156.
DOI: Google ScholarCross Ref - [83] . 2009. Combining link and content for community detection: A discriminative approach. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.Association for Computing Machinery, New York, NY, 927–936.
DOI: Google ScholarDigital Library - [84] . 2019. Attributed graph clustering via adaptive graph convolution. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI-19). International Joint Conferences on Artificial Intelligence Organization, 4327–4333.
DOI: Google ScholarCross Ref - [85] . 2005. Learning from labeled and unlabeled data on a directed graph. In Proceedings of the 22nd International Conference on Machine Learning.Google ScholarDigital Library
- [86] . 2006. Learning with hypergraphs: Clustering, classification, and embedding. In Advances in Neural Information Processing Systems 19: Proceedings of the 2006 Conference, B. Schölkopf, J. Platt, and T. Hoffman (Eds.). Vol. 19. 1601–1608. https://proceedings.neurips.cc/paper/2006/file/dff8e9c2ac33381546d96deea9922999-Paper.pdf.Google Scholar
- [87] . 2020. Graph neural networks: A review of methods and applications. AI Open 1 (2020), 2666–6510.
DOI: Google ScholarCross Ref - [88] . 2009. Graph clustering based on structural/attribute similarities. Proceedings of the VLDB Endowment 2, 1 (2009), 718–729.
DOI: Google ScholarDigital Library - [89] . 2009. Graph clustering based on structural/attribute similarities. Proceedings of the VLDB Endowment 2, 1 (2009), 718–729.
DOI: Google ScholarDigital Library - [90] . 2010. Clustering large attributed graphs: An efficient incremental approach. In Proceedings of the 10th IEEE International Conference on Data Mining., , , , and (Eds.), IEEE Computer Society, 689–698.
DOI: Google ScholarDigital Library - [91] . 2013. Social influence based clustering of heterogeneous information networks. In Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Association for Computing Machinery, New York, NY, 338–346.
DOI: Google ScholarDigital Library
Index Terms
- GRACE: A General Graph Convolution Framework for Attributed Graph Clustering
Recommendations
A model-based approach to attributed graph clustering
SIGMOD '12: Proceedings of the 2012 ACM SIGMOD International Conference on Management of DataGraph clustering, also known as community detection, is a long-standing problem in data mining. However, with the proliferation of rich attribute information available for objects in real-world graphs, how to leverage structural and attribute ...
Attributed graph clustering via adaptive graph convolution
IJCAI'19: Proceedings of the 28th International Joint Conference on Artificial IntelligenceAttributed graph clustering is challenging as it requires joint modelling of graph structures and node attributes. Recent progress on graph convolutional networks has proved that graph convolution is effective in combining structural and content ...
Spectral embedding network for attributed graph clustering
AbstractAttributed graph clustering aims to discover node groups by utilizing both graph structure and node features. Recent studies mostly adopt graph neural networks to learn node embeddings, then apply traditional clustering methods to ...
Highlights- We propose a spectral embedding network for attributed graph clustering (SENet).
Comments