Search Results for author: Ludmila I. Kuncheva

Found 5 papers, 0 papers with code

Feature Selection from High-Dimensional Data with Very Low Sample Size: A Cautionary Tale

no code implementations27 Aug 2020 Ludmila I. Kuncheva, Clare E. Matthews, Álvar Arnaiz-González, Juan J. Rodríguez

In classification problems, the purpose of feature selection is to identify a small, highly discriminative subset of the original feature set.

feature selection

Bounds for the VC Dimension of 1NN Prototype Sets

no code implementations7 Feb 2019 Iain A. D. Gunn, Ludmila I. Kuncheva

We collect some relevant results and use them to provide explicit lower and upper bounds for the VC dimension of 1NN classifiers with a prototype set of fixed size.

Instance Selection Improves Geometric Mean Accuracy: A Study on Imbalanced Data Classification

no code implementations19 Apr 2018 Ludmila I. Kuncheva, Álvar Arnaiz-González, José-Francisco Díez-Pastor, Iain A. D. Gunn

A natural way of handling imbalanced data is to attempt to equalise the class frequencies and train the classifier of choice on balanced data.

General Classification

On the Evaluation of Video Keyframe Summaries using User Ground Truth

no code implementations19 Dec 2017 Ludmila I. Kuncheva, Paria Yousefi, Iain A. D. Gunn

Here we propose a discrimination capacity measure as a formal way to quantify the improvement over the uniform baseline, assuming that one or more ground truth summaries are available.

Bipartite Graph Matching for Keyframe Summary Evaluation

no code implementations19 Dec 2017 Iain A. D. Gunn, Ludmila I. Kuncheva, Paria Yousefi

A keyframe summary, or "static storyboard", is a collection of frames from a video designed to summarise its semantic content.

Graph Matching

Cannot find the paper you are looking for? You can Submit a new open access paper.