About: Explaining Anomalies with Sapling Random Forests

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Explaining Anomalies with Sapling Random Forests Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.library.sk/i2/content.csg.cls?ictx=cav&repo=crepo1&key=70202320092
Description	The main objective of anomaly detection algo- rithms is finding samples deviating from the majority. Al- though a vast number of algorithms designed for this al- ready exist, almost none of them explain, why a particular sample was labelled as an anomaly. To address this is- sue, we propose an algorithm called Explainer, which re- turns the explanation of sample’s differentness in disjunc- tive normal form (DNF), which is easy to understand by humans. Since Explainer treats anomaly detection algo- rithms as black-boxes, it can be applied in many domains to simplify investigation of anomalies. The core of Explainer is a set of specifically trained trees, which we call sapling random forests. Since their training is fast and memory efficient, the whole algorithm is lightweight and applicable to large databases, data- streams, and real-time problems. The correctness of Ex- plainer is demonstrated on a wide range of synthetic and real world datasets. The main objective of anomaly detection algo- rithms is finding samples deviating from the majority. Al- though a vast number of algorithms designed for this al- ready exist, almost none of them explain, why a particular sample was labelled as an anomaly. To address this is- sue, we propose an algorithm called Explainer, which re- turns the explanation of sample’s differentness in disjunc- tive normal form (DNF), which is easy to understand by humans. Since Explainer treats anomaly detection algo- rithms as black-boxes, it can be applied in many domains to simplify investigation of anomalies. The core of Explainer is a set of specifically trained trees, which we call sapling random forests. Since their training is fast and memory efficient, the whole algorithm is lightweight and applicable to large databases, data- streams, and real-time problems. The correctness of Ex- plainer is demonstrated on a wide range of synthetic and real world datasets. (en)
Title	Explaining Anomalies with Sapling Random Forests Explaining Anomalies with Sapling Random Forests (en)
skos:prefLabel	Explaining Anomalies with Sapling Random Forests Explaining Anomalies with Sapling Random Forests (en)
skos:notation	RIV/68407700:21230/14:00219644!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(GA13-17187S), P(GPP103/12/P514), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Pevný, Tomáš Kopp, Martin
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	16067
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00219644
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Anomaly explanation; decision trees; feature selection; random forest (en)
http://linked.open.../riv/klicoveSlovo	decision trees feature selection random forest Anomaly explanation
http://linked.open...ontrolniKodProRIV	[D6E3C2D9B1C5]
http://linked.open...v/mistoKonaniAkce	Demänovská Dolina
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	Proceedings of the 14th conference ITAT 2014 – Workshops and Posters
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Real-time detection of anomalous events in a non-stationary environment Constructing Advanced Comprehensible Classifiers
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Pevný, Tomáš Kopp, Martin
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-09-25 (xsd:date)
number of pages	8 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Ústav informatiky AV ČR
https://schema.org/isbn	978-80-87136-19-5
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software