Large-Scale Clustering through Functional Embedding

author: Frederic Ratle, University of Lausanne
author: Jason Weston, Facebook
author: Mathew L. Miller, NEC Laboratories America, Inc.
published: Oct. 10, 2008,   recorded: September 2008,   views: 223
Categories

Slides

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.
  Delicious Bibliography

Description

We present a new framework for large-scale data clustering. The main idea is to modify functional dimensionality reduction techniques to directly optimize over discrete labels using stochastic gradient descent. Compared to methods like spectral clustering our approach solves a single optimization problem, rather than an ad-hoc two-stage optimization approach, does not require a matrix inversion, can easily encode prior knowledge in the set of implementable functions, and does not have an out-of-sample problem. Experimental results on both artificial and real-world datasets show the usefulness of our approach.

See Also:

Download slides icon Download slides: ecmlpkdd08_ratle_lsct_01.pdf (574.4┬áKB)


Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: