{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:04:38Z","timestamp":1766311478509,"version":"build-2065373602"},"reference-count":26,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T00:00:00Z","timestamp":1726444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Deep learning struggles with unsupervised tasks like community detection in networks. This work proposes the Enhanced Community Detection with Structural Information VGAE (VGAE-ECF) method, a method that enhances variational graph autoencoders (VGAEs) for community detection in large networks. It incorporates community structure information and edge weights alongside traditional network data. This combined input leads to improved latent representations for community identification via K-means clustering. We perform experiments and show that our method works better than previous approaches of community-aware VGAEs.<\/jats:p>","DOI":"10.3390\/info15090568","type":"journal-article","created":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T11:36:37Z","timestamp":1726486597000},"page":"568","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Community Detection Using Deep Learning: Combining Variational Graph Autoencoders with Leiden and K-Truss Techniques"],"prefix":"10.3390","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2275-6536","authenticated-orcid":false,"given":"Jyotika Hariom","family":"Patil","sequence":"first","affiliation":[{"name":"Computer Science, San Jose State University, San Jose, CA 95192, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6858-591X","authenticated-orcid":false,"given":"Petros","family":"Potikas","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering, National Technical University of Athens, 15780 Athens, Greece"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9097-1123","authenticated-orcid":false,"given":"William B.","family":"Andreopoulos","sequence":"additional","affiliation":[{"name":"Computer Science, San Jose State University, San Jose, CA 95192, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0332-1347","authenticated-orcid":false,"given":"Katerina","family":"Potika","sequence":"additional","affiliation":[{"name":"Computer Science, San Jose State University, San Jose, CA 95192, USA"}]}],"member":"1968","published-online":{"date-parts":[[2024,9,16]]},"reference":[{"key":"ref_1","first-page":"1149","article-title":"A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning","volume":"35","author":"Jin","year":"2023","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/j.neunet.2022.06.021","article-title":"Modularity-aware graph autoencoders for joint community detection and link prediction","volume":"153","author":"Lutzeyer","year":"2022","journal-title":"Neural Netw."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3633518","article-title":"A Survey on Graph Representation Learning Methods","volume":"15","author":"Khoshraftar","year":"2024","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_4","unstructured":"Zhang, L., Song, H., Aletras, N., and Lu, H. (2022). Graph Node-Feature Convolution for Representation Learning. arXiv."},{"key":"ref_5","unstructured":"Kipf, T.N., and Welling, M. (2016). Variational Graph Auto-Encoders. arXiv."},{"key":"ref_6","unstructured":"Kingma, D., and Welling, M. (2013). Auto-Encoding Variational Bayes. arXiv."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Despalatovi\u0107, L., Vojkovi\u0107, T., and Vukicevi\u0107, D. (2014, January 26\u201330). Community structure in networks: Girvan-Newman algorithm improvement. Proceedings of the 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), Opatija, Croatia.","DOI":"10.1109\/MIPRO.2014.6859714"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/TCSS.2014.2307458","article-title":"Community Detection via Maximization of Modularity and Its Variants","volume":"1","author":"Chen","year":"2014","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"38002","DOI":"10.1209\/0295-5075\/87\/38002","article-title":"Modularity optimization in community detection of complex networks","volume":"87","author":"Zhang","year":"2009","journal-title":"Europhys. Lett."},{"key":"ref_10","unstructured":"Thrun, S., Saul, L., and Sch\u00f6lkopf, B. (2003). Learning Spectral Clustering. Advances in Neural Information Processing Systems, MIT Press."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Choong, J.J., Liu, X., and Murata, T. (2018, January 17\u201320). Learning Community Structure with Variational Autoencoder. Proceedings of the 2018 IEEE International Conference on Data Mining (ICDM), Singapore.","DOI":"10.1109\/ICDM.2018.00022"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Choong, J.J., Liu, X., and Murata, T. (2020). Optimizing variational graph autoencoder for community detection with dual optimization. Entropy, 22.","DOI":"10.3390\/e22020197"},{"key":"ref_13","first-page":"6861","article-title":"Simplifying Graph Convolutional Networks","volume":"Volume 97","author":"Chaudhuri","year":"2019","journal-title":"Proceedings of the 36th International Conference on Machine Learning"},{"key":"ref_14","unstructured":"Guyon, I., von Luxburg, U., Bengio, S., Wallach, H.M., Fergus, R., Vishwanathan, S.V.N., and Garnett, R. (2017, January 4\u20139). Neural Expectation Maximization. Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, Long Beach, CA, USA."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum Likelihood from Incomplete Data via the EM Algorithm","volume":"39","author":"Dempster","year":"1977","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast Unfolding of Communities in Large Networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"119775","DOI":"10.1016\/j.eswa.2023.119775","article-title":"A Novel Network Core Structure Extraction Algorithm Utilized Variational Autoencoder for Community Detection","volume":"222","author":"Fei","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"ref_18","first-page":"1","article-title":"Trusses: Cohesive subgraphs for social network analysis","volume":"16","author":"Cohen","year":"2008","journal-title":"Natl. Secur. Agency Tech. Rep."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-41695-z","article-title":"From Louvain to Leiden: Guaranteeing well-connected communities","volume":"9","author":"Traag","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"032317","DOI":"10.1103\/PhysRevE.96.032317","article-title":"Generalized model for k-core percolation and interdependent networks","volume":"96","author":"Panduranga","year":"2017","journal-title":"Phys. Rev. E"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Moseley, B., Vattani, A., Kumar, R., and Vassilvitskii, S. (2012). Scalable K-Means++. arXiv.","DOI":"10.14778\/2180912.2180915"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"de Rijke, M., Kenter, T., de Vries, A.P., Zhai, C., de Jong, F., Radinsky, K., and Hofmann, K. (2014). CiteSeerx: A Scholarly Big Dataset. Advances in Information Retrieval, Springer.","DOI":"10.1007\/978-3-319-06028-6"},{"key":"ref_23","unstructured":"(2024, September 11). Available online: https:\/\/ieee-dataport.org\/documents\/cora."},{"key":"ref_24","unstructured":"Kingma, D.P., and Ba, J. (2017). Adam: A Method for Stochastic Optimization. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Salha, G., Hennequin, R., and Vazirgiannis, M. (2020). Simple and Effective Graph Autoencoders with One-Hop Linear Models. arXiv.","DOI":"10.1007\/978-3-030-67658-2_19"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3354","DOI":"10.1073\/pnas.1309933111","article-title":"Equitability, mutual information, and the maximal information coefficient","volume":"111","author":"Kinney","year":"2014","journal-title":"Proc. Natl. Acad. Sci. USA"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/9\/568\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T15:57:23Z","timestamp":1760111843000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/15\/9\/568"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,9,16]]},"references-count":26,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["info15090568"],"URL":"https:\/\/doi.org\/10.3390\/info15090568","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2024,9,16]]}}}