research-article

Network Embedding on Hierarchical Community Structure Network

Authors:

Junshan WangAuthors Info & Claims

ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 15, Issue 4

Article No.: 62, Pages 1 - 23

https://doi.org/10.1145/3434747

Published: 08 May 2021 Publication History

Abstract

Network embedding is a method of learning a low-dimensional vector representation of network vertices under the condition of preserving different types of network properties. Previous studies mainly focus on preserving structural information of vertices at a particular scale, like neighbor information or community information, but cannot preserve the hierarchical community structure, which would enable the network to be easily analyzed at various scales. Inspired by the hierarchical structure of galaxies, we propose the Galaxy Network Embedding (GNE) model, which formulates an optimization problem with spherical constraints to describe the hierarchical community structure preserving network embedding. More specifically, we present an approach of embedding communities into a low-dimensional spherical surface, the center of which represents the parent community they belong to. Our experiments reveal that the representations from GNE preserve the hierarchical community structure and show advantages in several applications such as vertex multi-class classification, network visualization, and link prediction. The source code of GNE is available online.

References

[1]

Smriti Bhagat, Graham Cormode, and S. Muthukrishnan. 2011. Node classification in social networks. In Social Network Data Analytics, Charu C. Aggarwal (Eds.). Springer, 115--148. dblp computer science bibliography, https://dblp.org.

[2]

Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (2008), P10008.

[3]

Ronald L. Breiger, Scott A. Boorman, and Phipps Arabie. 1975. An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. Journal of Mathematical Psychology 12, 3 (1975), 328–383.

[4]

Shaosheng Cao, Wei Lu, and Qiongkai Xu. 2015. GraRep: Learning graph representations with global structural information. In Proceedings of the 24th ACM International on Conference on Information and Knowledge Management. 891–900.

Digital Library

[5]

Aaron Clauset, Cristopher Moore, and Mark E. J. Newman. 2006. Structural inference of hierarchies in networks. In Proceedings of the International Conference on Machine Learning. 1–13.

[6]

Aaron Clauset, Cristopher Moore, and M. E. J. Newman. 2008. Hierarchical structure and the prediction of missing links in networks. Nature 453, 7191 (2008), 98–101.

[7]

Peng Cui, Xiao Wang, Jian Pei, and Wenwu Zhu. 2019. A survey on network embedding. IEEE Transactions on Knowledge & Data Engineering 31, 5 (2019), 833–852.

[8]

Lun Du, Zhicong Lu, Yun Wang, Guojie Song, Yiming Wang, and Wei Chen. 2018. Galaxy network embedding: A hierarchical community structure preserving approach. In Proceedings of the 27th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2079–2085.

[9]

Gary William Flake, Steve Lawrence, C. Lee Giles, and Frans M. Coetzee. 2002. Self-Organization and identification of web communities. Computer 35, 3 (2002), 66–70.

Digital Library

[10]

Francois Fouss, Alain Pirotte, Jeanmichel Renders, and Marco Saerens. 2007. Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Transactions on Knowledge and Data Engineering 19, 3 (2007), 355–369.

Digital Library

[11]

Linton Freeman. 2000. Visualizing social networks. Social Network Data Analytics 6, 4 (2000), 411–429.

[12]

Michelle Girvan and M. E. J. Newman. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99, 12 (2002), 7821–7826.

[13]

Aditya Grover and Jure Leskovec. 2016. node2vec: Scalable feature learning for networks. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Vol. 2016. 855–864.

Digital Library

[14]

Maria Halkidi, Yannis Batistakis, and Michalis Vazirgiannis. 2001. Clustering algorithms and validity measures. In Proceedings of the 13th International Conference on Scientific and Statistical Database Management (SSDBM’01). IEEE, 3–22.

[15]

Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the Advances in Neural Information Processing Systems. 1024–1034.

[16]

Ivan Herman, Guy Melançon, and M. Scott Marshall. 2002. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization & Computer Graphics 6, 1 (2002), 24–43.

Digital Library

[17]

Fenyu Hu, Yanqiao Zhu, Shu Wu, Liang Wang, and Tieniu Tan. 2019. Hierarchical graph convolutional networks for semi-supervised node classification. In Proceedings of the 28th International Joint Conference on Artificial Intelligence. 4532–4539.

[18]

Xia Hu, Xia Hu, and Xia Hu. 2017. Label informed attributed network embedding. In Proceedings of the 10th ACM International Conference on Web Search and Data Mining. 731–739.

[19]

Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the 2017 International Conference on Learning Representations.

[20]

Daniel D. Lee and H. Sebastian Seung. 2001. Algorithms for non-negative matrix factorization. In Proceedings of the Advances in Neural Information Processing Systems. T. K. Leen, T. G. Dietterich, and V. Tresp (Eds.). MIT Press, 556–562. Retrieved from http://papers.nips.cc/paper/1861-algorithms-for-non-negative-matrix-factorization.pdf.

[21]

Lizi Liao, Xiangnan He, Hanwang Zhang, and Tat Seng Chua. 2018. Attributed social network embedding. IEEE Transactions on Knowledge & Data Engineering 30, 12 (2018), 2257--2270. dblp computer science bibliography, https://dblp.org.

Digital Library

[22]

David Liben-Nowell and Jon Kleinberg. 2007. The link-prediction problem for social networks. Journal of the Association for Information Science and Technology 58, 7 (2007), 1019–1031.

Digital Library

[23]

David Libennowell and Jon M. Kleinberg. 2007. The link-prediction problem for social networks. Journal of the Association for Information Science and Technology 58, 7 (2007), 1019–1031.

Digital Library

[24]

David Lusseau, Karsten Schneider, Oliver J. Boisseau, Patti Haase, Elisabeth Slooten, and Steve M. Dawson. 2003. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54, 4 (2003), 396–405.

[25]

Linyuan Lü and Tao Zhou. 2010. Link prediction in complex networks: A survey. Physica A Statistical Mechanics & Its Applications 390, 6 (2010), 1150–1170.

[26]

Laurens Van Der Maaten and Geoffrey Hinton. 2008. Visualizing data using t-SNE. Journal of Machine Learning Research 9, 2605 (2008), 2579–2605.

[27]

Tong Man, Huawei Shen, Shenghua Liu, Xiaolong Jin, and Xueqi Cheng. 2016. Predict anchor links across social networks via an embedding approach. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. 1823–1829.

Digital Library

[28]

Tomas Mikolov, Kai Chen, Greg S. Corrado, and Jeffrey Dean. 2013. Efficient estimation of word representations in vector space. In Proceedings of the International Conference on Learning Representations.

[29]

Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S. Corrado, and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In Proceedings of the Advances in Neural Information Processing Systems. 3111–3119.

[30]

Erxue Min, Xifeng Guo, Qiang Liu, Gen Zhang, Jianjing Cui, and Jun Long. 2018. A survey of clustering with deep learning: From the perspective of network architecture. IEEE Access 6 (2018), 39501–39514. dblp computer science bibliography, https://dblp.org.

[31]

Mark E. J. Newman. 2003. The structure and function of complex networks. SIAM Review 45, 2 (2003), 167–256.

Digital Library

[32]

M. E. J. Newman. 2006. Finding community structure in networks using the eigenvectors of matrices. Physical Review E Statistical Nonlinear & Soft Matter Physics 74, 3 Pt 2 (2006), 036104.

[33]

Maximillian Nickel and Douwe Kiela. 2017. Poincare embeddings for learning hierarchical representations. In Proceedings of the Advances in Neural Information Processing Systems. 6338–6347.

[34]

Shirui Pan, Jia Wu, Xingquan Zhu, Chengqi Zhang, and Yang Wang. 2016. Tri-party deep network representation. In Proceedings of the 25th International Joint Conference on Artificial Intelligence. 1895–1901.

[35]

Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. DeepWalk: Online learning of social representations. In Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 701–710.

Digital Library

[36]

Leonardo F. R. Ribeiro, Pedro H. P. Saverese, and Daniel R. Figueiredo. 2017. struc2vec: Learning node representations from structural identity. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 385–394.

[37]

Sam T. Roweis and Lawrence K. Saul. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290, 5500 (2000), 2323.

[38]

Benedek Rozemberczki, Ryan Davies, Rik Sarkar, and Charles Sutton. 2019. GEMSEC: Graph embedding with self clustering. In Proceedings of the 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM’19). 65–72.

Digital Library

[39]

Marta Sales-Pardo, Roger Guimerà, André A. Moreira, and Luís A. Nunes Amaral. 2007. Extracting the hierarchical organization of complex systems. Proceedings of the National Academy of Sciences of the United States of America 104, 39 (2007), 15224–15229.

[40]

Huawei Shen, Xueqi Cheng, Kai Cai, and Mao Bin Hu. 2008. Detect overlapping and hierarchical community structure in networks. Physica A Statistical Mechanics & Its Applications 388, 8 (2008), 1706–1712.

[41]

Huawei Shen, Xueqi Cheng, Kai Cai, and Mao Bin Hu. 2009. Detect overlapping and hierarchical community structure in networks. Physica A Statistical Mechanics & Its Applications 388, 8 (2009), 1706–1712.

[42]

Chaoming Song, Shlomo Havlin, and Hernán A. Makse. 2005. Self-similarity of complex networks. Nature 433, 7024 (2005), 392–395.

[43]

Guojie Song, Xiabing Zhou, Yu Wang, and Kunqing Xie. 2015. Influence maximization on large-scale mobile social network: A divide-and-conquer method. IEEE Transactions on Parallel and Distributed Systems 26, 5 (2015), 1379–1392.

Digital Library

[44]

V. Spirin and L. A. Mirny. 2003. Protein complexes and functional modules in molecular networks.Proceedings of the National Academy of Sciences of the United States of America 100, 21 (2003), 12123–12128.

[45]

Jian Tang, Meng Qu, Mingzhe Wang, Ming Zhang, Jun Yan, and Qiaozhu Mei. 2015. LINE: Large-scale information network embedding. In Proceedings of the International Conference on World Wide Web. 1067–1077.

Digital Library

[46]

Lei Tang and Huan Liu. 2011. Leveraging social media networks for classification. Data Mining and Knowledge Discovery 23, 3 (2011), 447–478.

Digital Library

[47]

J. B. Tenenbaum, V. De Silva, and J. C. Langford. 2000. A global geometric framework for nonlinear dimensionality reduction. Science 290, 5500 (2000), 2319–2323.

[48]

Amanda L. Traud, Peter J. Mucha, and Mason A. Porter. 2012. Social structure of Facebook networks. Social Science Electronic Publishing 391, 16 (2012), 4165–4180.

[49]

Daixin Wang, Peng Cui, and Wenwu Zhu. 2016. Structural deep network embedding. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 1225–1234.

Digital Library

[50]

Suhang Wang, Jiliang Tang, Charu C. Aggarwal, Yi Chang, and Huan Liu. 2017. Signed network embedding in social media. In Proceedings of the 17th SIAM International Conference on Data Mining. 327–335.

[51]

Xiao Wang, Peng Cui, Jing Wang, Jian Pei, Wenwu Zhu, and Shiqiang Yang. 2017. Community preserving network embedding. In Proceedings of the 31st AAAI Conference on Artificial Intelligence. 203–209.

[52]

Dennis M. Wilkinson and Bernardo A. Huberman. 2004. A method for finding communities of related genes. Proceedings of the National Academy of Sciences of the United States of America 101, Suppl. 1 (2004), 5241.

[53]

Tang Xianchao. 2014. A network of books about US politics published around the time of the 2004 presidential election and sold by the online bookseller amazon.com. Retrieved from http://networkdata.ics.uci.edu/data.php?d=polbooks.

[54]

Junyuan Xie, Ross Girshick, and Ali Farhadi. 2016. Unsupervised deep embedding for clustering analysis. In Proceedings of the 33rd International Conference on International Conference on Machine Learning. Vol. 48. 478–487.

[55]

Bo Yang, Jin Di, Jiming Liu, and Dayou Liu. 2013. Hierarchical community detection with applications to real-world network analysis. Data & Knowledge Engineering 83, 4 (2013), 20–38.

Digital Library

[56]

Cheng Yang, Deli Zhao, Deli Zhao, Edward Y. Chang, and Edward Y. Chang. 2015. Network representation learning with rich text information. In Proceedings of the International Conference on Artificial Intelligence. 2111–2117.

[57]

Shuhan Yuan, Xintao Wu, and Yang Xiang. 2017. SNE: Signed network embedding. In Proceedings of the Pacific-Asia Conference on Knowledge Discovery and Data Mining. 183–195.

Cited By

Zhao NLiu QJing MLi JZhao ZWang J(2022)DDMF: A Method for Mining Relatively Important Nodes Based on Distance Distribution and Multi-Index FusionApplied Sciences10.3390/app1201052212:1(522)Online publication date: 5-Jan-2022
https://doi.org/10.3390/app12010522
Liu YLiu JWang ZWang XZhang FXiao Z(2022)Binarized network embedding with community structural informationInformation Sciences: an International Journal10.1016/j.ins.2022.09.055616:C(204-216)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.ins.2022.09.055

Index Terms

Network Embedding on Hierarchical Community Structure Network
1. Computer systems organization
  1. Dependable and fault-tolerant systems and networks
    1. Redundancy
  2. Embedded and cyber-physical systems
    1. Embedded systems
    2. Robotics
2. Networks
  1. Network properties
    1. Network reliability

Recommendations

Hierarchical Community Structure Preserving Network Embedding: A Subspace Approach
CIKM '19: Proceedings of the 28th ACM International Conference on Information and Knowledge Management

To depict ubiquitous relational data in real world, network data have been widely applied in modeling complex relationships. Projecting vertices to low dimensional spaces, quoted as Network Embedding, would thus be applicable to diverse real-world ...
Community Detection via Joint Graph Convolutional Network Embedding in Attribute Network
Artificial Neural Networks and Machine Learning – ICANN 2019: Workshop and Special Sessions
Abstract
Community detection is a foundational task in network analysis. Besides the topology information, in recent years, there have been many methods utilizing network attribute information for community detection. The key of introducing the attribute ...
Network Embedding Based On Structural Information Entropy: Network embedding
BSCI '20: Proceedings of the 2nd ACM International Symposium on Blockchain and Secure Critical Infrastructure

Blockchain is a complex network structure, which has the properties of members and the network relationship of their transactions with each other. If we can quantify its network structure, it will be of great help to our subsequent work. Network ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Transactions on Knowledge Discovery from Data

ACM Transactions on Knowledge Discovery from Data Volume 15, Issue 4

August 2021

486 pages

ISSN:1556-4681

EISSN:1556-472X

DOI:10.1145/3458847

Editor:
Charu Aggarwal
IBM T. J. Watson Research, USA

Issue’s Table of Contents

Copyright © 2021 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 May 2021

Accepted: 01 November 2020

Revised: 01 September 2020

Received: 01 September 2019

Published in TKDD Volume 15, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

National Natural Science Foundation of China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
262
Total Downloads

Downloads (Last 12 months)28
Downloads (Last 6 weeks)4

Reflects downloads up to 22 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhao NLiu QJing MLi JZhao ZWang J(2022)DDMF: A Method for Mining Relatively Important Nodes Based on Distance Distribution and Multi-Index FusionApplied Sciences10.3390/app1201052212:1(522)Online publication date: 5-Jan-2022
https://doi.org/10.3390/app12010522
Liu YLiu JWang ZWang XZhang FXiao Z(2022)Binarized network embedding with community structural informationInformation Sciences: an International Journal10.1016/j.ins.2022.09.055616:C(204-216)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1016/j.ins.2022.09.055

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

HTML Format

View this article in HTML Format.

Media

Figures

Other

Tables

View Issue’s Table of Contents