{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:29:02Z","timestamp":1772490542658,"version":"3.50.1"},"reference-count":50,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,6]],"date-time":"2023-03-06T00:00:00Z","timestamp":1678060800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>Knowledge graphs have risen in popularity in recent years, demonstrating their utility in applications across the spectrum of computer science. Finding their embedded representations is thus highly desirable as it makes them easily operated on and reasoned with by machines. With this in mind, we propose a simple meta-strategy for embedding knowledge graphs using probabilistic coarsening. In this approach, a knowledge graph is first coarsened before being embedded by an arbitrary embedding method. The resulting coarse embeddings are then extended down as those of the initial knowledge graph. Although straightforward, this allows for faster training by reducing knowledge graph complexity while revealing its higher-order structures. We demonstrate this empirically on four real-world datasets, which show that coarse embeddings are learned faster and are often of higher quality. We conclude that coarsening is a recommended prepossessing step regardless of the underlying embedding method used.<\/jats:p>","DOI":"10.3390\/axioms12030275","type":"journal-article","created":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T01:43:35Z","timestamp":1678153415000},"page":"275","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Coarsening for Knowledge Graph Embeddings"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7559-8658","authenticated-orcid":false,"given":"Marcin","family":"Pietrasik","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 2R3, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4783-0717","authenticated-orcid":false,"given":"Marek Z.","family":"Reformat","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB T6G 2R3, Canada"},{"name":"Information Technology Institute, University of Social Sciences, 90-113 \u0141\u00f3d\u017a, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,6]]},"reference":[{"key":"ref_1","unstructured":"Bordes, A., Usunier, N., Chopra, S., and Weston, J. (2015). Large-scale simple question answering with memory networks. arXiv."},{"key":"ref_2","unstructured":"Das, R., Dhuliawala, S., Zaheer, M., Vilnis, L., Durugkar, I., Krishnamurthy, A., Smola, A., and McCallum, A. (2017). Go for a walk and arrive at the answer: Reasoning over paths in knowledge bases using reinforcement learning. arXiv."},{"key":"ref_3","unstructured":"Schlichtkrull, M., Kipf, T.N., Bloem, P., Van Den Berg, R., Titov, I., and Welling, M. (2018). European Semantic Web Conference, Springer."},{"key":"ref_4","first-page":"2787","article-title":"Translating embeddings for modeling multi-relational data","volume":"26","author":"Bordes","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., and Riedel, S. (2017). Convolutional 2d knowledge graph embeddings. arXiv.","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Bellini, V., Schiavone, A., Di Noia, T., Ragone, A., and Di Sciascio, E. (2018, January 6). Knowledge-aware autoencoders for explainable recommender systems. Proceedings of the 3rd Workshop on Deep Learning for Recommender Systems, Vancouver, BC, Canada.","DOI":"10.1145\/3270323.3270327"},{"key":"ref_7","unstructured":"Ristoski, P., and Paulheim, H. (2016). International Semantic Web Conference, Springer."},{"key":"ref_8","unstructured":"Nickel, M., Tresp, V., and Kriegel, H.P. (July, January 28). A three-way model for collective learning on multi-relational data. Proceedings of the 28th International Conference on Machine Learning, Bellevue, WA, USA."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Chen, H., Perozzi, B., Hu, Y., and Skiena, S. (2018, January 2\u20137). Harp: Hierarchical representation learning for networks. Proceedings of the 32nd AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.11849"},{"key":"ref_10","unstructured":"Liang, J., Gurukar, S., and Parthasarathy, S. (2018). Mile: A multi-level framework for scalable graph embedding. arXiv."},{"key":"ref_11","first-page":"18","article-title":"Topological graph theory","volume":"115","author":"Archdeacon","year":"1996","journal-title":"Surv. Congr. Numer."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., and Skiena, S. (2014, January 24\u201327). Deepwalk: Online learning of social representations. Proceedings of the 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, New York, NY, USA.","DOI":"10.1145\/2623330.2623732"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., and Mei, Q. (2015, January 18\u201322). Line: Large-scale information network embedding. Proceedings of the 24th International Conference on World Wide Web, Florence, Italy.","DOI":"10.1145\/2736277.2741093"},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Grover, A., and Leskovec, J. (2016, January 13\u201317). node2vec: Scalable feature learning for networks. Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2939672.2939754"},{"key":"ref_15","first-page":"3111","article-title":"Distributed representations of words and phrases and their compositionality","volume":"26","author":"Mikolov","year":"2013","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_16","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume":"28","author":"Duvenaud","year":"2015","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"ref_17","unstructured":"Kipf, T.N., and Welling, M. (2016). Semi-supervised classification with graph convolutional networks. arXiv."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TNNLS.2020.2978386","article-title":"A comprehensive survey on graph neural networks","volume":"32","author":"Wu","year":"2020","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"ref_19","unstructured":"Simonovsky, M., and Komodakis, N. (2018). International Conference on Artificial Neural Networks, Springer."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Akyildiz, T.A., Aljundi, A.A., and Kaya, K. (2020, January 17\u201320). Gosh: Embedding big graphs on small hardware. Proceedings of the 49th International Conference on Parallel Processing (ICPP), Edmonton, AB, Canada.","DOI":"10.1145\/3404397.3404456"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1006\/jpdc.1997.1404","article-title":"Multilevelk-way partitioning scheme for irregular graphs","volume":"48","author":"Karypis","year":"1998","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Wang, Y., Dong, L., Jiang, X., Ma, X., Li, Y., and Zhang, H. (2021). KG2Vec: A node2vec-based vectorization model for knowledge graph. PLoS ONE, 16.","DOI":"10.1371\/journal.pone.0248552"},{"key":"ref_23","unstructured":"Fionda, V., and Pirr\u00f3, G. (2020, January 7\u201312). Triple2Vec: Learning Triple Embeddings from Knowledge Graphs. Proceedings of the AAAI Conference on Artificial Intelligence, New York, NY, USA."},{"key":"ref_24","unstructured":"Portisch, J., and Paulheim, H. (2021, January 24\u201328). Putting rdf2vec in order. Proceedings of the International Semantic Web Conference (ISWC 2021): Posters and Demo, Virtual Conference."},{"key":"ref_25","unstructured":"Busbridge, D., Sherburn, D., Cavallo, P., and Hammerla, N.Y. (2019). Relational graph attention networks. arXiv."},{"key":"ref_26","unstructured":"Yasunaga, M., Ren, H., Bosselut, A., Liang, P., and Leskovec, J. (2021). 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"e341","DOI":"10.7717\/peerj-cs.341","article-title":"Application and evaluation of knowledge graph embeddings in biomedical data","volume":"7","author":"Alshahrani","year":"2021","journal-title":"PeerJ Comput. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., and Chen, Z. (2014, January 21\u201326). Knowledge graph embedding by translating on hyperplanes. Proceedings of the AAAI Conference on Artificial Intelligence, Portsmouth, NH, USA.","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Lin, Y., Liu, Z., Sun, M., Liu, Y., and Zhu, X. (2015, January 25\u201330). Learning entity and relation embeddings for knowledge graph completion. Proceedings of the AAAI Conference on Artificial Intelligence, Austin, TX, USA.","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"ref_30","unstructured":"Ji, G., He, S., Xu, L., Liu, K., and Zhao, J. (2015). 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), Association for Computational Linguistics."},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Xiao, H., Huang, M., Hao, Y., and Zhu, X. (2015). TransA: An adaptive approach for knowledge graph embedding. arXiv.","DOI":"10.18653\/v1\/P16-1219"},{"key":"ref_32","unstructured":"Nguyen, D.Q., Sirts, K., Qu, L., and Johnson, M. (2016). 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Association for Computational Linguistics."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Ebisu, T., and Ichise, R. (2018, January 2\u20137). Toruse: Knowledge graph embedding on a lie group. Proceedings of the AAAI Conference on Artificial Intelligence, New Orleans, LA, USA.","DOI":"10.1609\/aaai.v32i1.11538"},{"key":"ref_34","unstructured":"Sun, Z., Deng, Z.H., Nie, J.Y., and Tang, J. (2019, January 6\u20139). RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space. Proceedings of the International Conference on Learning Representations, New Orleans, LA, USA."},{"key":"ref_35","unstructured":"Yang, B., Yih, W.t., He, X., Gao, J., and Deng, L. (2014). Embedding entities and relations for learning and inference in knowledge bases. arXiv."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Nickel, M., Rosasco, L., and Poggio, T. (2016, January 12\u201317). Holographic embeddings of knowledge graphs. Proceedings of the AAAI Conference on Artificial Intelligence, Phoenix, AZ, USA.","DOI":"10.1609\/aaai.v30i1.10314"},{"key":"ref_37","unstructured":"Balazevic, I., Allen, C., and Hospedales, T. (2019). 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), Association for Computational Linguistics."},{"key":"ref_38","unstructured":"Ji, S., Pan, S., Cambria, E., Marttinen, P., and Yu, P.S. (2020). A survey on knowledge graphs: Representation, acquisition and applications. arXiv."},{"key":"ref_39","unstructured":"Pietrasik, M., and Reformat, M. (2020). European Semantic Web Conference, Springer."},{"key":"ref_40","first-page":"1","article-title":"A Multi-Level Algorithm For Partitioning Graphs","volume":"95","author":"Hendrickson","year":"1995","journal-title":"SC"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J. Sci. Comput."},{"key":"ref_42","doi-asserted-by":"crossref","unstructured":"Han, X., Cao, S., Xin, L., Lin, Y., Liu, Z., Sun, M., and Li, J. (November, January 31). OpenKE: An Open Toolkit for Knowledge Embedding. Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing: System Demonstrations, Brussels, Belgium.","DOI":"10.18653\/v1\/D18-2024"},{"key":"ref_43","unstructured":"Portisch, J., Hladik, M., and Paulheim, H. (2020, January 1\u20136). RDF2Vec Light\u2014A Lightweight Approach for Knowledge Graph Embeddings. Proceedings of the International Semantic Web Conference, Posters and Demos, Virtual Conference."},{"key":"ref_44","unstructured":"Portisch, J., and Paulheim, H. (2022). The Semantic Web: ESWC 2022 Satellite Events: Hersonissos, Crete, Greece, 29 May\u20132 June 2022, Proceedings, Springer."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Cochez, M., Ristoski, P., Ponzetto, S.P., and Paulheim, H. (2017, January 19\u201322). Biased graph walks for RDF graph embeddings. Proceedings of the 7th International Conference on Web Intelligence, Mining and Semantics, Amantea, Italy.","DOI":"10.1145\/3102254.3102279"},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"399","DOI":"10.3233\/SW-212892","article-title":"Knowledge graph embedding for data mining vs. knowledge graph embedding for link prediction\u2013two sides of the same coin?","volume":"13","author":"Portisch","year":"2022","journal-title":"Semant. Web"},{"key":"ref_47","doi-asserted-by":"crossref","unstructured":"Bhatt, S., Padhee, S., Sheth, A., Chen, K., Shalin, V., Doran, D., and Minnery, B. (2019, January 11\u201315). Knowledge graph enhanced community detection and characterization. Proceedings of the twelfth ACM International Conference on Web Search and Data Mining, Melbourne, VIC, Australia.","DOI":"10.1145\/3289600.3291031"},{"key":"ref_48","unstructured":"Shi, X., Qian, Y., and Lu, H. (2019). Web and Big Data: APWeb-WAIM 2019 International Workshops, KGMA and DSEA, Chengdu, China, August 1\u20133, 2019, Revised Selected Papers 3, Springer."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"3807","DOI":"10.1214\/16-EJS1211","article-title":"Consistent community detection in multi-relational data through restricted multi-layer stochastic blockmodel","volume":"10","author":"Paul","year":"2016","journal-title":"Electron. J. Stat."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"042317","DOI":"10.1103\/PhysRevE.95.042317","article-title":"Community detection, link prediction, and layer interdependence in multilayer networks","volume":"95","author":"Power","year":"2017","journal-title":"Phys. Rev. E"}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/3\/275\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:49:13Z","timestamp":1760122153000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/12\/3\/275"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,6]]},"references-count":50,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["axioms12030275"],"URL":"https:\/\/doi.org\/10.3390\/axioms12030275","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,6]]}}}