IDEAS home Printed from https://ideas.repec.org/a/wly/apsmbi/v15y1999i4p461-468.html
   My bibliography  Save this article

A ‘maximum‐path’‐based classification

Author

Listed:
  • Sergio Scippacercola

Abstract

The aim of this paper is the classification, by means of the maximum path, of n statistical units described by k variables. The method develops in three steps. In the first step, in the minimum spanning tree, among all possible paths, we identify a path of maximum length that is the basis to define a pre‐order on the n statistical units. In the multidimensional space, the maximum path can be considered as a ‘walk’ in the mathematical meaning. In the second step, we provide a linearization of the minimum spanning tree with reference to the maximum path. The points on the lateral edges of the maximum path are shifted into the maximum path itself with regard to the ultrametric distance. In the last step, the maximum path and the lateral edges are the basis to use a criterion of constrained classification with barriers. Finally, the method is applied to sets of multidimensional data. Copyright © 1999 John Wiley & Sons, Ltd.

Suggested Citation

  • Sergio Scippacercola, 1999. "A ‘maximum‐path’‐based classification," Applied Stochastic Models in Business and Industry, John Wiley & Sons, vol. 15(4), pages 461-468, October.
    • Handle: RePEc:wly:apsmbi:v:15:y:1999:i:4:p:461-468
    DOI: 10.1002/(SICI)1526-4025(199910/12)15:43.0.CO;2-6
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/(SICI)1526-4025(199910/12)15:43.0.CO;2-6
    Download Restriction: no
    File URL: https://libkey.io/10.1002/(SICI)1526-4025(199910/12)15:43.0.CO;2-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:apsmbi:v:15:y:1999:i:4:p:461-468. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1526-4025 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.