|
In semi-supervised learning, at the limit of infinite unlabeled points while fixing labeled ones, the solutions of several graph Laplacian regularization based algorithms were shown by Nadler et al. (2009) to degenerate to constant functions with "spikes" at labeled points in Rd for d ¸ 2. These optimization problems all use the graph Laplacian regularizer as a common penalty term. In this paper, we address this problem by using regularization based on an iterated Laplacian, which is equivalent to a higher order Sobolev semi-norm. Alternatively, it can be viewed as a generalization of the thin plate spline to an unknown submanifold in high dimensions. We also discuss relationships between Reproducing Kernel Hilbert Spaces and Green’s functions. Experimental results support our analysis by showing consistently improved results using iterated Laplacians.
|
Video Length: 0
Date Found: May 07, 2011
Date Produced: May 06, 2011
|
|
VideoLectures |
July 10, 2011
The explosion in growth of the Web of Linked Data has provided, for the first time, a plethora of information in disparate locations, yet bound together by machine-readable, semantically typed relations. Utilisation of the Web of Data has been, until now, restricted to members of the community, ...
|
VideoLectures |
July 10, 2011
Problems cannot be solved with the mentality that has caused them’. Hence, the 2008- crisis cannot be solved with ethics of one-sided and short-term mentality of the industrial and neoliberal economics, which has caused the ‘Bubble Economy’ of several recent decades. Neither the market nor the ...
|
VideoLectures |
July 10, 2011
|
VideoLectures |
July 10, 2011
|
VideoLectures |
July 10, 2011
Social media presents unique challenges for topic classification, including the brevity of posts, the informal nature of conversations, and the frequent reliance on external hyperlinks to give context to a conversation. In this paper we investigate the usefulness of these external hyperlinks ...
|
|
|
|
|
|
Featured Content
Featuring websites that enhance the internet user’s experience.
|