party (Q19366)

From MaRDI portal
A Laboratory for Recursive Partytioning
Language Label Description Also known as
English
party
A Laboratory for Recursive Partytioning

    Statements

    0 references
    0 references
    1.3-13
    17 March 2023
    0 references
    0.2-1
    24 June 2005
    0 references
    0.2-2
    27 June 2005
    0 references
    0.2-3
    29 June 2005
    0 references
    0.2-4
    7 July 2005
    0 references
    0.2-5
    20 August 2005
    0 references
    0.2-6
    30 August 2005
    0 references
    0.2-7
    1 September 2005
    0 references
    0.2-8
    7 September 2005
    0 references
    0.2-9
    20 October 2005
    0 references
    0.2-10
    9 November 2005
    0 references
    0.3-0
    29 November 2005
    0 references
    0.3-1
    2 December 2005
    0 references
    0.3-2
    12 January 2006
    0 references
    0.3-3
    18 January 2006
    0 references
    0.3-5
    3 February 2006
    0 references
    0.3-6
    7 February 2006
    0 references
    0.8-0
    16 February 2006
    0 references
    0.8-1
    24 February 2006
    0 references
    0.8-3
    20 March 2006
    0 references
    0.8-4
    12 April 2006
    0 references
    0.8-5
    24 April 2006
    0 references
    0.8-6
    23 May 2006
    0 references
    0.8-7
    19 July 2006
    0 references
    0.8-8
    23 August 2006
    0 references
    0.9-0
    31 August 2006
    0 references
    0.9-1
    7 September 2006
    0 references
    0.9-2
    7 September 2006
    0 references
    0.9-3
    8 September 2006
    0 references
    0.9-4
    18 September 2006
    0 references
    0.9-5
    27 October 2006
    0 references
    0.9-6
    29 November 2006
    0 references
    0.9-7
    16 January 2007
    0 references
    0.9-8
    22 January 2007
    0 references
    0.9-9
    2 February 2007
    0 references
    0.9-10
    1 March 2007
    0 references
    0.9-11
    21 June 2007
    0 references
    0.9-12
    28 June 2007
    0 references
    0.9-13
    23 July 2007
    0 references
    0.9-14
    23 July 2007
    0 references
    0.9-90
    24 September 2007
    0 references
    0.9-91
    27 September 2007
    0 references
    0.9-92
    23 November 2007
    0 references
    0.9-93
    2 December 2007
    0 references
    0.9-94
    30 January 2008
    0 references
    0.9-95
    28 February 2008
    0 references
    0.9-96
    8 June 2008
    0 references
    0.9-97
    27 June 2008
    0 references
    0.9-98
    15 October 2008
    0 references
    0.9-99
    28 October 2008
    0 references
    0.9-991
    14 January 2009
    0 references
    0.9-992
    20 January 2009
    0 references
    0.9-993
    29 January 2009
    0 references
    0.9-994
    10 February 2009
    0 references
    0.9-995
    23 February 2009
    0 references
    0.9-996
    27 March 2009
    0 references
    0.9-997
    4 June 2009
    0 references
    0.9-998
    17 June 2009
    0 references
    0.9-999
    24 September 2009
    0 references
    0.9-9991
    27 January 2010
    0 references
    0.9-9992
    26 February 2010
    0 references
    0.9-9993
    5 March 2010
    0 references
    0.9-9994
    15 April 2010
    0 references
    0.9-9995
    19 May 2010
    0 references
    0.9-9996
    25 June 2010
    0 references
    0.9-9997
    6 July 2010
    0 references
    0.9-9998
    23 August 2010
    0 references
    0.9-9999
    13 September 2010
    0 references
    0.9-99991
    19 November 2010
    0 references
    0.9-99992
    2 May 2011
    0 references
    0.9-99993
    29 July 2011
    0 references
    0.9-99994
    24 August 2011
    0 references
    0.9-99995
    2 November 2011
    0 references
    0.9-99996
    20 December 2011
    0 references
    1.0-0
    28 February 2012
    0 references
    1.0-1
    23 March 2012
    0 references
    1.0-2
    26 April 2012
    0 references
    1.0-3
    26 September 2012
    0 references
    1.0-4
    19 December 2012
    0 references
    1.0-5
    7 January 2013
    0 references
    1.0-6
    9 January 2013
    0 references
    1.0-7
    5 June 2013
    0 references
    1.0-8
    11 July 2013
    0 references
    1.0-9
    2 September 2013
    0 references
    1.0-10
    24 October 2013
    0 references
    1.0-11
    14 December 2013
    0 references
    1.0-12
    17 January 2014
    0 references
    1.0-13
    1 February 2014
    0 references
    1.0-14
    30 May 2014
    0 references
    1.0-15
    30 June 2014
    0 references
    1.0-16
    19 August 2014
    0 references
    1.0-17
    17 September 2014
    0 references
    1.0-18
    10 November 2014
    0 references
    1.0-19
    18 December 2014
    0 references
    1.0-20
    24 February 2015
    0 references
    1.0-21
    6 June 2015
    0 references
    1.0-22
    28 July 2015
    0 references
    1.0-23
    16 August 2015
    0 references
    1.0-25
    5 November 2015
    0 references
    1.1-0
    21 November 2016
    0 references
    1.1-1
    23 November 2016
    0 references
    1.1-2
    28 November 2016
    0 references
    1.2-0
    6 February 2017
    0 references
    1.2-1
    9 February 2017
    0 references
    1.2-2
    27 February 2017
    0 references
    1.2-3
    12 April 2017
    0 references
    1.2-4
    13 December 2017
    0 references
    1.3-0
    20 April 2018
    0 references
    1.3-1
    8 August 2018
    0 references
    1.3-2
    1 March 2019
    0 references
    1.3-3
    6 March 2019
    0 references
    1.3-4
    5 March 2020
    0 references
    1.3-5
    12 June 2020
    0 references
    1.3-6
    8 February 2021
    0 references
    1.3-7
    3 March 2021
    0 references
    1.3-8
    23 August 2021
    0 references
    1.3-9
    27 September 2021
    0 references
    1.3-10
    26 April 2022
    0 references
    1.3-11
    7 October 2022
    0 references
    1.3-12
    28 February 2023
    0 references
    1.3-14
    28 November 2023
    0 references
    0 references
    0 references
    28 November 2023
    0 references
    A computational toolbox for recursive partitioning. The core of the package is ctree(), an implementation of conditional inference trees which embed tree-structured regression models into a well defined theory of conditional inference procedures. This non-parametric class of regression trees is applicable to all kinds of regression problems, including nominal, ordinal, numeric, censored as well as multivariate response variables and arbitrary measurement scales of the covariates. Based on conditional inference trees, cforest() provides an implementation of Breiman's random forests. The function mob() implements an algorithm for recursive partitioning based on parametric models (e.g. linear models, GLMs or survival regression) employing parameter instability tests for split selection. Extensible functionality for visualizing tree-structured regression models is available. The methods are described in Hothorn et al. (2006) <doi:10.1198/106186006X133933>, Zeileis et al. (2008) <doi:10.1198/106186008X319331> and Strobl et al. (2007) <doi:10.1186/1471-2105-8-25>.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references