Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (Q1761225): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: DASL / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 39 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2012.02.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1984745425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3925006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical programming approach to clusterwise regression model and its extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifiability of models for clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5706832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A repetitive branch-and-bound procedure for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least Squares Computations by Givens Transformations Without Square Roots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correction to: Algorithm 39. Clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bio-mimetic approach to marketing segmentation: Principles and comparative analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dyadic segmentation approach to business partnerships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locally Linear Regression and the Calibration Problem for Micro-Array Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A maximum likelihood methodology for clusterwise linear regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixture likelihood approach for generalized linear models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed logical-linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-Bounded Binary Decision Diagrams for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic, Optimization, and Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3713398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Clustering Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2758011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4953883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank

Latest revision as of 21:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression
scientific article

    Statements

    Extensions to the repetitive branch and bound algorithm for globally optimal clusterwise regression (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    combinatorial optimization
    0 references
    clusterwise regression
    0 references
    branch and bound
    0 references
    sequencing
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references