Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Michael Karlen

dblp:03/5331 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Learning paradigms · 67% Kernel, tree and ensemble methods · 33%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Learning paradigms
semi-supervised learning
0.112008
Large scale manifold transduction · ICML 2008
Machine learning › Learning paradigms › semi-supervised learning
transductive learning
0.112008
Large scale manifold transduction · ICML 2008
Machine learning › Kernel, tree and ensemble methods › support vector machine
transductive SVM
0.112008
Large scale manifold transduction · ICML 2008

Methods — techniques the papers use, named apart from their topics

neural network · 0.1multi-task learning · 0.1stochastic gradient descent · 0.1manifold regularization · 0.1low-density separation · 0.1
YearPublicationVenuePosition
2011 Natural Language Processing (Almost) from Scratch
Ronan Collobert, Jason Weston, Léon Bottou, Michael Karlen, Koray Kavukcuoglu, Pavel P. Kuksa
J. Mach. Learn. Res.4
2008 Large scale manifold transduction
abstract
We show how the regularizer of Transductive Support Vector Machines (TSVM) can be trained by stochastic gradient descent for linear models and multi-layer architectures. The resulting methods can be trained online, have vastly superior training and testing speed to existing TSVM algorithms, can encode prior knowledge in the network architecture, and obtain competitive error rates. We then go on to propose a natural generalization of the TSVM loss function that takes into account neighborhood and manifold information directly, unifying the two-stage Low Density Separation method into a single criterion, and leading to state-of-the-art results.
Michael Karlen, Jason Weston, Ayse Erkan, Ronan Collobert
ICML1