Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An alternative pruning based approach to unbiased recursive partitioning

From MaRDI portal
Publication:1658507
Jump to:navigation, search

DOI10.1016/J.CSDA.2016.08.011zbMath1466.62018OpenAlexW2516480567MaRDI QIDQ1658507

Y. Aharonov

Publication date: 14 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2016.08.011


zbMATH Keywords

interactionspruningfalse discovery ratetree-based methods


Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)



Uses Software

  • R
  • rpart
  • partykit
  • evtree



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Variable selection bias in regression trees with constant fits
  • Bias in information-based measures in decision tree induction
  • The asymptotic theory of permutation statistics.
  • Regression Trees for Censored Data
  • Tree-Structured Classification Via Generalized Discriminant Analysis
  • Survival Trees by Goodness of Split
  • Problems in the Analysis of Survey Data, and a Proposal




This page was built for publication: An alternative pruning based approach to unbiased recursive partitioning

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1658507&oldid=13965040"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 04:25.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki