Zobrazeno 1 - 10
of 123
pro vyhledávání: '"Tian, Peter"'
Decision tree learning is increasingly being used for pointwise inference. Important applications include causal heterogenous treatment effects and dynamic policy decisions, as well as conditional quantile regression and design of experiments, where
Externí odkaz:
http://arxiv.org/abs/2211.10805
Autor:
Klusowski, Jason M., Tian, Peter M.
This paper shows that decision trees constructed with Classification and Regression Trees (CART) and C4.5 methodology are consistent for regression and classification tasks, even when the number of predictor variables grows sub-exponentially with the
Externí odkaz:
http://arxiv.org/abs/2104.13881
Autor:
Klusowski, Jason M., Tian, Peter M.
Decision trees and their ensembles are endowed with a rich set of diagnostic tools for ranking and screening variables in a predictive model. Despite the widespread use of tree based variable importance measures, pinning down their theoretical proper
Externí odkaz:
http://arxiv.org/abs/2011.02683
Let $up(r, t) = (a_1 a_2 \dots a_r)^t$. We investigate the problem of determining the maximum possible integer $n(r, t)$ for which there exist $2t-1$ permutations $\pi_1, \pi_2, \dots, \pi_{2t-1}$ of $1, 2, \dots, n(r, t)$ such that the concatenated
Externí odkaz:
http://arxiv.org/abs/1909.10330
Autor:
Charles, Lesley, Jensen, Lisa, Añez Delfin, Jorge Mario, Norman, Erin, Dobbs, Bonnie, Tian, Peter George Jaminal, Parmar, Jasneet
Publikováno v:
Professional Case Management; Sep/Oct2024, Vol. 29 Issue 5, p198-205, 8p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Parmar, Jasneet, Anderson, Sharon, Charles, Lesley, Marion, Cecelia, Chan, Karenn, Brémault-Phillips, Suzette, Faulder, Douglas, Tian, Peter George J., Sidhu, Gurparampreet, Haq, Anwar
Publikováno v:
In Journal of the American Medical Directors Association May 2021 22(5):1088-1095
Autor:
Geneson, Jesse T., Tian, Peter M.
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one matrix $A$ a
Externí odkaz:
http://arxiv.org/abs/1506.03874
In a 1995 paper Richard Stanley defined $X_G$, the symmetric chromatic polynomial of a Graph $G=(V,E)$. He then conjectured that $X_G$ distinguishes trees; a conjecture which still remains open. $X_G$ can be represented as a certain collection of int
Externí odkaz:
http://arxiv.org/abs/1505.01889
Autor:
Geneson, Jesse, Tian, Peter
Sequence pattern avoidance is a central topic in combinatorics. A sequence $s$ contains a sequence $u$ if some subsequence of $s$ can be changed into $u$ by a one-to-one renaming of its letters. If $s$ does not contain $u$, then $s$ avoids $u$. A wid
Externí odkaz:
http://arxiv.org/abs/1502.04095