%0 Conference Proceedings
%T Towards interactive Machine Learning (iML): Applying Ant Colony Algorithms to Solve the Traveling Salesman Problem with the Human-in-the-Loop Approach
%+ Medical University Graz
%+ University of Bacău Vasile Alecsandri
%+ Technical University of Cluj-Napoca
%+ Coventry University
%A Holzinger, Andreas
%A Plass, Markus
%A Holzinger, Katharina
%A Crişan, Gloria, Cerasela
%A Pintea, Camelia-M.
%A Palade, Vasile
%Z Part 1: The International Cross Domain Conference (CD-ARES 2016)
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B International Conference on Availability, Reliability, and Security (CD-ARES)
%C Salzburg, Austria
%Y Francesco Buccafurri
%Y Andreas Holzinger
%Y Peter Kieseberg
%Y A Min Tjoa
%Y Edgar Weippl
%I Springer International Publishing
%3 Availability, Reliability, and Security in Information Systems
%V LNCS-9817
%P 81-95
%8 2016-08-31
%D 2016
%R 10.1007/978-3-319-45507-5_6
%K interactive Machine Learning
%K Human-in-the-loop
%K Traveling Salesman Problem
%K Ant Colony Optimization
%Z Computer Science [cs]
%Z Humanities and Social Sciences/Library and information sciencesConference papers
%X Most Machine Learning (ML) researchers focus on automatic Machine Learning (aML) where great advances have been made, for example, in speech recognition, recommender systems, or autonomous vehicles. Automatic approaches greatly benefit from the availability of “big data”. However, sometimes, for example in health informatics, we are confronted not a small number of data sets or rare events, and with complex problems where aML-approaches fail or deliver unsatisfactory results. Here, interactive Machine Learning (iML) may be of help and the “human-in-the-loop” approach may be beneficial in solving computationally hard problems, where human expertise can help to reduce an exponential search space through heuristics.In this paper, experiments are discussed which help to evaluate the effectiveness of the iML-“human-in-the-loop” approach, particularly in opening the “black box”, thereby enabling a human to directly and indirectly manipulating and interacting with an algorithm. For this purpose, we selected the Ant Colony Optimization (ACO) framework, and use it on the Traveling Salesman Problem (TSP) which is of high importance in solving many practical problems in health informatics, e.g. in the study of proteins.
%G English
%Z TC 8
%Z TC 5
%Z WG 8.4
%Z WG 8.9
%2 https://inria.hal.science/hal-01635020/document
%2 https://inria.hal.science/hal-01635020/file/430962_1_En_6_Chapter.pdf
%L hal-01635020
%U https://inria.hal.science/hal-01635020
%~ SHS
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC5
%~ IFIP-WG
%~ IFIP-TC8
%~ IFIP-CD-ARES
%~ IFIP-WG8-4
%~ IFIP-WG8-9
%~ IFIP-LNCS-9817