{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:35:48Z","timestamp":1750307748387,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,3,16]],"date-time":"2008-03-16T00:00:00Z","timestamp":1205625600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["SFRH\/BPD\/26737\/2006"],"award-info":[{"award-number":["SFRH\/BPD\/26737\/2006"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,3,16]]},"DOI":"10.1145\/1363686.1363901","type":"proceedings-article","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T13:04:11Z","timestamp":1209474251000},"page":"944-948","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["k-RNN"],"prefix":"10.1145","author":[{"given":"Nuno A.","family":"Fonseca","sequence":"first","affiliation":[{"name":"Instituto de Biologia Molecular, Porto, Portugal"}]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[{"name":"University of Porto, Porto, Portugal"}]},{"given":"Rui","family":"Camacho","sequence":"additional","affiliation":[{"name":"University of Porto, Porto, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2008,3,16]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"135","article-title":"Improving the efficiency of Inductive Logic Programming through the use of query packs","volume":"16","author":"Blockeel H.","year":"2002","unstructured":"H. Blockeel , L. Dehaspe , B. Demoen , G. Janssens , J. Ramon , and H. Vandecasteele . Improving the efficiency of Inductive Logic Programming through the use of query packs . JMLR , 16 : 135 -- 166 , 2002 . H. Blockeel, L. Dehaspe, B. Demoen, G. Janssens, J. Ramon, and H. Vandecasteele. Improving the efficiency of Inductive Logic Programming through the use of query packs. JMLR, 16:135--166, 2002.","journal-title":"JMLR"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11564096_13"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of the 2007 International Conference on ILP","volume":"4455","author":"Camacho R.","year":"2007","unstructured":"R. Camacho , Nuno A. Fonseca , V. Santos Costa , and R. Rocha . ILP :- Just Trie It . Proceedings of the 2007 International Conference on ILP , volume 4455 of LNAI, 184--198. Springer-Verlag , 2007 . R. Camacho, Nuno A. Fonseca, V. Santos Costa, and R. Rocha. ILP :- Just Trie It. Proceedings of the 2007 International Conference on ILP, volume 4455 of LNAI, 184--198. Springer-Verlag, 2007."},{"key":"e_1_3_2_1_4_1","volume-title":"Relational Data Mining","author":"Dehaspe L.","year":"2000","unstructured":"L. Dehaspe and H. Toivonen . Relational Data Mining , chapter Discovery of relational association rules, 189--208. Springer-Verlag , 2000 . L. Dehaspe and H. Toivonen. Relational Data Mining, chapter Discovery of relational association rules, 189--208. Springer-Verlag, 2000."},{"key":"e_1_3_2_1_5_1","volume-title":"International Conference on Knowledge Discovery and Data Mining, 30--36","author":"Dehaspe L.","year":"1998","unstructured":"L. Dehaspe , H. Toivonen , and R. King . Finding frequent substructures in chemical compounds . International Conference on Knowledge Discovery and Data Mining, 30--36 . AAAI Press , 1998 . L. Dehaspe, H. Toivonen, and R. King. Finding frequent substructures in chemical compounds. International Conference on Knowledge Discovery and Data Mining, 30--36. AAAI Press, 1998."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-200-7.50082-9"},{"key":"e_1_3_2_1_7_1","volume-title":"Morgan Kaufmann","author":"Emde W.","year":"1996","unstructured":"W. Emde and D. Wettschereck . Relational instance based learning. ICML, 122--130 . Morgan Kaufmann , 1996 . W. Emde and D. Wettschereck. Relational instance based learning. ICML, 122--130. Morgan Kaufmann, 1996."},{"key":"e_1_3_2_1_8_1","volume-title":"Reuse Often. Workshop on Multi-Relational Data Mining, 34--45","author":"Fonseca N. A.","year":"2007","unstructured":"N. A. Fonseca , R. Rocha , R. Camacho , and V. Santos Costa . ILP: Compute Once , Reuse Often. Workshop on Multi-Relational Data Mining, 34--45 , 2007 . N. A. Fonseca, R. Rocha, R. Camacho, and V. Santos Costa. ILP: Compute Once, Reuse Often. Workshop on Multi-Relational Data Mining, 34--45, 2007."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000039777.23772.30"},{"key":"e_1_3_2_1_10_1","volume-title":"Morgan Kaufmann","author":"Han J.","year":"2007","unstructured":"J. Han and M. Kimber . Data Mining: Concepts and Techniques . Morgan Kaufmann , 2007 . J. Han and M. Kimber. Data Mining: Concepts and Techniques. Morgan Kaufmann, 2007."},{"key":"e_1_3_2_1_11_1","volume-title":"Distance based approaches to relational learning and clustering. 213--230","author":"Kirsten M.","year":"2000","unstructured":"M. Kirsten , S. Wrobel , and T. Horvath . Distance based approaches to relational learning and clustering. 213--230 , 2000 . M. Kirsten, S. Wrobel, and T. Horvath. Distance based approaches to relational learning and clustering. 213--230, 2000."},{"key":"e_1_3_2_1_12_1","volume-title":"National Conference on Artificial Intelligence, 795--800","author":"Landwehr N.","year":"2005","unstructured":"N. Landwehr , K. Kersting , and L. D. Raedt . nfoil: Integrating na\u00efve bayes and foil . National Conference on Artificial Intelligence, 795--800 , 2005 . N. Landwehr, K. Kersting, and L. D. Raedt. nfoil: Integrating na\u00efve bayes and foil. National Conference on Artificial Intelligence, 795--800, 2005."},{"key":"e_1_3_2_1_13_1","volume-title":"National Conference on Artificial Intelligence","author":"Landwehr N.","year":"2006","unstructured":"N. Landwehr , A. Passerini , L. D. Raedt , and P. Frasconi . kfoil: Learning simple relational kernels . National Conference on Artificial Intelligence , 2006 . N. Landwehr, A. Passerini, L. D. Raedt, and P. Frasconi. kfoil: Learning simple relational kernels. National Conference on Artificial Intelligence, 2006."},{"key":"e_1_3_2_1_14_1","volume-title":"Average-case analysis of a nearest neighbor algorithm. IJCAI, 889--894","author":"Langley P.","year":"1993","unstructured":"P. Langley and W. Iba . Average-case analysis of a nearest neighbor algorithm. IJCAI, 889--894 , 1993 . P. Langley and W. Iba. Average-case analysis of a nearest neighbor algorithm. IJCAI, 889--894, 1993."},{"key":"e_1_3_2_1_15_1","volume-title":"Is Mutagenesis Still Challenging. ILP - Late-Breaking Papers, 35","author":"Lodhi H.","year":"2005","unstructured":"H. Lodhi and S. H. Muggleton . Is Mutagenesis Still Challenging. ILP - Late-Breaking Papers, 35 . MIT Press , 2005 . H. Lodhi and S. H. Muggleton. Is Mutagenesis Still Challenging. ILP - Late-Breaking Papers, 35. MIT Press, 2005."},{"key":"e_1_3_2_1_16_1","volume-title":"Special issue on Inductive Logic Programming, 13(3--4):245--286","author":"Muggleton S.","year":"1995","unstructured":"S. Muggleton . Inverse entailment and Progol. New Generation Computing , Special issue on Inductive Logic Programming, 13(3--4):245--286 , 1995 . S. Muggleton. Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3--4):245--286, 1995."},{"key":"e_1_3_2_1_17_1","volume-title":"Faster association rules for multiple relations. IJCAI, 891--896","author":"Nijssen S.","year":"2001","unstructured":"S. Nijssen and J. N. Kok . Faster association rules for multiple relations. IJCAI, 891--896 , 2001 . S. Nijssen and J. N. Kok. Faster association rules for multiple relations. IJCAI, 891--896, 2001."},{"key":"e_1_3_2_1_18_1","volume-title":"Condensed representations for inductive logic programming. Principles of Knowledge Representation and Reasoning, 438--446","author":"Raedt L. D.","year":"2004","unstructured":"L. D. Raedt and J. Ramon . Condensed representations for inductive logic programming. Principles of Knowledge Representation and Reasoning, 438--446 . AAAI Press , 2004 . L. D. Raedt and J. Ramon. Condensed representations for inductive logic programming. Principles of Knowledge Representation and Reasoning, 438--446. AAAI Press, 2004."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/647997.742620"},{"key":"e_1_3_2_1_20_1","volume-title":"The Aleph Manual","author":"Srinivasan A.","year":"2003","unstructured":"A. Srinivasan . The Aleph Manual , 2003 . A. Srinivasan. The Aleph Manual, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/647997.742609"},{"key":"e_1_3_2_1_22_1","volume-title":"International Workshop on ILP","volume":"237","author":"Srinivasan A.","year":"1994","unstructured":"A. Srinivasan , S. Muggleton , R. King , and M. Sternberg . Mutagenesis: ILP experiments in a non-determinate biological domain . International Workshop on ILP , volume 237 of GMD-Studien, 217--232, 1994 . A. Srinivasan, S. Muggleton, R. King, and M. Sternberg. Mutagenesis: ILP experiments in a non-determinate biological domain. International Workshop on ILP, volume 237 of GMD-Studien, 217--232, 1994."},{"key":"e_1_3_2_1_23_1","volume-title":"Using Background Knowledge for Graph Based Learning: a Case Study in Chemoinformatics. ILP, 116--118","author":"Karunaratne T.","year":"2006","unstructured":"T. Karunaratne and H. Bostroem . Using Background Knowledge for Graph Based Learning: a Case Study in Chemoinformatics. ILP, 116--118 , 2006 . T. Karunaratne and H. Bostroem. Using Background Knowledge for Graph Based Learning: a Case Study in Chemoinformatics. ILP, 116--118, 2006."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.1318569"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5834-0"}],"event":{"name":"SAC '08: The 2008 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Fortaleza, Ceara Brazil","acronym":"SAC '08"},"container-title":["Proceedings of the 2008 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363901","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1363686.1363901","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:10Z","timestamp":1750253950000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1363686.1363901"}},"subtitle":["k-relational nearest neighbour algorithm"],"short-title":[],"issued":{"date-parts":[[2008,3,16]]},"references-count":25,"alternative-id":["10.1145\/1363686.1363901","10.1145\/1363686"],"URL":"https:\/\/doi.org\/10.1145\/1363686.1363901","relation":{},"subject":[],"published":{"date-parts":[[2008,3,16]]},"assertion":[{"value":"2008-03-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}