One-class classifiers are trained only with target class samples. Intuitively, their conservative modeling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods leveraging on the combination of one-class classifiers based on non-parametric models, Trees and Minimum Spanning Trees class descriptors (MST_CD) are proposed. These methods deal with inconsistencies arising from combining multiple classifiers and with spurious connections that MST-CD creates in multi-modal class distributions. Experiments on several datasets show that the proposed approach obtains comparable and, in some cases, state-of-the-art results.

Grassa, R., Gallo, I., Calefati, A., Ognibene, D. (2019). Binary Classification Using Pairs of Minimum Spanning Trees or N-Ary Trees. In Computer Analysis of Images and Patterns. CAIP 2019. Lecture Notes in Computer Science (pp.365-376). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-030-29891-3_32].

Binary Classification Using Pairs of Minimum Spanning Trees or N-Ary Trees

Ognibene D.
2019

Abstract

One-class classifiers are trained only with target class samples. Intuitively, their conservative modeling of the class description may benefit classical classification tasks where classes are difficult to separate due to overlapping and data imbalance. In this work, three methods leveraging on the combination of one-class classifiers based on non-parametric models, Trees and Minimum Spanning Trees class descriptors (MST_CD) are proposed. These methods deal with inconsistencies arising from combining multiple classifiers and with spurious connections that MST-CD creates in multi-modal class distributions. Experiments on several datasets show that the proposed approach obtains comparable and, in some cases, state-of-the-art results.
paper
Instance-based approaches; Minimum spanning tree; Non-parametric models; One-class classifiers;
English
18th International Conference on Computer Analysis of Images and Patterns, CAIP 2019 3-5 September
2019
Vento M.,Percannella G.
Computer Analysis of Images and Patterns. CAIP 2019. Lecture Notes in Computer Science
978-3-030-29890-6
2019
11679
365
376
https://link.springer.com/chapter/10.1007/978-3-030-29891-3_32
none
Grassa, R., Gallo, I., Calefati, A., Ognibene, D. (2019). Binary Classification Using Pairs of Minimum Spanning Trees or N-Ary Trees. In Computer Analysis of Images and Patterns. CAIP 2019. Lecture Notes in Computer Science (pp.365-376). GEWERBESTRASSE 11, CHAM, CH-6330, SWITZERLAND : Springer Verlag [10.1007/978-3-030-29891-3_32].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/10281/302038
Citazioni
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 5
Social impact