Andreas Kosmatopoulos
Ioannis Kompatsiaris
ABSTRACT
Graph embedding methods have been developed over recent years with the goal of mapping graph data structures into low dimensional vector spaces so that conventional machine learning tasks can be efficiently evaluated. In particular, random walk based methods sample the graph using random walk sequences that capture a graph's structural properties. In this work, we study the influence of edge weighting strategies that bias the random walk process and we are able to demonstrate that under several settings the biased random walks enhance downstream community detection tasks.
- Lada A Adamic and Eytan Adar. 2003. Friends and neighbors on the web. Social networks , Vol. 25, 3 (2003), 211--230.Google Scholar
- Smriti Bhagat, Graham Cormode, and S Muthukrishnan. 2011. Node classification in social networks. In Social network data analytics . Springer, 115--148.Google Scholar
- Christopher Bishop. 2006. Pattern Recognition and Machine Learning. Pattern Recognition and Machine Learning (2006). Google ScholarDigital Library
- Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, and Alessandro Provetti. 2011. Generalized louvain method for community detection in large networks. In 2011 11th international conference on intelligent systems design and applications. IEEE, 88--93.Google ScholarCross Ref
- Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara, and Angela Ricciardello. 2012. A novel measure of edge centrality in social networks. Knowledge-based systems , Vol. 30 (2012), 136--150. Google ScholarDigital Library
- Santo Fortunato and Marc Barthelemy. 2007. Resolution limit in community detection. Proceedings of the national academy of sciences , Vol. 104, 1 (2007), 36--41.Google ScholarCross Ref
- Palash Goyal and Emilio Ferrara. 2018. Graph embedding techniques, applications, and performance: A survey. Knowledge-Based Systems , Vol. 151 (2018), 78--94.Google ScholarCross Ref
- 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, San Francisco, CA, USA, August 13--17, 2016. ACM , 855--864. Google ScholarDigital Library
- Muhammad Aqib Javed, Muhammad Shahzad Younis, Siddique Latif, Junaid Qadir, and Adeel Baig. 2018. Community detection in networks: A multidisciplinary review. Journal of Network and Computer Applications , Vol. 108 (2018), 87--111. Google ScholarDigital Library
- Glen Jeh and Jennifer Widom. 2002. SimRank: a measure of structural-context similarity. In Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining . 538--543. Google ScholarDigital Library
- Di Jin, Zhizhi Yu, Pengfei Jiao, Shirui Pan, Philip S Yu, and Weixiong Zhang. 2021. A survey of community detection approaches: From statistical modeling to deep learning. arXiv preprint arXiv:2101.01669 (2021).Google Scholar
- Alireza Khadivi, Ali Ajdari Rad, and Martin Hasler. 2011. Network community-detection enhancement by proper weighting. Physical Review E , Vol. 83, 4 (2011), 046104.Google ScholarCross Ref
- Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Physical review E , Vol. 78, 4 (2008), 046110.Google Scholar
- Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http://snap.stanford.edu/data .Google Scholar
- Linyuan Lü and Tao Zhou. 2011. Link prediction in complex networks: A survey. Physica A: statistical mechanics and its applications , Vol. 390, 6 (2011), 1150--1170.Google Scholar
- Xiaoyan Lu, Konstantin Kuzmin, Mingming Chen, and Boleslaw K Szymanski. 2018. Adaptive modularity maximization via edge weighting scheme. Information Sciences , Vol. 424 (2018), 55--68. Google ScholarDigital Library
- Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013a. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781 (2013).Google Scholar
- Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013b. Distributed representations of words and phrases and their compositionality. Advances in neural information processing systems , Vol. 26 (2013), 3111--3119. Google ScholarDigital Library
- Symeon Papadopoulos, Yiannis Kompatsiaris, Athena Vakali, and Ploutarchos Spyridonos. 2012. Community detection in social media. Data Mining and Knowledge Discovery , Vol. 24, 3 (2012), 515--554. Google ScholarDigital Library
- Bryan Perozzi, Rami Al-Rfou, and Steven Skiena. 2014. DeepWalk: online learning of social representations. In The 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '14, New York, NY, USA - August 24 - 27, 2014. ACM , 701--710. Google ScholarDigital Library
- Nguyen Xuan Vinh, Julien Epps, and James Bailey. 2010. Information theoretic measures for clusterings comparison: Variants, properties, normalization and correction for chance. The Journal of Machine Learning Research , Vol. 11 (2010), 2837--2854. Google ScholarDigital Library
- Bernard L Welch. 1947. The generalization of ?Student's' problem when several different population variances are involved. Biometrika , Vol. 34, 1--2 (1947), 28--35.Google ScholarCross Ref
- Jaewon Yang and Jure Leskovec. 2015. Defining and evaluating network communities based on ground-truth. Knowledge and Information Systems , Vol. 42, 1 (2015), 181--213. Google ScholarDigital Library
Index Terms
- Random-Walk Graph Embeddings and the Influence of Edge Weighting Strategies in Community Detection Tasks
Recommendations
Graphs with multiplicative vertex-coloring 2-edge-weightings
A k-weighting w of a graph is an assignment of an integer weight $$w(e)\in \{1,...k\}$$w(e)ź{1,...k} to each edge e. Such an edge weighting induces a vertex coloring c defined by $$c(v)=\mathop {\displaystyle {\prod }}\limits _{v\in e}w(e).$$c(v)=źvźew(...
Hub‐aware random walk graph embedding methods for classification
AbstractIn the last two decades, we are witnessing a huge increase of valuable big data structured in the form of graphs or networks. To apply traditional machine learning and data analytic techniques to such data it is necessary to transform graphs ...
Community Detection Using Restrained Random-Walk Similarity
In this paper, we propose a <italic>restrained random-walk similarity method</italic> for detecting the community structures of graphs. The basic premise of our method is that the starting vertices of finite-length random walks are judged to be in the ...
Comments