{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:42:44Z","timestamp":1761896564334,"version":"3.41.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T00:00:00Z","timestamp":1496620800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10994-017-5644-6","type":"journal-article","created":{"date-parts":[[2017,6,5]],"date-time":"2017-06-05T20:48:44Z","timestamp":1496695724000},"page":"1523-1545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An expressive dissimilarity measure for relational clustering using neighbourhood trees"],"prefix":"10.1007","volume":"106","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0915-8034","authenticated-orcid":false,"given":"Sebastijan","family":"Duman\u010di\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,5]]},"reference":[{"key":"5644_CR1","doi-asserted-by":"publisher","unstructured":"Bader, D. A., Meyerhenke, H., Sanders, P., & Wagner, D. (Eds) (2013). Graph partitioning and graph clustering. In 10th DIMACS implementation challenge workshop, Georgia Institute of Technology, Atlanta, GA, USA, February 13\u201314, 2012. Proceedings, contemporary mathematics, Vol. 588, American Mathematical Society. doi: 10.1090\/conm\/588","DOI":"10.1090\/conm\/588"},{"key":"5644_CR2","doi-asserted-by":"crossref","unstructured":"Bai, L., Ren, P., & Hancock, E. R. (2014). A hypergraph kernel from isomorphism tests. In Proceedings of the 2014 international conference on pattern recognition, ICPR \u201914 (pp. 3880\u20133885), IEEE Computer Society, Washington, DC, USA","DOI":"10.1109\/ICPR.2014.665"},{"key":"5644_CR3","doi-asserted-by":"crossref","unstructured":"Bickel, S., & Scheffer, T. (2004) Multi-view clustering. In Proceedings of the fourth IEEE international conference on data mining, ICDM \u201904 (pp. 19\u201326), IEEE Computer Society, Washington, DC, USA.","DOI":"10.1109\/ICDM.2004.10095"},{"key":"5644_CR4","volume-title":"A survey on tree edit distance and related problems","author":"P Bille","year":"2005","unstructured":"Bille, P. (2005). A survey on tree edit distance and related problems (Vol. 337). Essex, UK: Elsevier Science Publishers Ltd."},{"key":"5644_CR5","unstructured":"Camacho, R., Fonseca, N. A., Rocha, R., & Costa, V. S. (2007). ILP:-just trie it. In 17th international conference on inductive logic programming, ILP (pp. 78\u201387), Corvallis, OR, USA."},{"key":"5644_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0470073047","volume-title":"Mining graph data","author":"DJ Cook","year":"2006","unstructured":"Cook, D. J., & Holder, L. B. (2006). Mining graph data. Hoboken: John Wiley & Sons."},{"key":"5644_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-68856-3","volume-title":"Logical and relational learning. Cognitive technologies","author":"L Raedt De","year":"2008","unstructured":"De Raedt, L. (2008). Logical and relational learning. Cognitive technologies. Berlin: Springer."},{"issue":"2","key":"5644_CR8","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1145\/1046456.1046481","volume":"6","author":"S Dzeroski","year":"2004","unstructured":"Dzeroski, S., & Blockeel, H. (2004). Multi-relational data mining 2004: Workshop report. SIGKDD Explorations, 6(2), 140\u2013141. doi: 10.1145\/1046456.1046481 .","journal-title":"SIGKDD Explorations"},{"key":"5644_CR9","unstructured":"Emde, W., & Wettschereck, D. (1996). Relational instance based learning. In L. Saitta (Ed.), Proceedings 13th international conference on machine learning (ICML 1996) (pp. 122\u2013130), July 3\u20136, 1996. USA: Bari, Italy, Morgan-Kaufman Publishers, San Francisco, CA."},{"issue":"1","key":"5644_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/568574.568575","volume":"4","author":"V Estivill-Castro","year":"2002","unstructured":"Estivill-Castro, V. (2002). Why so many clustering algorithms: A position paper. SIGKDD Explorations Newsletter, 4(1), 65\u201375.","journal-title":"SIGKDD Explorations Newsletter"},{"key":"5644_CR11","doi-asserted-by":"crossref","unstructured":"Fonseca, N. A., Santos Costa, V., & Camacho, R. (2012). Conceptual clustering of multi-relational data. In S. H. Muggleton, A. Tamaddoni-Nezhad, & F. A. Lisi (Eds.), Inductive logic programming: 21st international conference, ILP 2011 (pp. 145\u2013159), Windsor Great Park, UK, July 31\u2013August 3, 2011. Revised Selected Papers. Berlin: Springer.","DOI":"10.1007\/978-3-642-31951-8_16"},{"key":"5644_CR12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.artint.2014.08.003","volume":"217","author":"P Frasconi","year":"2014","unstructured":"Frasconi, P., Costa, F., De Raedt, L., & De Grave, K. (2014). klog: A language for logical and relational learning with kernels. Artificial Intelligence, 217, 117\u2013143.","journal-title":"Artificial Intelligence"},{"key":"5644_CR13","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning (adaptive computation and machine learning)","author":"L Getoor","year":"2007","unstructured":"Getoor, L., & Taskar, B. (2007). Introduction to statistical relational learning (adaptive computation and machine learning). Cambridge: The MIT Press."},{"key":"5644_CR14","first-page":"2211","volume":"12","author":"M Gonen","year":"2011","unstructured":"Gonen, M., & Alpaydin, E. (2011). Multiple kernel learning algorithms. Journal of Machine Learning Research, 12, 2211\u20132268.","journal-title":"Journal of Machine Learning Research"},{"key":"5644_CR15","unstructured":"Haussler, D. (1999). Convolution kernels on discrete structures. Technical Report UCS-CRL-99-10, University of California at Santa Cruz, Santa Cruz, CA, USA"},{"key":"5644_CR16","doi-asserted-by":"crossref","unstructured":"Huang, H. C., Chuang, Y. Y., & Chen, C. S. (2012) Affinity aggregation for spectral clustering. In International conference on computer vision and pattern recognition (pp. 773\u2013780), IEEE Computer Society.","DOI":"10.1109\/CVPR.2012.6247748"},{"key":"5644_CR17","doi-asserted-by":"crossref","unstructured":"Kirsten, M., & Wrobel, S. (1998). Relational distance-based clustering. In Lecture notes in computer science (Vol. 1446, pp. 261\u2013270). Springer-Verlag.","DOI":"10.1007\/BFb0027330"},{"key":"5644_CR18","unstructured":"Kok, S., & Domingos, P. (2010). Learning markov logic networks using structural motifs. In Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 551\u2013558)."},{"key":"5644_CR19","first-page":"353","volume-title":"Combinatorics, Paul Erd\u0151s is eighty","author":"L Lov\u00e1sz","year":"1996","unstructured":"Lov\u00e1sz, L. (1996). Random walks on graphs: A survey. In D. Mikl\u00f3s, V. T. S\u00f3s, & T. Sz\u0151nyi (Eds.), Combinatorics, Paul Erd\u0151s is eighty (Vol. 2, pp. 353\u2013398). Budapest: J\u00e1nos Bolyai Mathematical Society."},{"issue":"1","key":"5644_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1177\/0013164484441003","volume":"44","author":"LC Morey","year":"1984","unstructured":"Morey, L. C., & Agresti, A. (1984). The measurement of classification agreement: An adjustment to the rand statistic for chance agreement. Educational and Psychological Measurement, 44(1), 33\u201337.","journal-title":"Educational and Psychological Measurement"},{"issue":"20","key":"5644_CR21","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"19","author":"S Muggleton","year":"1994","unstructured":"Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19(20), 629\u2013679. doi: 10.1016\/0743-1066(94)90035-3 .","journal-title":"The Journal of Logic Programming"},{"key":"5644_CR22","unstructured":"Neville, J., Adler, M., & Jensen, D. (2003). Clustering relational data using attribute and link information. In Proceedings of the text mining and link analysis workshop, 18th international joint conference on artificial intelligence (pp. 9\u201315)."},{"key":"5644_CR23","unstructured":"Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: Analysis and an algorithm. In Advances in neural information processing systems (pp. 849\u2013856). MIT Press."},{"key":"5644_CR24","doi-asserted-by":"crossref","unstructured":"Ong, I. M., Castro Dutra, I., Page, D., & Costa, V. S. (2005). Mode directed path finding. In 16th European conference on machine learning (pp. 673\u2013681). Berlin: Springer.","DOI":"10.1007\/11564096_68"},{"key":"5644_CR25","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al. (2011). Scikit-learn: Machine learning in Python. Journal of Machine Learning Research, 12, 2825\u20132830.","journal-title":"Journal of Machine Learning Research"},{"issue":"1\u20132","key":"5644_CR26","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10994-006-6064-1","volume":"62","author":"C Perlich","year":"2006","unstructured":"Perlich, C., & Provost, F. (2006). Distribution-based aggregation for relational learning with identifier attributes. Machine Learning, 62(1\u20132), 65\u2013105. doi: 10.1007\/s10994-006-6064-1 .","journal-title":"Machine Learning"},{"key":"5644_CR27","doi-asserted-by":"crossref","unstructured":"Pfeiffer, J. J. III., Moreno, S., La\u00a0Fond, T., Neville, J., & Gallagher, B. (2014). Attributed graph models: Modeling network structure with correlated attributes. In Proceedings of the 23rd international conference on world wide web, WWW \u201914 (pp. 831\u2013842), ACM, New York, NY, USA.","DOI":"10.1145\/2566486.2567993"},{"issue":"336","key":"5644_CR28","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1080\/01621459.1971.10482356","volume":"66","author":"W Rand","year":"1971","unstructured":"Rand, W. (1971). Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66(336), 846\u2013850.","journal-title":"Journal of the American Statistical Association"},{"key":"5644_CR29","unstructured":"Richards, B. L., & Mooney, R. J. (1992). Learning relations by pathfinding. In Proceedings of of AAAI-92 (pp 50\u201355), San Jose, CA."},{"issue":"3","key":"5644_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1609\/aimag.v29i3.2157","volume":"29","author":"P Sen","year":"2008","unstructured":"Sen, P., Namata, G. M., Bilgic, M., Getoor, L., Gallagher, B., & Eliassi-Rad, T. (2008). Collective classification in network data. AI Magazine, 29(3), 93\u2013106.","journal-title":"AI Magazine"},{"key":"5644_CR31","unstructured":"Shervashidze, N., & Borgwardt, K. (2009). Fast subtree kernels on graphs. In Proceedings of the neural information processing systems conference NIPS 2009 (pp. 1660\u20131668), Neural Information Processing Systems Foundation."},{"key":"5644_CR32","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E. J., Mehlhorn, K., & Borgwardt, K. M. (2011). Weisfeiler\u2013Lehman graph kernels. Journal of Machine Learning Research, 12, 2539\u20132561.","journal-title":"Journal of Machine Learning Research"},{"key":"5644_CR33","unstructured":"Sugiyama, M., & Borgwardt, K. (2015). Halting in random walk kernels. In Advances in neural information processing systems 28 (pp 1639\u20131647). Curran Associates, Inc."},{"key":"5644_CR34","unstructured":"Van\u00a0Craenendonck, T., & Blockeel, H. (2015). Using internal validity measures to compare clustering algorithms. In AutoML Workshop at 32nd international conference on machine learning, Lille, July 11, 2015, (pp 1\u20138) https:\/\/lirias.kuleuven.be\/handle\/123456789\/504712"},{"key":"5644_CR35","doi-asserted-by":"crossref","unstructured":"Wachman, G., & Khardon, R. (2007). Learning from interpretations: a rooted kernel for ordered hypergraphs. In Proceedings of the twenty-fourth international conference on machine learning (ICML 2007) (pp. 943\u2013950), Corvallis, Oregon, USA, June 20\u201324, 2007.","DOI":"10.1145\/1273496.1273615"},{"key":"5644_CR36","unstructured":"Wagstaff, K., Cardie, C., Rogers, S., & Schr\u00f6dl, S. (2001) Constrained k-means clustering with background knowledge. In Proceedings of the eighteenth international conference on machine learning, ICML \u201901 (pp. 577\u2013584). San Francisco, CA, USA: Morgan Kaufmann Publishers Inc."},{"issue":"301","key":"5644_CR37","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1080\/01621459.1963.10500845","volume":"58","author":"JH Ward","year":"1963","unstructured":"Ward, J. H. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58(301), 236\u2013244.","journal-title":"Journal of the American Statistical Association"},{"key":"5644_CR38","doi-asserted-by":"crossref","unstructured":"Witsenburg, T., & Blockeel, H. (2011). Improving the accuracy of similarity measures by using link information. In Foundations of intelligent systems\u2014Proceedings of 19th international symposium, ISMIS 2011 (pp. 501\u2013512), Warsaw, Poland, June 28\u201330, 2011.","DOI":"10.1007\/978-3-642-21916-0_54"},{"key":"5644_CR39","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., & Livny, M. (1996). Birch: An efficient data clustering method for very large databases. In Proceedings of the 1996 ACM SIGMOD international conference on management of data, SIGMOD \u201996 (pp. 103\u2013114), ACM, New York, NY, USA","DOI":"10.1145\/233269.233324"},{"key":"5644_CR40","doi-asserted-by":"crossref","unstructured":"Zhao, H., Robles-Kelly, A., & Zhou, J. (2011) On the use of the chi-squared distance for the structured learning of graph embeddings. In Proceedings of the 2011 international conference on digital image computing: techniques and applications, DICTA \u201911 (pp. 422\u2013428), IEEE Computer Society, Washington, DC, USA.","DOI":"10.1109\/DICTA.2011.78"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5644-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5644-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5644-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:05:15Z","timestamp":1750291515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5644-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,5]]},"references-count":40,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["5644"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5644-6","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2017,6,5]]}}}