Metaheuristics for Query Synthesis in One-Class Active Learning: Unterschied zwischen den Versionen

Aus SDQ-Institutsseminar
(Die Seite wurde neu angelegt: „{{Vortrag |vortragender=Philipp Schüler |email=philipp.schueler@yahoo.de |vortragstyp=Bachelorarbeit |betreuer=Adrian Englhardt |termin=Institutsseminar/2019-…“)
 
Keine Bearbeitungszusammenfassung
 
Zeile 5: Zeile 5:
|betreuer=Adrian Englhardt
|betreuer=Adrian Englhardt
|termin=Institutsseminar/2019-04-05
|termin=Institutsseminar/2019-04-05
|kurzfassung=TBD
|kurzfassung=Active learning describes the topic of a human operator helping with the machine learning process. By asking for a classification of queries, the precision of the machine learning algorithm is increased. Existing research focuses on the idea of using a pool of unlabelled data points or use multiple class cases. We have developed a framework, that allows to synthesize a query in the one-class setting without requiring unlabelled data points. The optimal query is the data point with the highest amount of information. The amount of information for a specific data point is given by the informativeness function. We have created a framework to use metaheuristics to find the maximum of the informativeness function and thus determine the optimal query. We have also conducted experiments to provide a general guideline for the usage of metaheuristics in one-class query synthesis.
}}
}}

Aktuelle Version vom 1. April 2019, 09:01 Uhr

Vortragende(r) Philipp Schüler
Vortragstyp Bachelorarbeit
Betreuer(in) Adrian Englhardt
Termin Fr 5. April 2019
Vortragsmodus
Kurzfassung Active learning describes the topic of a human operator helping with the machine learning process. By asking for a classification of queries, the precision of the machine learning algorithm is increased. Existing research focuses on the idea of using a pool of unlabelled data points or use multiple class cases. We have developed a framework, that allows to synthesize a query in the one-class setting without requiring unlabelled data points. The optimal query is the data point with the highest amount of information. The amount of information for a specific data point is given by the informativeness function. We have created a framework to use metaheuristics to find the maximum of the informativeness function and thus determine the optimal query. We have also conducted experiments to provide a general guideline for the usage of metaheuristics in one-class query synthesis.