{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:19:24Z","timestamp":1740122364871,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T00:00:00Z","timestamp":1552003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10618-019-00621-7","type":"journal-article","created":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T11:05:40Z","timestamp":1552043140000},"page":"1254-1297","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Counts-of-counts similarity for prediction and search in relational data"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5641-8153","authenticated-orcid":false,"given":"Manfred","family":"Jaeger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Lippi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giovanni","family":"Pellegrini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Passerini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,8]]},"reference":[{"issue":"6","key":"621_CR1","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1145\/293347.293348","volume":"45","author":"S Arya","year":"1998","unstructured":"Arya S, Mount DM, Netanyahu NS, Silverman R, Wu AY (1998) An optimal algorithm for approximate nearest neighbor searching fixed dimensions. J ACM (JACM) 45(6):891\u2013923","journal-title":"J ACM (JACM)"},{"key":"621_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10994-006-8713-9","volume":"64","author":"AV Assche","year":"2006","unstructured":"Assche AV, Vens C, Blockeel H, Dzeroski S (2006) First order random forests: learning relational classifiers with complex aggregates. Mach Learn 64:149\u2013182","journal-title":"Mach Learn"},{"key":"621_CR3","doi-asserted-by":"crossref","unstructured":"Barla A, Odone F, Verri A (2003) Histogram intersection kernel for image classification. In: Proceedings 2003 international conference on image processing (Cat. No.03CH37429), vol. 3, pp III\u2013513","DOI":"10.1109\/ICIP.2003.1247294"},{"key":"621_CR4","unstructured":"Bellet A, Habrard A, Sebban M (2013) A survey on metric learning for feature vectors and structured data. CoRR arXiv:1306.6709"},{"key":"621_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1128-0","volume-title":"Harmonic analysis on semigroups: theory of positive definite and related functions, Graduate Texts in Mathematics","author":"C Berg","year":"1984","unstructured":"Berg C, Christensen JP, Ressel P (1984) Harmonic analysis on semigroups: theory of positive definite and related functions, Graduate Texts in Mathematics, vol 100, 1st edn. Springer, Berlin","edition":"1"},{"key":"621_CR6","doi-asserted-by":"crossref","unstructured":"Chan T, Esedoglu S, Ni K (2007) Histogram based segmentation using Wasserstein distances. In: International conference on scale space and variational methods in computer vision, Springer, pp 697\u2013708","DOI":"10.1007\/978-3-540-72823-8_60"},{"key":"621_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson KL (2006) Nearest-neighbor searching and metric space dimensions. In: In nearest-neighbor methods for learning and vision: theory and practice, MIT Press, Cambridge","DOI":"10.7551\/mitpress\/4908.003.0005"},{"issue":"1","key":"621_CR8","first-page":"533","volume":"15","author":"M Cuturi","year":"2014","unstructured":"Cuturi M, Avis D (2014) Ground metric learning. J Mach Learn Res 15(1):533\u2013564","journal-title":"J Mach Learn Res"},{"issue":"2","key":"621_CR9","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1348246.1348248","volume":"40","author":"R Datta","year":"2008","unstructured":"Datta R, Joshi D, Li J, Wang JZ (2008) Image retrieval: ideas, influences, and trends of the new age. ACM Comput Surv 40(2):5:1\u20135:60","journal-title":"ACM Comput Surv"},{"issue":"1","key":"621_CR10","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11192-006-0144-7","volume":"69","author":"L Egghe","year":"2006","unstructured":"Egghe L (2006) Theory and practise of the g-index. Scientometrics 69(1):131\u2013152","journal-title":"Scientometrics"},{"issue":"11","key":"621_CR11","doi-asserted-by":"publisher","first-page":"3184","DOI":"10.1109\/TCYB.2017.2761798","volume":"48","author":"A Gardner","year":"2018","unstructured":"Gardner A, Duncan CA, Kanno J, Selmic RR (2018) On the definiteness of earth mover\u2019s distance and its relation to set intersection. IEEE Trans Cybern 48(11):3184\u20133196","journal-title":"IEEE Trans Cybern"},{"key":"621_CR12","doi-asserted-by":"crossref","unstructured":"Grover A, Leskovec J (2016) Node2vec: scalable feature learning for networks. In: Proceedings of the 22Nd ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, KDD \u201916, pp 855\u2013864","DOI":"10.1145\/2939672.2939754"},{"issue":"46","key":"621_CR13","doi-asserted-by":"publisher","first-page":"16,569","DOI":"10.1073\/pnas.0507655102","volume":"102","author":"JE Hirsch","year":"2005","unstructured":"Hirsch JE (2005) An index to quantify an individual\u2019s scientific research output. Proc Natl Acad Sci USA 102(46):16,569","journal-title":"Proc Natl Acad Sci USA"},{"issue":"4","key":"621_CR14","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10588-008-9040-4","volume":"15","author":"PD Hoff","year":"2009","unstructured":"Hoff PD (2009) Multiplicative latent factor models for description and prediction of social networks. Comput Math Organ Theory 15(4):261\u2013272","journal-title":"Comput Math Organ Theory"},{"key":"621_CR15","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.artint.2013.08.002","volume":"204","author":"M Jaeger","year":"2013","unstructured":"Jaeger M, Lippi M, Passerini A, Frasconi P (2013) Type extension trees for feature construction and learning in relational domains. Artif Intell 204:30\u201355","journal-title":"Artif Intell"},{"key":"621_CR16","doi-asserted-by":"crossref","unstructured":"J\u00e4rvelin K, Kek\u00e4l\u00e4inen J (2000) IR evaluation methods for retrieving highly relevant documents. In: Proceedings of the 23rd annual international ACM SIGIR conference on research and development in information retrieval, ACM, pp 41\u201348","DOI":"10.1145\/345508.345545"},{"key":"621_CR17","doi-asserted-by":"crossref","unstructured":"Jeh G, Widom J (2002) Simrank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, KDD \u201902, pp 538\u2013543","DOI":"10.1145\/775047.775126"},{"key":"621_CR18","doi-asserted-by":"crossref","unstructured":"Khan A, Li N, Yan X, Guan Z, Chakraborty S, Tao S (2011) Neighborhood based fast graph search in large networks. In: Proceedings of the 2011 ACM SIGMOD international conference on management of data, ACM, pp 901\u2013912","DOI":"10.1145\/1989323.1989418"},{"key":"621_CR19","unstructured":"Kingma DP, Ba J (2015) Adam: a method for stochastic optimization. In: Proceedings of the 3rd international conference on learning representations (ICLR)"},{"key":"621_CR20","doi-asserted-by":"crossref","unstructured":"Knobbe AJ, Siebes A, van der Wallen D (1999) Multi-relational decision tree induction. In: Proceedings of PKDD-99, pp 378\u2013383","DOI":"10.1007\/978-3-540-48247-5_46"},{"issue":"2","key":"621_CR21","doi-asserted-by":"publisher","first-page":"026,120","DOI":"10.1103\/PhysRevE.73.026120","volume":"73","author":"EA Leicht","year":"2006","unstructured":"Leicht EA, Holme P, Newman ME (2006) Vertex similarity in networks. Phys Rev E 73(2):026,120","journal-title":"Phys Rev E"},{"key":"621_CR22","first-page":"825","volume-title":"Advances in neural information processing systems","author":"T Liu","year":"2005","unstructured":"Liu T, Moore AW, Yang K, Gray AG (2005) An investigation of practical approximate nearest neighbor algorithms. In: Saul LK, Weiss Y, Bottou L (eds) Advances in neural information processing systems, vol 17. MIT Press, Cambridge, pp 825\u2013832"},{"key":"621_CR23","doi-asserted-by":"crossref","unstructured":"Liu Z, Zheng VW, Zhao Z, Zhu F, Chang KC, Wu M, Ying J (2017) Semantic proximity search on heterogeneous graph by proximity embedding. In: Singh SP, Markovitch S (eds) Proceedings of the thirty-first AAAI conference on artificial intelligence, February 4\u20139, 2017, San Francisco, CA, AAAI Press, pp 154\u2013160","DOI":"10.1609\/aaai.v31i1.10486"},{"key":"621_CR24","doi-asserted-by":"crossref","unstructured":"Ljosa V, Bhattacharya A, Singh AK (2006) Indexing spatially sensitive distance measures using multi-resolution lower bounds. In: International conference on extending database technology, Springer, Berlin, pp 865\u2013883","DOI":"10.1007\/11687238_51"},{"issue":"6","key":"621_CR25","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/TPAMI.2015.2477830","volume":"38","author":"G Loosli","year":"2016","unstructured":"Loosli G, Canu S, Ong CS (2016) Learning SVM in Kre\u012dn spaces. IEEE Trans Pattern Anal Mach Intell 38(6):1204\u20131216","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"5","key":"621_CR26","doi-asserted-by":"publisher","first-page":"365","DOI":"10.14778\/2732269.2732273","volume":"7","author":"D Mottin","year":"2014","unstructured":"Mottin D, Lissandrini M, Velegrakis Y, Palpanas T (2014) Exemplar queries: give me an example of what you need. Proc VLDB Endow 7(5):365\u2013376","journal-title":"Proc VLDB Endow"},{"issue":"11","key":"621_CR27","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2014.2321376","volume":"36","author":"M Muja","year":"2014","unstructured":"Muja M, Lowe DG (2014) Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans Pattern Anal Mach Intell 36(11):2227\u20132240","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"issue":"3","key":"621_CR28","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1137\/05064206X","volume":"37","author":"A Naor","year":"2007","unstructured":"Naor A, Schechtman G (2007) Planar earthmover is not in l_1. SIAM J Comput 37(3):804\u2013826","journal-title":"SIAM J Comput"},{"issue":"2","key":"621_CR29","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10994-015-5517-9","volume":"102","author":"M Neumann","year":"2016","unstructured":"Neumann M, Garnett R, Bauckhage C, Kersting K (2016) Propagation kernels: efficient graph kernels from propagated information. Mach Learn 102(2):209\u2013245","journal-title":"Mach Learn"},{"key":"621_CR30","doi-asserted-by":"crossref","unstructured":"Neville J, Jensen D, Friedland L, Hay M (2003) Learning relational probability trees. In: Proceedings of the 9th ACM SIGKDD international conference on knowledge discovery and data mining (KDD-03)","DOI":"10.1145\/956750.956830"},{"issue":"3","key":"621_CR31","doi-asserted-by":"publisher","first-page":"036,104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman ME (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74(3):036,104","journal-title":"Phys Rev E"},{"key":"621_CR32","unstructured":"Oglic D, Gaertner T (2018) Learning in reproducing kernel Krein spaces. In: Dy J, Krause A (eds) Proceedings of the 35th international conference on machine learning, PMLR, proceedings of machine learning research, vol 80, pp 3856\u20133864"},{"key":"621_CR33","doi-asserted-by":"crossref","unstructured":"Pele O, Werman M (2008) A linear time histogram metric for improved SIFT matching. In: Forsyth DA, Torr PHS, Zisserman A (eds) Computer vision\u2013ECCV 2008, 10th European conference on computer vision, Marseille, France, October 12\u201318, 2008, proceedings, Part III, Springer, Lecture Notes in Computer Science, vol 5304, pp 495\u2013508","DOI":"10.1007\/978-3-540-88690-7_37"},{"issue":"6","key":"621_CR34","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0167-7152(85)90065-3","volume":"3","author":"DS Richards","year":"1985","unstructured":"Richards DS (1985) Positive definite symmetric functions on finite-dimensional spaces ii. Stat Probab Lett 3(6):325\u2013329","journal-title":"Stat Probab Lett"},{"issue":"1","key":"621_CR35","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson M, Domingos P (2006) Markov logic networks. Mach Learn 62(1):107\u2013136","journal-title":"Mach Learn"},{"key":"621_CR36","doi-asserted-by":"crossref","unstructured":"Rubner Y, Tomasi C, Guibas LJ (1998) A metric for distributions with applications to image databases. In: Sixth international conference on computer vision, 1998, IEEE, pp 59\u201366","DOI":"10.1109\/ICCV.1998.710701"},{"key":"621_CR37","volume-title":"Learning with Kernels","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf B, Smola A (2002) Learning with Kernels. The MIT Press, Cambridge, MA"},{"key":"621_CR38","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze N, Schweitzer P, van Leeuwen EJ, Mehlhorn K, Borgwardt KM (2011) Weisfeiler\u2013Lehman graph kernels. J Mach Learn Res 12:2539\u20132561","journal-title":"J Mach Learn Res"},{"issue":"11","key":"621_CR39","doi-asserted-by":"crossref","first-page":"992","DOI":"10.14778\/3402707.3402736","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun Y, Han J, Yan X, Yu PS, Wu T (2011) Pathsim: meta path-based top-k similarity search in heterogeneous information networks. Proc VLDB Endow 4(11):992\u20131003","journal-title":"Proc VLDB Endow"},{"key":"621_CR40","doi-asserted-by":"crossref","unstructured":"Tong H, Faloutsos C, Gallagher B, Eliassi-Rad T (2007) Fast best-effort pattern matching in large attributed graphs. In: Proceedings of the 13th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, New York, NY, KDD \u201907, pp 737\u2013746","DOI":"10.1145\/1281192.1281271"},{"issue":"4","key":"621_CR41","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(91)90074-R","volume":"40","author":"JK Uhlmann","year":"1991","unstructured":"Uhlmann JK (1991) Satisfying general proximity\/similarity queries with metric trees. Inf Process Lett 40(4):175\u2013179","journal-title":"Inf Process Lett"},{"key":"621_CR42","unstructured":"Vens C, Gassen SV, Dhaene T, Saeys Y (2014) Complex aggregates over clusters of elements. In: Davis J, Ramon J (eds) Inductive logic programming\u201324th international conference, ILP 2014, Nancy, France, September 14\u201316, 2014, Revised Selected Papers, Springer, Lecture Notes in Computer Science, vol 9046, pp 181\u2013193"},{"key":"621_CR43","doi-asserted-by":"crossref","unstructured":"Wang F, Guibas LJ (2012) Supervised earth mover\u2019s distance learning and its computer vision applications. In: Fitzgibbon AW, Lazebnik S, Perona P, Sato Y, Schmid C (eds) Computer vision\u2013ECCV 2012\u201312th European conference on computer vision, Florence, Italy, October 7\u201313, 2012, Proceedings, Part I, Springer, Lecture Notes in Computer Science, vol 7572, pp 442\u2013455","DOI":"10.1007\/978-3-642-33718-5_32"},{"key":"621_CR44","unstructured":"Wang J, Shen HT, Song J, Ji J (2014) Hashing for similarity search: a survey. CoRR arXiv:1408.2927"},{"issue":"99","key":"621_CR45","first-page":"1","volume":"PP","author":"J Wang","year":"2017","unstructured":"Wang J, Zhang T, Song J, Sebe N, Shen HT (2017) A survey on learning to hash. IEEE Trans Pattern Anal Mach Intell PP(99):1\u20131","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"621_CR46","doi-asserted-by":"crossref","unstructured":"Wichterich M, Assent I, Kranen P, Seidl T (2008) Efficient emd-based similarity search in multimedia databases via flexible dimensionality reduction. In: Proceedings of the 2008 ACM SIGMOD international conference on management of data, ACM, pp 199\u2013212","DOI":"10.1145\/1376616.1376639"},{"key":"621_CR47","doi-asserted-by":"crossref","unstructured":"Yanardag P, Vishwanathan S (2015) Deep graph kernels. In: Proceedings of the 21th ACM SIGKDD international conference on knowledge discovery and data mining, ACM, pp 1365\u20131374","DOI":"10.1145\/2783258.2783417"},{"issue":"5","key":"621_CR48","doi-asserted-by":"publisher","first-page":"e5429","DOI":"10.1371\/journal.pone.0005429","volume":"4","author":"CT Zhang","year":"2009","unstructured":"Zhang CT (2009) The e-index, complementing the h-index for excess citations. PLoS One 4(5):e5429","journal-title":"PLoS One"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00621-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-019-00621-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-019-00621-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T08:49:02Z","timestamp":1694681342000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-019-00621-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,8]]},"references-count":48,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["621"],"URL":"https:\/\/doi.org\/10.1007\/s10618-019-00621-7","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2019,3,8]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}