{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:23:36Z","timestamp":1725560616535},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292432"},{"type":"electronic","value":"9783540316923"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564096_68","type":"book-chapter","created":{"date-parts":[[2005,11,9]],"date-time":"2005-11-09T06:54:27Z","timestamp":1131519267000},"page":"673-681","source":"Crossref","is-referenced-by-count":15,"title":["Mode Directed Path Finding"],"prefix":"10.1007","author":[{"given":"Irene M.","family":"Ong","sequence":"first","affiliation":[]},{"given":"In\u00eas","family":"de Castro Dutra","sequence":"additional","affiliation":[]},{"given":"David","family":"Page","sequence":"additional","affiliation":[]},{"given":"V\u00edtor Santos","family":"Costa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"68_CR1","unstructured":"Ausiello, G., Giaccio, R., Italiano, G., Nanni, U.: Optimal traversal of directed hypergraphs. Technical report, Dipartimento di Informatica e Sistemistica, Universit di Roma La Sapienza (1997)"},{"volume-title":"Mining the Web","year":"2002","author":"S. Chakrabarti","key":"68_CR2","unstructured":"Chakrabarti, S.: Mining the Web. Morgan Kaufmann, San Francisco (2002)"},{"key":"68_CR3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/5254.850825","volume":"15","author":"D. Cook","year":"2000","unstructured":"Cook, D., Holder, L.: Graph-based data mining. IEEE Intelligent Systems\u00a015, 32\u201341 (2000)","journal-title":"IEEE Intelligent Systems"},{"key":"68_CR4","unstructured":"Davis, J., Dutra, I., Page, D., Costa, V.S.: Establishing identity equivalence in multi-relational domains. In: Proc. of Intelligence Analysis (2005)"},{"key":"68_CR5","unstructured":"Davis, J., Santos Costa, V., Ong, I., Page, D., Dutra, I.: Using bayesian classifiers to combine rules. In: 3rd Workshop on MRDM at KDD (2004)"},{"key":"68_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/959242.959253","volume":"5","author":"L. Getoor","year":"2003","unstructured":"Getoor, L.: Link mining: A new data mining challenge. SIGKDD Explorations\u00a05, 84\u201389 (2003)","journal-title":"SIGKDD Explorations"},{"key":"68_CR7","unstructured":"Jensen, D.: Prospective assessment of AI technologies for fraud detection: A case study. In: Working Papers of the AAAI 1997 Workshop on Artificial Intelligence Approaches to Fraud Detection and Risk Management (1997)"},{"key":"68_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"68_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1145\/959242.959250","volume":"5","author":"D. Page","year":"2003","unstructured":"Page, D., Craven, M.: Biological applications of multi-relational data mining. SIGKDD Explorations\u00a05, 69\u201379 (2003)","journal-title":"SIGKDD Explorations"},{"key":"68_CR10","unstructured":"Palmer, C., Gibbons, P., Faloutsos, C.: Anf: A fast and scalable tool for data mining in massive graphs. In: Proc. of ACM SIGKDD on Knowledge Discovery and Data Mining (2002)"},{"key":"68_CR11","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms\u00a021, 267\u2013305 (1996)","journal-title":"Journal of Algorithms"},{"key":"68_CR12","unstructured":"Richards, B., Mooney, R.: Learning relations by pathfinding. In: National Conference on AI, pp. 50\u201355 (1992)"},{"key":"68_CR13","unstructured":"Richardson, M., Domingos, P.: Markov logic networks. Technical report, Dept. of Computer Science and Engineering, University of Washington, Seattle, WA (2004)"},{"key":"68_CR14","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1022678217288","volume":"14","author":"C. Rouveirol","year":"1994","unstructured":"Rouveirol, C.: Flattening and saturation: Two representation changes for generalization. Machine Learning\u00a014, 219\u2013232 (1994)","journal-title":"Machine Learning"},{"key":"68_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/BFb0027309","volume-title":"Inductive Logic Programming","author":"S. Slattery","year":"1998","unstructured":"Slattery, S., Craven, M.: Combining statistical and relational methods for learning in hypertext domains. In: Page, D.L. (ed.) ILP 1998. LNCS, vol.\u00a01446, pp. 38\u201352. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564096_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:42:28Z","timestamp":1558284148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564096_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292432","9783540316923"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11564096_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}
