sparsenet (Q30963): Difference between revisions

From MaRDI portal
Removed claim: Software Heritage ID (P1454): swh:1:snp:6d63116e43d31ad8f22f9311fedf8568f6bbdd9c
Swh import (talk | contribs)
SWHID from Software Heritage
 
(16 intermediate revisions by 5 users not shown)
Property / programmed in
 
Property / programmed in: R / rank
Normal rank
 
Property / last update
10 November 2019
Timestamp+2019-11-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
 
Property / last update: 10 November 2019 / rank
Normal rank
 
Property / author
 
Property / author: Rahul Mazumder / rank
Normal rank
 
Property / author
 
Property / author: Trevor Hastie / rank
Normal rank
 
Property / author
 
Property / author: Jerome Friedman / rank
Normal rank
 
Property / maintained by
 
Property / maintained by: Trevor Hastie / rank
Normal rank
 
Property / copyright license
 
Property / copyright license: GNU General Public License, version 2.0 / rank
Normal rank
 
Property / depends on software
 
Property / depends on software: Matrix / rank
Normal rank
 
Property / depends on software: Matrix / qualifier
 
Property / depends on software
 
Property / depends on software: shape / rank
Normal rank
 
Property / imports
 
Property / imports: methods / rank
Normal rank
 
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
Normal rank
 
Property / cites work
 
Property / cites work: SparseNet: Coordinate Descent With Nonconvex Penalties / rank
Normal rank
 
Property / software version identifier
 
1.0
Property / software version identifier: 1.0 / rank
 
Normal rank
Property / software version identifier: 1.0 / qualifier
 
publication date: 3 March 2012
Timestamp+2012-03-03T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
1.1
Property / software version identifier: 1.1 / rank
 
Normal rank
Property / software version identifier: 1.1 / qualifier
 
publication date: 7 January 2013
Timestamp+2013-01-07T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
1.2
Property / software version identifier: 1.2 / rank
 
Normal rank
Property / software version identifier: 1.2 / qualifier
 
publication date: 12 March 2014
Timestamp+2014-03-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
1.3
Property / software version identifier: 1.3 / rank
 
Normal rank
Property / software version identifier: 1.3 / qualifier
 
publication date: 11 February 2019
Timestamp+2019-02-11T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
1.5
Property / software version identifier: 1.5 / rank
 
Normal rank
Property / software version identifier: 1.5 / qualifier
 
publication date: 22 August 2023
Timestamp+2023-08-22T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / software version identifier
 
1.6
Property / software version identifier: 1.6 / rank
 
Normal rank
Property / software version identifier: 1.6 / qualifier
 
publication date: 5 February 2024
Timestamp+2024-02-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / programmed in
 
Property / programmed in: R / rank
 
Normal rank
Property / described by source
 
Property / described by source: <i>SparseNet</i>: Coordinate Descent With Nonconvex Penalties / rank
 
Normal rank
Property / last update
 
5 February 2024
Timestamp+2024-02-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / last update: 5 February 2024 / rank
 
Normal rank
Property / maintained by
 
Property / maintained by: Trevor Hastie / rank
 
Normal rank
Property / description
 
Efficient procedure for fitting regularization paths between L1 and L0, using the MC+ penalty of Zhang, C.H. (2010)<doi:10.1214/09-AOS729>. Implements the methodology described in Mazumder, Friedman and Hastie (2011) <doi:10.1198/jasa.2011.tm09738>. Sparsenet computes the regularization surface over both the family parameter and the tuning parameter by coordinate descent.
Property / description: Efficient procedure for fitting regularization paths between L1 and L0, using the MC+ penalty of Zhang, C.H. (2010)<doi:10.1214/09-AOS729>. Implements the methodology described in Mazumder, Friedman and Hastie (2011) <doi:10.1198/jasa.2011.tm09738>. Sparsenet computes the regularization surface over both the family parameter and the tuning parameter by coordinate descent. / rank
 
Normal rank
Property / author
 
Property / author: Rahul Mazumder / rank
 
Normal rank
Property / author
 
Property / author: Trevor Hastie / rank
 
Normal rank
Property / author
 
Property / author: Jerome H. Friedman / rank
 
Normal rank
Property / copyright license
 
Property / copyright license: GNU General Public License, version 2.0 / rank
 
Normal rank
Property / depends on software
 
Property / depends on software: Matrix / rank
 
Normal rank
Property / depends on software: Matrix / qualifier
 
Property / depends on software
 
Property / depends on software: shape / rank
 
Normal rank
Property / imports
 
Property / imports: methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nearly unbiased variable selection under minimax concave penalty / rank
 
Normal rank
Property / cites work
 
Property / cites work: SparseNet: Coordinate Descent With Nonconvex Penalties / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI software profile / rank
 
Normal rank
Property / source code repository
 
Property / source code repository: https://github.com/cran/sparsenet / rank
 
Normal rank
Property / Software Heritage ID
 
Property / Software Heritage ID: swh:1:snp:b8a08008f0a65cb82b8d5aad6d0dd9e41da49daf / rank
 
Normal rank
Property / Software Heritage ID: swh:1:snp:b8a08008f0a65cb82b8d5aad6d0dd9e41da49daf / qualifier
 
Property / Software Heritage ID: swh:1:snp:b8a08008f0a65cb82b8d5aad6d0dd9e41da49daf / qualifier
 
point in time: 15 February 2024
Timestamp+2024-02-15T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:34, 21 March 2024

Fit Sparse Linear Regression Models via Nonconvex Optimization
Language Label Description Also known as
English
sparsenet
Fit Sparse Linear Regression Models via Nonconvex Optimization

    Statements

    0 references
    1.4
    10 November 2019
    0 references
    1.0
    3 March 2012
    0 references
    1.1
    7 January 2013
    0 references
    1.2
    12 March 2014
    0 references
    1.3
    11 February 2019
    0 references
    1.5
    22 August 2023
    0 references
    1.6
    5 February 2024
    0 references
    0 references
    5 February 2024
    0 references
    Efficient procedure for fitting regularization paths between L1 and L0, using the MC+ penalty of Zhang, C.H. (2010)<doi:10.1214/09-AOS729>. Implements the methodology described in Mazumder, Friedman and Hastie (2011) <doi:10.1198/jasa.2011.tm09738>. Sparsenet computes the regularization surface over both the family parameter and the tuning parameter by coordinate descent.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers