Boosting for high-dimensional linear models (Q2497175): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Q61078 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: PDCO / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CRAN / rank
 
Normal rank
Property / author
 
Property / author: Bühlmann Peter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952563653 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: math/0606789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arcing classifiers. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting With the<i>L</i><sub>2</sub>Loss / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic Decomposition by Basis Pursuit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding predictive gene groups from microarray data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4881152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of Discrimination Methods for the Classification of Tumors Using Gene Expression Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least angle regression. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy function approximation: A gradient boosting machine. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive prediction and estimation in linear regression with infinitely many parameters. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistene in high-dimensional linear predictor-selection and the virtue of overparametrization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Parameter Selection in Nonparametric Regression Using an Improved Akaike Information Criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Process consistency for AdaBoost. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bayes-risk consistency of regularized boosting methods. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching pursuits with time-frequency dictionaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864293 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4197160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting with early stopping: convergence and consistency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization and Variable Selection Via the Elastic Net / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:24, 24 June 2024

scientific article
Language Label Description Also known as
English
Boosting for high-dimensional linear models
scientific article

    Statements

    Boosting for high-dimensional linear models (English)
    0 references
    3 August 2006
    0 references
    binary classification
    0 references
    gene expression
    0 references
    Lasso
    0 references
    matching pursuit
    0 references
    overcomplete dictionary
    0 references
    sparsity
    0 references
    variable selection
    0 references
    weak greedy algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references