One-dimensional identification problem and ranking parameters (Q1959238): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: reviewed by (P1447): Item:Q479248
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-009-9509-9 / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Jean Jacques Strodiot / 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.1007/s10898-009-9509-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971030739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5510384 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-009-9509-9 / rank
 
Normal rank

Latest revision as of 15:26, 16 December 2024

scientific article
Language Label Description Also known as
English
One-dimensional identification problem and ranking parameters
scientific article

    Statements

    One-dimensional identification problem and ranking parameters (English)
    0 references
    0 references
    0 references
    6 October 2010
    0 references
    Problems of separating two sets of points in R arise, for example, in the theory of identification and mathematical diagnostics. Here the authors treat the problem of identifying points of two finite sets located on the real line. Two identification procedures are discussed: by means of a linear identifier (the separation method) and by means of isolation of one of the sets by interval. In the first method the points belonging to one semi-line are attributed to one set while the points from the other semi-line to another set. It is required to find a linear identifier such that the number of misclassified points is minimal. In the second method the identification is performed by isolating one of the sets by means of an interval. The points belonging to this interval are attributed to one set while the points not belonging to the interval are attributed to another set. It is required to find an interval such that the number of misclassified points is minimal.
    0 references
    mathematical diagnostics
    0 references
    one-dimensional identification problem
    0 references
    ranking parameters
    0 references
    separation method
    0 references
    isolation method
    0 references
    0 references
    0 references
    0 references

    Identifiers