Sciweavers

1658 search results - page 43 / 332
» Learning Unknown Graphs
Sort
View
COLT
2005
Springer
15 years 7 months ago
Towards a Theoretical Foundation for Laplacian-Based Manifold Methods
In recent years manifold methods have attracted a considerable amount of attention in machine learning. However most algorithms in that class may be termed “manifold-motivatedâ€...
Mikhail Belkin, Partha Niyogi
DAGSTUHL
2006
15 years 3 months ago
Vertex reconstruction in Cayley graphs
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
Elena V. Konstantinova
ICML
2009
IEEE
16 years 2 months ago
Spectral clustering based on the graph p-Laplacian
We present a generalized version of spectral clustering using the graph p-Laplacian, a nonlinear generalization of the standard graph Laplacian. We show that the second eigenvecto...
Matthias Hein, Thomas Bühler
ACL
2009
14 years 11 months ago
An Error-Driven Word-Character Hybrid Model for Joint Chinese Word Segmentation and POS Tagging
In this paper, we present a discriminative word-character hybrid model for joint Chinese word segmentation and POS tagging. Our word-character hybrid model offers high performance...
Canasai Kruengkrai, Kiyotaka Uchimoto, Jun'ichi Ka...
ICASSP
2011
IEEE
14 years 5 months ago
Trading off communications bandwidth with accuracy in adaptive diffusion networks
In this paper, a novel algorithm for bandwidth reduction in adaptive distributed learning is introduced. We deal with diffusion networks, in which the nodes cooperate with each ot...
Symeon Chouvardas, Konstantinos Slavakis, Sergios ...