( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Robust reductions from ranking to classification.

, , , , , и . Mach. Learn., 72 (1-2): 139-153 (2008)

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.

Alireza Alinaghi

Alina Balandin

Alina Boberg

Alina Chanaewa

Alina Dubinskaya

 

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

Error limiting reductions between classification tasks., , , , и . ICML, том 119 из ACM International Conference Proceeding Series, стр. 49-56. ACM, (2005)Importance weighted active learning., , и . ICML, том 382 из ACM International Conference Proceeding Series, стр. 49-56. ACM, (2009)Agnostic active learning., , и . ICML, том 148 из ACM International Conference Proceeding Series, стр. 65-72. ACM, (2006)Contextual Memory Trees., , , , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 6026-6035. PMLR, (2019)The Enumerability of P Collapses P to NC., и . MFCS, том 3153 из Lecture Notes in Computer Science, стр. 346-355. Springer, (2004)Improving network robustness by edge modification, , , и . Physica A: Statistical Mechanics and its Applications, 357 (3-4): 593--612 (15.11.2005)Has the Machine Learning Review Process Become More Arbitrary as the Field Has Grown? The NeurIPS 2021 Consistency Experiment., , , и . CoRR, (2023)Evaluation of Optimization Methods for Network Bottleneck Diagnosis., , и . ICAC, стр. 20. IEEE Computer Society, (2007)Improving Network Robustness., , , и . ICAC, стр. 322-323. IEEE Computer Society, (2004)Cover trees for nearest neighbor., , и . ICML, том 148 из ACM International Conference Proceeding Series, стр. 97-104. ACM, (2006)