Journal
NEURAL COMPUTING & APPLICATIONS
Volume 28, Issue 9, Pages 2415-2424Publisher
SPRINGER LONDON LTD
DOI: 10.1007/s00521-016-2278-8
Keywords
kNN classification; Prototype generation; Structural pattern recognition; Dissimilarity space
Categories
Funding
- Spanish Ministerio de Educacion, Cultura y Deporte through a FPU [AP2012-0939]
- Vicerrectorado de Investigacion, Desarrollo e Innovacion de la Universidad de Alicante through FPU [UAFPU2014-5883]
- Spanish Ministerio de Economia y Competitividad [TIN2013-48152-C2-1-R]
- EU FEDER
Ask authors/readers for more resources
Data reduction techniques play a key role in instance-based classification to lower the amount of data to be processed. Among the different existing approaches, prototype selection (PS) and prototype generation (PG) are the most representative ones. These two families differ in the way the reduced set is obtained from the initial one: While the former aims at selecting the most representative elements from the set, the latter creates new data out of it. Although PG is considered to delimit more efficiently decision boundaries, the operations required are not so well defined in scenarios involving structural data such as strings, trees, or graphs. This work studies the possibility of using dissimilarity space (DS) methods as an intermediate process for mapping the initial structural representation to a statistical one, thereby allowing the use of PG methods. A comparative experiment over string data is carried out in which our proposal is faced to PS methods on the original space. Results show that the proposed strategy is able to achieve significantly similar results to PS in the initial space, thus standing as a clear alternative to the classic approach, with some additional advantages derived from the DS representation.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available