BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20210527T134947Z
LOCATION:Analog 1
DTSTART;TZID=Europe/Stockholm:20200623T161500
DTEND;TZID=Europe/Stockholm:20200623T162000
UID:isc_hpc_ISC High Performance 2020_sess325_post139@linklings.com
SUMMARY:Multi-class Support Vector Machine on Quantum Annealers
DESCRIPTION:Research Poster\n\nMulti-class Support Vector Machine on Quant
 um Annealers\n\nBa, Arai, Horikawa\n\nThe end of Moore's Law makes it diff
 icult for traditional silicon-based computers to attain significant improv
 ements in computing performance. Therefore, new generation computing such 
 as quantum computing is beginning to prosper. Both universal gate quantum 
 computing and quantum annealing are considered to have the possibility of 
 yielding significant improvements in computing performance. Quantum anneal
 ing was specifically designed for combinatorial optimization problem and i
 s easier to realize than universal gate quantum computing. These benefits 
 have encouraged the commercialization of quantum annealers such as D-Wave 
 2000 and quantum-inspired annealers such as Fujitsu Digital Annealer (DA).
 ;\nTo expand the application area of quantum annealing, some studies have 
 focused on how to use quantum annealing for other problems such as binary 
 quantum SVM, which is one of the most famous algorithms in machine learnin
 g. However, in practical applications, there are more multi-class problems
  than binary ones.;\nIn this study we propose a multi-class SVM algorithm 
 that can be used by a quantum annealer. Our main idea is to compare the en
 ergy values obtained by quantum annealing of multiple binary classifiers t
 o find the largest margin for each class. We evaluate our method on quantu
 m annealer and simulated annealing using a 3-class synthetic dataset and a
  benchmark dataset (IRIS). The results show that our method can classify m
 ulti-class data with precision comparable to that offered by existing alte
 rnatives.\n\nTag: Pre-Recorded
URL:https://2020.isc-program.com/presentation/?id=post139&sess=sess325
END:VEVENT
END:VCALENDAR

