223 search results - page 13 / 45 » Spectral Learning |
ICML
2005
IEEE
14 years 9 months ago
2005
IEEE
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straightforw...
ICML
2010
IEEE
13 years 9 months ago
2010
IEEE
We describe an algorithm for clustering using a similarity graph. The algorithm (a) runs in O(n log3 n + m log n) time on graphs with n vertices and m edges, and (b) with high pro...
ALT
2010
Springer
13 years 5 months ago
2010
Springer
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
Feature selection is an important task in effective data mining. A new challenge to feature selection is the so-called “small labeled-sample problem” in which labeled data is...