Tin Kam Ho
Artificial Intelligence · 1998–2019
A researcher in the Science corpus: 8 papers; trusts 10 researchers and is trusted by 300 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 37 citations into it; #7,858 of 35,345 by trust here, #10,942 by citations
- Statistics and Probability — 12 citations into it
- Statistical Learning Theory — 10 citations into it
- Computational Theory and Mathematics — 6 citations into it; #2,863 of 12,182 by trust here, #3,924 by citations
- Control and Systems Engineering — 6 citations into it
- Scaling & Learning Theory — 5 citations into it
Whom Tin Kam Ho trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Vladimir Naumovich Vapni
- Yuhai Wu
- Steven L. Salzberg
- Yoav Freund
- Robert E. Schapire
- Alberto Maria Segre
- Jerome H. Friedman
- J. Ross Quinlan
- Sreerama K. Murthy
- William I. Gasarch
Who trusts Tin Kam Ho overall
- Battista Biggio
- Giorgio Fumera
- Piotr Doll'ar
- Pierre Geurts
- Gérard Biau
- Gilles Louppe
- Zhi-Hua Zhou
- Robi Polikar
- Ludmila I. Kuncheva
- Tomás Pevný
Papers from Tin Kam Ho's perspective
Ordered by how strongly the researchers Tin Kam Ho trusts endorse each paper. Same corpus, a different order for every researcher.
- Statistical learning theory
- Programs for Machine Learning
- Random Forests
- Greedy function approximation: A gradient boosting machine.
- Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond
- Experiments with a New Boosting Algorithm
- Statistical Learning Theory
- Scikit-learn: Machine Learning in Python
- A Survey on Transfer Learning
- ImageNet classification with deep convolutional neural networks
Their papers
- Bootstrapping Conversational Agents With Weak Supervision (2018) — 21 citations
- Complexity Measures of Supervised Classification Problems (2002) — 759 citations
- Machine Learning Made Easy: A Review of Scikit-learn Package in Python Programming Language (2019) — 455 citations
- How Complex Is Your Classification Problem? (2018) — 305 citations
- Design of the 2015 ChaLearn AutoML challenge (2015) — 135 citations
- Data Complexity in Pattern Recognition (2006) — 186 citations
- Measuring the complexity of classification problems (2000) — 59 citations
- The Random Subspace Method for Constructing Decision Forests (1998)