@inproceedings{DBLP:conf/pkdd/AlonsoMCT08,
  author    = {Andr{\'{e}}s Gago Alonso and
               Jos{\'{e}} Eladio Medina{-}Pagola and
               Jes{\'{u}}s Ariel Carrasco{-}Ochoa and
               Jos{\'{e}} Francisco Mart{\'{\i}}nez Trinidad},
  editor    = {Walter Daelemans and
               Bart Goethals and
               Katharina Morik},
  title     = {Mining Frequent Connected Subgraphs Reducing the Number of Candidates},
  booktitle = {Machine Learning and Knowledge Discovery in Databases, European Conference,
               {ECML/PKDD} 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings,
               Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {5211},
  pages     = {365--376},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-87479-9\_42},
  doi       = {10.1007/978-3-540-87479-9\_42},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/pkdd/AlonsoMCT08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"Lhg2DjgqvCZrmcewG","bibbaseid":"alonso-medinapagola-carrascoochoa-trinidad-miningfrequentconnectedsubgraphsreducingthenumberofcandidates-2008","authorIDs":[],"author_short":["Alonso, A. G.","Medina-Pagola, J. E.","Carrasco-Ochoa, J. A.","Trinidad, J. F. M."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Andrés","Gago"],"propositions":[],"lastnames":["Alonso"],"suffixes":[]},{"firstnames":["José","Eladio"],"propositions":[],"lastnames":["Medina-Pagola"],"suffixes":[]},{"firstnames":["Jesús","Ariel"],"propositions":[],"lastnames":["Carrasco-Ochoa"],"suffixes":[]},{"firstnames":["José","Francisco","Martínez"],"propositions":[],"lastnames":["Trinidad"],"suffixes":[]}],"editor":[{"firstnames":["Walter"],"propositions":[],"lastnames":["Daelemans"],"suffixes":[]},{"firstnames":["Bart"],"propositions":[],"lastnames":["Goethals"],"suffixes":[]},{"firstnames":["Katharina"],"propositions":[],"lastnames":["Morik"],"suffixes":[]}],"title":"Mining Frequent Connected Subgraphs Reducing the Number of Candidates","booktitle":"Machine Learning and Knowledge Discovery in Databases, European Conference, ECML/PKDD 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings, Part I","series":"Lecture Notes in Computer Science","volume":"5211","pages":"365–376","publisher":"Springer","year":"2008","url":"https://doi.org/10.1007/978-3-540-87479-9_42","doi":"10.1007/978-3-540-87479-9_42","timestamp":"Sat, 19 Oct 2019 01:00:00 +0200","biburl":"https://dblp.org/rec/conf/pkdd/AlonsoMCT08.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/pkdd/AlonsoMCT08,\n author = {Andr{\\'{e}}s Gago Alonso and\n Jos{\\'{e}} Eladio Medina{-}Pagola and\n Jes{\\'{u}}s Ariel Carrasco{-}Ochoa and\n Jos{\\'{e}} Francisco Mart{\\'{\\i}}nez Trinidad},\n editor = {Walter Daelemans and\n Bart Goethals and\n Katharina Morik},\n title = {Mining Frequent Connected Subgraphs Reducing the Number of Candidates},\n booktitle = {Machine Learning and Knowledge Discovery in Databases, European Conference,\n {ECML/PKDD} 2008, Antwerp, Belgium, September 15-19, 2008, Proceedings,\n Part {I}},\n series = {Lecture Notes in Computer Science},\n volume = {5211},\n pages = {365--376},\n publisher = {Springer},\n year = {2008},\n url = {https://doi.org/10.1007/978-3-540-87479-9\\_42},\n doi = {10.1007/978-3-540-87479-9\\_42},\n timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},\n biburl = {https://dblp.org/rec/conf/pkdd/AlonsoMCT08.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Alonso, A. G.","Medina-Pagola, J. E.","Carrasco-Ochoa, J. A.","Trinidad, J. F. M."],"editor_short":["Daelemans, W.","Goethals, B.","Morik, K."],"key":"DBLP:conf/pkdd/AlonsoMCT08","id":"DBLP:conf/pkdd/AlonsoMCT08","bibbaseid":"alonso-medinapagola-carrascoochoa-trinidad-miningfrequentconnectedsubgraphsreducingthenumberofcandidates-2008","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-540-87479-9_42"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.org/search/publ/api?format=bib&h=1000&q=author:José_R._Álvarez:|author:Margarita_Bachiller:|author:Margarita_Bachiller_Mayoral:|author:Enrique_J._Carmona:|author:José_Manuel_Cuadra_Troncoso:|author:José_Luis_Fernández-Vindel:|author:Carolina_Mañoso:|author:Rafael_Martínez-Tomás:|author:Félix_de_la_Paz:|author:Angel_Pérez_de_Madrid:|author:Mariano_Rincón:|author:Miguel_Romero_0003:|author:Miguel_Romero_Hortelano:","creationDate":"2020-09-24T15:30:17.517Z","downloads":0,"keywords":[],"search_terms":["mining","frequent","connected","subgraphs","reducing","number","candidates","alonso","medina-pagola","carrasco-ochoa","trinidad"],"title":"Mining Frequent Connected Subgraphs Reducing the Number of Candidates","year":2008,"dataSources":["jY3Qd7SvX7QP2zSXh"]}