• Aucun résultat trouvé

Evaluation of Unsupervised Learning Results: Making the Seemingly Impossible Possible

N/A
N/A
Protected

Academic year: 2022

Partager "Evaluation of Unsupervised Learning Results: Making the Seemingly Impossible Possible"

Copied!
1
0
0

Texte intégral

(1)

Evaluation of Unsupervised Learning Results:

Making the Seemingly Impossible Possible

Ricardo J. G. B. Campello

May 4, 2019

Abstract of Invited Presentation

When labels are not around, evaluating the final or intermediate results produced by a learning algorithm is usually not simple. In cluster analysis and unsupervised outlier detection, evaluation is important in many different aspects. It is a crucial task, e.g., for model selection, model validation, assessment of ensemble members accuracy and diversity, among others. In cluster analysis this task has been investigated for decades, but it is relatively well understood only under certain oversimplified model assumptions. In outlier detection, unsupervised evaluation is still in its infancy. Even when labels are available in the form of a ground-truth, such as in controlled benchmarking experiments, evaluation can still be challenging because the semantic described by the ground-truth labels may not be properly captured by the data as represented in the given feature space.

In this talk, I intend to discuss some particular aspects regarding outlier and clustering evaluation, focusing on a few recent results as well as some challenges for future research.

University of Newcastle

Références

Documents relatifs

The desired conclusion follows, since the field of germs at 0 of analytic functions from some open neighborhood U of 0 to C is a field to which Ax’s theorem on Schanuel’s property

Hence we analyze their roles with relations (i.e. whether they are domain or range concepts) and their importance (the measurement of concept importance) described in our work

galvanic skin response; network model; initial state of the learner; current state of the learner..

have shown, in [CP12], that there exists no algorithm computing a simple and equitable fair division for n ≥ 3 players in the Roberston-Webb model.. The strategy used in these

(ii) Secondly, when using analytical expressions of virial coef- ficients, the radius of convergence of the series has to be calculated in order to deduce the volume range on which

But the “isomorphism” hypothesis introduced by Gestalt psychology actually provides Koffka with a very easy and interesting answer to this objection: according to

operational significance for the developing 'countries: The two most important .elements relateto:(i) thecommitmentto respect national policyobjectives and the level of 'development

This document discusses its latest advances in ontology matching evaluation: ( i ) by providing new measures for ontology matching evaluation, such as semantic precision and recall