BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IEEE Toronto Section - ECPv6.15.17//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:IEEE Toronto Section
X-ORIGINAL-URL:https://www.ieeetoronto.ca
X-WR-CALDESC:Events for IEEE Toronto Section
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Toronto
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20140309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20141102T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20150308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20151101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20161106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Toronto:20151119T130000
DTEND;TZID=America/Toronto:20151119T140000
DTSTAMP:20260608T172255
CREATED:20210429T230357Z
LAST-MODIFIED:20210429T234047Z
UID:10000042-1447938000-1447941600@www.ieeetoronto.ca
SUMMARY:Compact Discrete Representations for Scalable Similarity Search
DESCRIPTION:Thursday November 19\, 2015 at 1:00 p.m. Mohammad Norouzi\, PhD candidate in computer science at the University of Toronto\, will be presenting “Compact Discrete Representations for Scalable Similarity Search”. \nSpeaker: Mohammad Norouzi\nPhD Candidate \nDay & Time: Thursday\, November 19\, 2015\n1:00 p.m. – 2:00 p.m. \nLocation: Room ENG 106\nGeorge Vari Engineering and Computing Centre\nRyerson University\n245 Church Street\nToronto \nOrganizer: IEEE Toronto Computer\, Magnetics and Instrument-Measurement Chapters \nContact: Maryam Davoudpour\, Email:maryam.davoudpour@ieee.org \nAbstract: Scalable similarity search on images\, documents\, and user activities benefits generic search\, data visualization\, and recommendation systems. This talk concerns the design of algorithms and machine learning tools for faster and more accurate similarity search. The proposed techniques advocate the use of discrete codes for representing the similarity structure of data in a compact way. In particular\, I will discuss how one can learn to map high-dimensional data onto binary codes with a metric learning approach. Then\, I will describe a simple algorithm for fast exact nearest neighbour search in Hamming distance\, which exhibits sub-linear query time performance. Going beyond binary codes\, I will highlight a compositional generalization of k-means clustering which maps data points onto integer codes with storage and search costs that grow sub-linearly in the number of cluster centers. This representation improves upon binary codes\, and provides an even more precise approximation of Euclidean distance. Experimental results are reported on multiple datasets including a dataset of SIFT descriptors with 1B entries. \nBiography: Mohammad Norouzi is a PhD candidate in computer science at the University of Toronto. His research lies at the intersection of machine learning and computer vision. He is a recipient of a Google US/Canada PhD fellowship in machine learning. He is going to join Google as a research scientist in January 2016.
URL:https://www.ieeetoronto.ca/event/compact-discrete-representations-for-scalable-similarity-search/
LOCATION:Room ENG106\, Ryerson University
CATEGORIES:Computer,Instrumentation & Measurement,Magnetics
END:VEVENT
END:VCALENDAR