137 search results - page 19 / 28 » New Regularized Algorithms for Transductive Learning |
133
Voted
ECCV
2010
Springer
15 years 5 months ago
2010
Springer
Many learning tasks for computer vision problems can be described by multiple views or multiple features. These views can be exploited in order to learn from unlabeled data, a.k.a....
83
Voted
NIPS
2008
15 years 1 months ago
2008
Regularized Least Squares (RLS) algorithms have the ability to avoid over-fitting problems and to express solutions as kernel expansions. However, we observe that the current RLS ...
121
click to vote
ECML
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Principal component analysis (PCA) is a well-known classical data analysis technique. There are a number of algorithms for solving the problem, some scaling better than o...
NIPS
2004
15 years 1 months ago
2004
Semantic taxonomies such as WordNet provide a rich source of knowledge for natural language processing applications, but are expensive to build, maintain, and extend. Motivated by...
110
Voted
KDD
2009
ACM
16 years 5 days ago
2009
ACM
Email is one of the most prevalent communication tools today, and solving the email overload problem is pressingly urgent. A good way to alleviate email overload is to automatical...