T. Horvath, S. Wrobel, and U. Bohnebeck. Relational instance-based learning with lists and terms. Machine Learning, 43(1/2):53--80, April 2001.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Mining Distance-Based Outliers in Near Linear Time with.. - Bay, Schwabacher (2003) (2 citations) (Correct)
....how we can extend our algorithm to handle relational data natively. There are two research questions that arise. First, how does one define a distance metric to compare objects which may have a variable number of linked objects There has been some work on defining metrics for relational data [6, 9, 15]. The central idea is to apply a recursive distance measure. That is, to compare two objects one starts by comparing their features directly, and then moves on to compare linked objects and so on. Second, how does one e#ciently retrieve an object and it s related objects to compare them in the ....
T. Horvath, S. Wrobel, and U. Bohnebeck. Relational instance-based learning with lists and terms. Machine Learning, 43:53--80, 2001.
Kernels on Prolog Proof Trees: Statistical Learning in .. - Passerini, Frasconi.. (2006) (Correct)
No context found.
T. Horvath, S. Wrobel, and U. Bohnebeck. Relational instance-based learning with lists and terms. Machine Learning, 43(1/2):53--80, April 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC