Skip to Main Content (Press Enter)

Logo UNINSUBRIA
  • ×
  • Home
  • Corsi
  • Insegnamenti
  • Professioni
  • Persone
  • Pubblicazioni
  • Strutture
  • Terza Missione
  • Attività
  • Competenze

UNI-FIND
Logo UNINSUBRIA

|

UNI-FIND

uninsubria.it
  • ×
  • Home
  • Corsi
  • Insegnamenti
  • Professioni
  • Persone
  • Pubblicazioni
  • Strutture
  • Terza Missione
  • Attività
  • Competenze
  1. Pubblicazioni

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

Contributo in Atti di convegno
Data di Pubblicazione:
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.
Tipologia CRIS:
Relazione (in Volume)
Keywords:
Instance-based approaches; Minimum spanning tree; Non-parametric models; One-class classifiers;
Elenco autori:
La Grassa, R.; Gallo, I.; Calefati, A.; Ognibene, D.
Autori di Ateneo:
GALLO IGNAZIO
Link alla scheda completa:
https://irinsubria.uninsubria.it/handle/11383/2083808
Titolo del libro:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pubblicato in:
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
Journal
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
Series
  • Dati Generali

Dati Generali

URL

https://www.springer.com/series/558
  • Accessibilità
  • Utilizzo dei cookie

Realizzato con VIVO | Designed by Cineca | 26.5.1.0