From post

Theoretical Analysis of Domain Adaptation with Optimal Transport.

, , и . ECML/PKDD (2), том 10535 из Lecture Notes in Computer Science, стр. 737-753. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

Theoretical Analysis of Domain Adaptation with Optimal Transport., , и . CoRR, (2016)Theoretical Analysis of Domain Adaptation with Optimal Transport., , и . ECML/PKDD (2), том 10535 из Lecture Notes in Computer Science, стр. 737-753. Springer, (2017)Experiments on a Representation-Independent "Top-Down and Prune" Induction Scheme., , и . PKDD, том 1704 из Lecture Notes in Computer Science, стр. 223-231. Springer, (1999)Algorithmic Robustness for Semi-Supervised (ε, γ, τ) -Good Metric Learning., , , , и . ICONIP (1), том 9489 из Lecture Notes in Computer Science, стр. 253-263. Springer, (2015)Joint Semi-supervised Similarity Learning for Linear Classification., , , и . ECML/PKDD (1), том 9284 из Lecture Notes in Computer Science, стр. 594-609. Springer, (2015)Correction of Uniformly Noisy Distributions to Improve Probabilistic Grammatical Inference Algorithms., , и . FLAIRS, стр. 493-498. AAAI Press, (2005)Prototype Selection from Homogeneous Subsets by a Monte Carlo Sampling.. FLAIRS, стр. 250-253. AAAI Press, (1998)Melody Recognition with Learned Edit Distances., , , и . SSPR/SPR, том 5342 из Lecture Notes in Computer Science, стр. 86-96. Springer, (2008)Combining Feature and Example Pruning by Uncertainty Minimization., и . UAI, стр. 533-540. Morgan Kaufmann, (2000)Stopping Criterion for Boosting-Based Data Reduction Techniques: from Binary to Multiclass Problem., , и . J. Mach. Learn. Res., (2002)