65 search results - page 2 / 13 » Learning a Bi-Stochastic Data Similarity Matrix |
CVPR
2006
IEEE
14 years 6 months ago
2006
IEEE
Spectral clustering is a simple yet powerful method for finding structure in data using spectral properties of an associated pairwise similarity matrix. This paper provides new in...
ICPR
2008
IEEE
14 years 5 months ago
2008
IEEE
This paper introduces a new discriminative learning technique for link prediction based on the matrix alignment approach. Our algorithm automatically determines the most predictiv...
ICML
2002
IEEE
14 years 5 months ago
2002
IEEE
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
UAI
2003
13 years 5 months ago
2003
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
ICASSP
2008
IEEE
13 years 11 months ago
2008
IEEE
Non-negative matrix factorisation (NMF) is an unsupervised learning technique that decomposes a non-negative data matrix into a product of two lower rank non-negative matrices. Th...