Algorithms and program for least squares segmentation

Algorithms and program for least squares segmentation

0.00 Avg rating0 Votes
Article ID: iaor1988369
Country: France
Volume: 20
Issue: 4
Start Page Number: 355
End Page Number: 368
Publication Date: Nov 1986
Journal: RAIRO Operations Research
Authors: ,
Abstract:

Principles of most current segmentation methods are first recalled. Then, some algorithms and a program (somewhat framed according to the norms set by MODULAD) for least squares segmentation are proposed; this program enables to deal with either the case of a nominal dependent varible or of an ordinal one. An illustrative example is given.

Reviews

Required fields are marked *. Your email address will not be published.