{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:41:02Z","timestamp":1780090862136,"version":"3.54.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2020,12,1]],"date-time":"2020-12-01T00:00:00Z","timestamp":1606780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"},{"start":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T00:00:00Z","timestamp":1607904000000},"content-version":"vor","delay-in-days":13,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Med Inform Decis Mak"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:sec>\n                <jats:title>Background<\/jats:title>\n                <jats:p>Leveraging graphs for machine learning tasks can result in more expressive power as extra information is added to the data by explicitly encoding relations between entities. Knowledge graphs are multi-relational, directed graph representations of domain knowledge. Recently, deep learning-based techniques have been gaining a lot of popularity. They can directly process these type of graphs or learn a low-dimensional numerical representation. While it has been shown empirically that these techniques achieve excellent predictive performances, they lack interpretability. This is of vital importance in applications situated in critical domains, such as health care.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Methods<\/jats:title>\n                <jats:p>We present a technique that mines interpretable walks from knowledge graphs that are very informative for a certain classification problem. The walks themselves are of a specific format to allow for the creation of data structures that result in very efficient mining. We combine this mining algorithm with three different approaches in order to classify nodes within a graph. Each of these approaches excels on different dimensions such as explainability, predictive performance and computational runtime.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Results<\/jats:title>\n                <jats:p>We compare our techniques to well-known state-of-the-art black-box alternatives on four benchmark knowledge graph data sets. Results show that our three presented approaches in combination with the proposed mining algorithm are at least competitive to the black-box alternatives, even often outperforming them, while being interpretable.<\/jats:p>\n              <\/jats:sec><jats:sec>\n                <jats:title>Conclusions<\/jats:title>\n                <jats:p>The mining of walks is an interesting alternative for node classification in knowledge graphs. Opposed to the current state-of-the-art that uses deep learning techniques, it results in inherently interpretable or transparent models without a sacrifice in terms of predictive performance.<\/jats:p>\n              <\/jats:sec>","DOI":"10.1186\/s12911-020-01134-w","type":"journal-article","created":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T08:02:54Z","timestamp":1607932974000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["MINDWALC: mining interpretable, discriminative walks for classification of nodes in a knowledge graph"],"prefix":"10.1186","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9531-0623","authenticated-orcid":false,"given":"Gilles","family":"Vandewiele","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bram","family":"Steenwinckel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip De","family":"Turck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Femke","family":"Ongenae","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,12,14]]},"reference":[{"key":"1134_CR1","doi-asserted-by":"publisher","unstructured":"Hamilton WL, Ying R, Leskovec J. Representation Learning on Graphs: Methods and Applications. Prepr article to appear in the IEEE Data Eng Bull. 2017. https:\/\/doi.org\/10.1038\/nature23018.1709.05584.","DOI":"10.1038\/nature23018.1709.05584"},{"key":"1134_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/DS-170007","volume":"1","author":"X Wilcke","year":"2017","unstructured":"Wilcke X, Bloem P, De Boer V. The Knowledge Graph as the Default Data Model for Machine Learning. Data Science. 2017; 1:1. https:\/\/doi.org\/10.3233\/DS-170007.","journal-title":"Data Science"},{"issue":"7","key":"1134_CR3","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1002\/asi.20591","volume":"58","author":"D Liben-Nowell","year":"2007","unstructured":"Liben-Nowell D, Kleinberg J. The link-prediction problem for social networks. J Am Soc Inf Sci Technol. 2007; 58(7):1019\u201331.","journal-title":"J Am Soc Inf Sci Technol"},{"key":"1134_CR4","doi-asserted-by":"publisher","unstructured":"Backstrom L, Leskovec J. Supervised Random Walks: Predicting and Recommending Links in Social Networks. Proc Fourth ACM Int Conf on Web Search Data Min. 2011. https:\/\/doi.org\/10.1145\/1935826.1935914.1011.4071.","DOI":"10.1145\/1935826.1935914.1011.4071"},{"key":"1134_CR5","unstructured":"Hamilton WL, Ying R, Leskovec J. Inductive Representation Learning on Large Graphs. In: In: NIPS: 2017. p. 1\u201319. http:\/\/arxiv.org\/abs\/1706.02216."},{"key":"1134_CR6","doi-asserted-by":"crossref","unstructured":"Suchanek FM, Kasneci G, Weikum G. YAGO: a core of semantic knowledge. Proc the 16th Int Conf on World Wide Web. 2007:697\u2013706. https:\/\/doi.org\/10.1145\/1242572.1242667.","DOI":"10.1145\/1242572.1242667"},{"key":"1134_CR7","doi-asserted-by":"publisher","unstructured":"Auer S, Bizer C, Kobilarov G, Lehmann J, Cyganiak R, Ives Z. DBpedia: A nucleus for a Web of open data. In: Lecture Notes in Computer Science (including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) vol. 4825 LNCS. Springer: 2007. p. 722\u2013735. https:\/\/doi.org\/10.1007\/978-3-540-76298-052.","DOI":"10.1007\/978-3-540-76298-052"},{"key":"1134_CR8","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1002\/ajp.20927","volume":"2010","author":"A Carlson","year":"2010","unstructured":"Carlson A, Betteridge J, Kisiel B. Toward an Architecture for Never-Ending Language Learning. Proc Conf Artif Intell (AAAI). 2010; 2010:1306\u201313. https:\/\/doi.org\/10.1002\/ajp.20927.","journal-title":"Proc Conf Artif Intell (AAAI)"},{"key":"1134_CR9","unstructured":"Bollacker K, Evans C, Paritosh P, Sturge T, Taylor J. Freebase. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data - SIGMOD \u201908: 2008. p. 1247. https:\/\/doi.org\/10.1145\/1376616.1376746http:\/\/citeseer.ist.psu.edu\/viewdoc\/summary?https:\/\/doi.org\/10.1.1.538.7139."},{"key":"1134_CR10","doi-asserted-by":"publisher","unstructured":"Dong X, Gabrilovich E, Heitz G, Horn W, Lao N, Murphy K, Strohmann T, Sun S, Zhang W. Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining - KDD \u201914: 2014. p. 601\u2013610. https:\/\/doi.org\/10.1145\/2623330.2623623. arXiv:1301.3781v3.","DOI":"10.1145\/2623330.2623623."},{"key":"1134_CR11","volume-title":"2018 World Symposium on Digital Intelligence for Systems and Machines (DISA)","author":"A Holzinger","year":"2018","unstructured":"Holzinger A. From machine learning to explainable ai. In: 2018 World Symposium on Digital Intelligence for Systems and Machines (DISA). Berlin: Springer: 2018. p. 55\u201366."},{"key":"1134_CR12","unstructured":"Holzinger A, Biemann C, Pattichis CS, Kell DB. What do we need to build explainable ai systems for the medical domain?arXiv preprint. 2017. arXiv:1712.09923."},{"key":"1134_CR13","volume-title":"Advances in Neural Information Processing Systems","author":"SM Lundberg","year":"2017","unstructured":"Lundberg SM, Lee S-I. A unified approach to interpreting model predictions. In: Advances in Neural Information Processing Systems. New York: Curran Associates: 2017. p. 4765\u201374."},{"key":"1134_CR14","volume-title":"Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"MT Ribeiro","year":"2016","unstructured":"Ribeiro MT, Singh S, Guestrin C. why should i trust you?\" explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. New York: ACM: 2016. p. 1135\u201344."},{"key":"1134_CR15","doi-asserted-by":"crossref","unstructured":"Slack D, Hilgard S, Jia E, Singh S, Lakkaraju H. How can we fool lime and shap? adversarial attacks on post hoc explanation methods. arXiv preprint arXiv:1911.02508. 2019.","DOI":"10.1145\/3375627.3375830"},{"issue":"5","key":"1134_CR16","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/s42256-019-0048-x","volume":"1","author":"C Rudin","year":"2019","unstructured":"Rudin C. Stop explaining black box machine learning models for high stakes decisions and use interpretable models instead. Nat Mach Intell. 2019; 1(5):206\u201315.","journal-title":"Nat Mach Intell"},{"key":"1134_CR17","unstructured":"Latouche P, Rossi F. Graphs in machine learning: an introduction. ESANN. 2015:207\u201318. https:\/\/doi.org\/1506.06962."},{"key":"1134_CR18","doi-asserted-by":"publisher","first-page":"556","DOI":"10.1002\/asi.v58:7.arXiv:1010.0725v1","volume":"2003","author":"D Liben-Nowell","year":"2003","unstructured":"Liben-Nowell D, Kleinberg J. The Link Prediction Problem for Social Networks. Proc Twelfth Annual ACM Int Conf Inf Knowl Manag (CIKM). 2003; 2003:556\u20139. https:\/\/doi.org\/10.1002\/asi.v58:7.arXiv:1010.0725v1.","journal-title":"Proc Twelfth Annual ACM Int Conf Inf Knowl Manag (CIKM)"},{"key":"1134_CR19","doi-asserted-by":"publisher","unstructured":"Bhagat S, Cormode G, Muthukrishnan S. Node classification in social networks. Soc Netw Data Analytics. 2011. https:\/\/doi.org\/10.1007\/978-1-4419-8462-351101.3291.","DOI":"10.1007\/978-1-4419-8462-351101.3291"},{"key":"1134_CR20","doi-asserted-by":"publisher","first-page":"1201","DOI":"10.1142\/97898127724350002.0807.0093","volume":"11","author":"SVN Vishwanathan","year":"2010","unstructured":"Vishwanathan SVN, Schraudolph N, Kondor R, Borgwardt KM. Graph Kenrels. J Mach Learn Res. 2010; 11:1201\u201342. https:\/\/doi.org\/10.1142\/97898127724350002.0807.0093.","journal-title":"J Mach Learn Res"},{"key":"1134_CR21","volume-title":"Extended Semantic Web Conference","author":"U L\u00f6sch","year":"2012","unstructured":"L\u00f6sch U, Bloehdorn S, Rettinger A. Graph kernels for rdf data. In: Extended Semantic Web Conference. Berlin: Springer: 2012. p. 134\u201348."},{"key":"1134_CR22","volume-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","author":"GK de Vries","year":"2013","unstructured":"de Vries GK. A fast approximation of the weisfeiler-lehman graph kernel for rdf data. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. Berlin: Springer: 2013. p. 606\u201321."},{"key":"1134_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.websem.2015.08.002","volume":"35","author":"GKD de Vries","year":"2015","unstructured":"de Vries GKD, de Rooij S. Substructure counting graph kernels for machine learning from rdf data. Web Semant Sci Serv Agents World Wide Web. 2015; 35:71\u201384.","journal-title":"Web Semant Sci Serv Agents World Wide Web"},{"key":"1134_CR24","volume-title":"International Semantic Web Conference","author":"N Fanizzi","year":"2008","unstructured":"Fanizzi N, d\u2019Amato C, Esposito F. Statistical learning for inductive query answering on owl ontologies. In: International Semantic Web Conference. Berlin: Springer: 2008. p. 195\u2013212."},{"key":"1134_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.knosys.2018.03.022","volume":"151","author":"P Goyal","year":"2018","unstructured":"Goyal P, Ferrara E. Graph embedding techniques, applications, and performance: A survey. Knowl-Based Syst. 2018; 151:78\u201394. Elsevier.","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"1134_CR26","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/JPROC.2015.2483592","volume":"104","author":"M Nickel","year":"2015","unstructured":"Nickel M, Murphy K, Tresp V, Gabrilovich E. A review of relational machine learning for knowledge graphs. Proc IEEE. 2015; 104(1):11\u201333.","journal-title":"Proc IEEE"},{"key":"1134_CR27","unstructured":"Mikolov T, Chen K, Corrado G, Dean J. Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781. 2013."},{"key":"1134_CR28","volume-title":"International Semantic Web Conference","author":"P Ristoski","year":"2016","unstructured":"Ristoski P, Paulheim H. Rdf2vec: Rdf graph embeddings for data mining. In: International Semantic Web Conference. Berlin : Springer: 2016. p. 498\u2013514."},{"key":"1134_CR29","volume-title":"International Semantic Web Conference","author":"M Cochez","year":"2017","unstructured":"Cochez M, Ristoski P, Ponzetto SP, Paulheim H. Global rdf vector space embeddings. In: International Semantic Web Conference. Berlin: Springer: 2017. p. 190\u2013207."},{"key":"1134_CR30","doi-asserted-by":"crossref","unstructured":"Saeed MR, Prasanna VK. Extracting entity-specific substructures for rdf graph embedding. In: 2018 IEEE International Conference on Information Reuse and Integration (IRI). IEEE: 2018. p. 378\u201385.","DOI":"10.1109\/IRI.2018.00063"},{"key":"1134_CR31","volume-title":"Advances in Neural Information Processing Systems","author":"M Defferrard","year":"2016","unstructured":"Defferrard M, Bresson X, Vandergheynst P. Convolutional neural networks on graphs with fast localized spectral filtering. In: Advances in Neural Information Processing Systems. New York: Curran Associates: 2016. p. 3844\u201352."},{"key":"1134_CR32","unstructured":"Kipf T. N, Welling M. Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907. 2016."},{"key":"1134_CR33","doi-asserted-by":"crossref","unstructured":"Schlichtkrull M, Kipf T. N, Bloem P, Van Den Berg R, Titov I, Welling M. Modeling Relational Data with Graph Convolutional Networks. In: European Semantic Web Conference. Springer: 2018. p. 593\u2013607.","DOI":"10.1007\/978-3-319-93417-4_38"},{"issue":"1","key":"1134_CR34","first-page":"81","volume":"1","author":"JR Quinlan","year":"1986","unstructured":"Quinlan JR. Induction of decision trees. Mach Learn. 1986; 1(1):81\u2013106.","journal-title":"Mach Learn"},{"key":"1134_CR35","volume-title":"European Working Session on Learning","author":"C Schaffer","year":"1991","unstructured":"Schaffer C. When does overfitting decrease prediction accuracy in induced decision trees and rule sets?. In: European Working Session on Learning. Berlin: Springer: 1991. p. 192\u2013205."},{"key":"1134_CR36","doi-asserted-by":"publisher","DOI":"10.1201\/9781315139470","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"2017","unstructured":"Breiman L. Classification and Regression Trees. Abingdon-on-Thames: Routledge; 2017."},{"key":"1134_CR37","unstructured":"Kuhn M, Weston S, Coulter N, Quinlan J. R. C50: decision trees and rule-based models. 2004. https:\/\/cran.r-project.org\/web\/packages\/C50\/. Accessed 9 June 2020."},{"issue":"1","key":"1134_CR38","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman L. Random forests. Mach Learn. 2001; 45(1):5\u201332.","journal-title":"Mach Learn"},{"key":"1134_CR39","volume-title":"International Semantic Web Conference","author":"P Ristoski","year":"2016","unstructured":"Ristoski P, de Vries GKD, Paulheim H. A collection of benchmark datasets for systematic evaluations of machine learning on the semantic web. In: International Semantic Web Conference. Berlin: Springer: 2016. p. 186\u201394."},{"key":"1134_CR40","volume-title":"European Semantic Web Conference","author":"M Schlichtkrull","year":"2018","unstructured":"Schlichtkrull M, Kipf T. N, Bloem P, Van Den Berg R, Titov I, Welling M. Modeling relational datawith graph convolutional networks. In: European Semantic Web Conference. Berlin: Springer: 2018. p. 593\u2013607."},{"issue":"12","key":"1134_CR41","doi-asserted-by":"publisher","first-page":"1809","DOI":"10.1130\/0016-7606(1960)71[1809:DASTFS]2.0.CO;2","volume":"71","author":"RF Flint","year":"1960","unstructured":"Flint RF, Sanders J, Rodgers J. Diamictite, a substitute term for symmictite. Geol Soc Am Bull. 1960; 71(12):1809\u201310.","journal-title":"Geol Soc Am Bull"}],"container-title":["BMC Medical Informatics and Decision Making"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12911-020-01134-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12911-020-01134-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12911-020-01134-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,14]],"date-time":"2020-12-14T08:05:11Z","timestamp":1607933111000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcmedinformdecismak.biomedcentral.com\/articles\/10.1186\/s12911-020-01134-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12]]},"references-count":41,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1134"],"URL":"https:\/\/doi.org\/10.1186\/s12911-020-01134-w","relation":{},"ISSN":["1472-6947"],"issn-type":[{"value":"1472-6947","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,12]]},"assertion":[{"value":"14 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"191"}}