J. Ramon and M. Bruynooghe. A polynomial time computable metric between point sets. Acta Informatica, 37:765--780, 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Hierarchical Multi-Classification - Blockeel, Bruynooghe, Dzeroski.. (2002) (1 citation) Self-citation (Ramon Bruynooghe) (Correct)
....We assume we have a nite domain of elements U = fe 1 ; e n g (here, the classes) The metric we need is between subsets of U . Given a metric between elements of a domain, several metrics between subsets of that domain have been de ned, e.g. the Hausdor metric and the metric proposed in [19] which is based on matchings. However, we will use a decision tree algorithm and hence we would like to be able to compute prototypes eciently. Since for the existing metrics on sets it is not straightforward to do that, we will choose an approximative method that originates in kernel based ....
J. Ramon and M. Bruynooghe. A polynomial time computable metric between point sets. Acta Informatica, 37:765-780, 2001.
A Polynomial Time Computable Metric Between Point Sets - Ramon, Bruynooghe (2000) (2 citations) Self-citation (Ramon Bruynooghe) (Correct)
....of theorems 7 and 8 in section 6. is a metric for M 0. Theorem 3. If the time to compute the distance between two points is bounded by T , then the time to compute d (A; B) is bounded by a polynomial in #A, #B and T . The interested reader can nd a direct proof of these theorems in [12]. 5 Normalised matching metric. In some applications (e.g. algorithms where the distance between clusters shouldn t depend on the size of the objects) it is desirable to work with normalised distances i.e. distances in the interval [0; 1] Instance based learning systems such as RIBL [7] and ....
Jan Ramon and Maurice Bruynooghe. A polynomial time computable metric between point sets. Technical Report CW-301, Department of Computer Science, Katholieke Universiteit Leuven, October 2000. http://www.cs.kuleuven.ac.be/publicaties/rapporten/CW2000.html.
Hierarchical Multi-classification with Predictive.. - Struyf, Dzeroski.. (2005) (Correct)
No context found.
J. Ramon and M. Bruynooghe. A polynomial time computable metric between point sets. Acta Informatica, 37:765--780, 2001.
Using Sets of Feature Vectors for Similarity.. - Kriegel.. (2003) (1 citation) (Correct)
No context found.
J. Ramon and M. Bruynooghe. "A polynomial time computable metric between point sets", 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