Sciweavers

34 search results - page 1 / 7
» An analysis of graph cut size for transductive learning
Sort
View
ICML
2006
IEEE
14 years 6 months ago
An analysis of graph cut size for transductive learning
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
Steve Hanneke
JMLR
2006
124views more  JMLR 2006»
13 years 5 months ago
Fast SDP Relaxations of Graph Cut Clustering, Transduction, and Other Combinatorial Problem
The rise of convex programming has changed the face of many research fields in recent years, machine learning being one of the ones that benefitted the most. A very recent develop...
Tijl De Bie, Nello Cristianini
ICML
2007
IEEE
14 years 6 months ago
Spectral clustering and transductive learning with multiple views
We consider spectral clustering and transductive inference for data with multiple views. A typical example is the web, which can be described by either the hyperlinks between web ...
Dengyong Zhou, Christopher J. C. Burges
JMLR
2008
139views more  JMLR 2008»
13 years 5 months ago
Regularization on Graphs with Function-adapted Diffusion Processes
Harmonic analysis and diffusion on discrete data has been shown to lead to state-of-theart algorithms for machine learning tasks, especially in the context of semi-supervised and ...
Arthur D. Szlam, Mauro Maggioni, Ronald R. Coifman
AIRWEB
2007
Springer
13 years 11 months ago
Transductive Link Spam Detection
Web spam can significantly deteriorate the quality of search engines. Early web spamming techniques mainly manipulate page content. Since linkage information is widely used in we...
Dengyong Zhou, Chris Burges, Tao Tao