Sciweavers

1775 search results - page 47 / 355
» Learning Spectral Clustering
Sort
View
PRL
2008
135views more  PRL 2008»
14 years 9 months ago
A hierarchical clustering algorithm based on the Hungarian method
We propose a novel hierarchical clustering algorithm for data-sets in which only pairwise distances between the points are provided. The classical Hungarian method is an efficient...
Jacob Goldberger, Tamir Tassa
SPIESR
2003
136views Database» more  SPIESR 2003»
14 years 11 months ago
Media segmentation using self-similarity decomposition
We present a framework for analyzing the structure of digital media streams. Though our methods work for video, text, and audio, we concentrate on detecting the structure of digit...
Jonathan Foote, Matthew L. Cooper
ICML
2009
IEEE
15 years 10 months ago
On sampling-based approximate spectral decomposition
This paper addresses the problem of approximate singular value decomposition of large dense matrices that arises naturally in many machine learning applications. We discuss two re...
Sanjiv Kumar, Mehryar Mohri, Ameet Talwalkar
ICML
2006
IEEE
15 years 10 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
ICASSP
2009
IEEE
15 years 4 months ago
On the phonetic information in ultrasonic microphone signals
We study the phonetic information in the signal from an ultrasonic “microphone”, a device that emits an ultrasonic wave toward a speaker and receives the reflected, Doppler-s...
Karen Livescu, Bo Zhu, James R. Glass