skip to main content
Goldsmiths - University of London
  • Students, Staff and Alumni
  • Search Students, Staff and Alumni
  • Study
  • Course finder
  • International
  • More
  • Search
  • Study
  • Courses
  • International
  • More
 
Main menu

Primary

  • About Goldsmiths
  • Study with us
  • Research
  • Business and partnerships
  • For the local community
  • Academic departments
  • News and features
  • Events
  • Give to Goldsmiths
Staff & students

Staff + students

  • New students: Welcome
  • Students
  • Alumni
  • Library
  • Timetable
  • Learn.gold - VLE
  • Email - Outlook
  • IT support
  • Staff directory
  • Staff intranet - Goldmine
  • Graduate School - PGR students
  • Teaching and Learning Innovation Centre
  • Events admin
In this section

Breadcrumb navigation

  • Events
    • Degree Shows
    • Black History Month
  • Calendar

Godfried Toussaint on Machine Learning


12 Oct 2012, 2:00pm - 3:00pm

251, RHB, Richard Hoggart Building

Event overview

Department Computing
Website www.gold.ac.uk/computing/
Contact ffl(@gold.ac.uk)

Hosted by the Department of Computing, this seminar by Godfried Toussaint is entitled 'Proximity-Graph Instance-Based Learning, Support Vector Machines, and High Dimensionality: An Empirical Comparison'

Seminar by Godfried Toussaint
Faculty of Science, New York University Abu Dhabi, Abu Dhabi, United Arab Emirates
http://nyuad.nyu.edu/academics/faculty/godfried-toussaint.html
Prof. Emeritus, McGill University
http://cgm.cs.mcgill.ca/~godfried/

Abstract:
Previous experiments with low dimensional data sets have shown that Gabriel graph methods for instance-based learning are among the best machine learning algorithms for pattern classification applications. However, as the dimensionality of the data grows large, all data points in the training set tend to become Gabriel neighbors of each other, bringing the efficacy of this method into question. Indeed, it has been conjectured that for high dimensional data, proximity graph methods that use sparser graphs, such as relative neighbor graphs (RNG) and minimum spanning trees (MST) would have to be employed in order to maintain their privileged status. Here the performance of proximity graph methods, in instance-based learning, that employ Gabriel graphs, relative neighborhood graphs, and minimum spanning trees, are compared experimentally on high-dimensional data sets. These methods are also compared empirically against the traditional k-NN rule and support vector machines (SVMs), the leading competitors of proximity graph methods.

References:
-----------
Proximity Graphs:
http://cgm.cs.mcgill.ca/~godfried/research/proximity.html

PRIMAL:Proximity-graph Instance-based Machine Learning
http://www.eecs.tufts.edu/%7Egwg/primal/index.html

Nearest Neighbor Classification:
http://cgm.cs.mcgill.ca/~godfried/research/nearest.neighbor.html

G. T. Toussaint, "Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining," International Journal of Computational Geometry and Applications, Vol. 15, No. 2, April 2005, pp. 101-150.
http://www.worldscientific.com/doi/abs/10.1142/S0218195905001622

www.gold.ac.uk/computing/

Dates & times

Date Time Add to calendar
12 Oct 2012 2:00pm - 3:00pm
  • apple
  • google
  • outlook

Accessibility

If you are attending an event and need the College to help with any mobility requirements you may have, please contact the event organiser in advance to ensure we can accommodate your needs.

Event controls

  • About us
  • Accessibility statement
  • Contact us
  • Cookie use
  • Find us
  • Copyright and disclaimer
  • Jobs
  • Modern slavery statement
Admin login
  • Twitter
  • Linkedin
  • TikTok
  • Instagram
  • YouTube
© Goldsmiths, University of London Back to top