Sciweavers

999 search results - page 48 / 200
» Spectral simplex method
Sort
View
117
Voted
IJCAI
2003
15 years 3 months ago
Spectral Learning
We present a simple, easily implemented spectral learning algorithm which applies equally whether we have no supervisory information, pairwise link constraints, or labeled example...
Sepandar D. Kamvar, Dan Klein, Christopher D. Mann...
DEXA
2010
Springer
156views Database» more  DEXA 2010»
15 years 3 months ago
Improving Alternative Text Clustering Quality in the Avoiding Bias Task with Spectral and Flat Partition Algorithms
Abstract. The problems of finding alternative clusterings and avoiding bias have gained popularity over the last years. In this paper we put the focus on the quality of these alter...
M. Eduardo Ares, Javier Parapar, Alvaro Barreiro
ARITH
2007
IEEE
15 years 8 months ago
Spectral Modular Exponentiation
We describe a new method to perform the modular exponentiation operation, i.e., the computation of c = me mod n, where c, m, e and n are large integers. The new method uses the di...
Gökay Saldamli, Çetin Kaya Koç
122
Voted
ICML
2009
IEEE
16 years 3 months ago
Learning spectral graph transformations for link prediction
We present a unified framework for learning link prediction and edge weight prediction functions in large networks, based on the transformation of a graph's algebraic spectru...
Andreas Lommatzsch, Jérôme Kunegis
110
Voted
ECML
2007
Springer
15 years 8 months ago
Spectral Clustering and Embedding with Hidden Markov Models
Abstract. Clustering has recently enjoyed progress via spectral methods which group data using only pairwise affinities and avoid parametric assumptions. While spectral clustering ...
Tony Jebara, Yingbo Song, Kapil Thadani