IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-7908-1709-6_4.html
   My bibliography  Save this book chapter

A robust linear grouping algorithm

In: Compstat 2006 - Proceedings in Computational Statistics

Author

Listed:
  • Greet Pison

    (Ghent University (UGent), Department of Applied Mathematics and Computer Science)

  • Stefan Van Aelst

    (Ghent University (UGent), Department of Applied Mathematics and Computer Science)

  • Ruben H. Zamar

    (University of British Columbia, Department of Statistics)

Abstract

Recently, an algorithm to detect groups in a dataset that follow different linear patterns was proposed in [VWZ06]. The algorithm is flexible in the sense that it does not require the specification of a response variable. On the other hand, the algorithm requires that each observation follows one of the linear patterns in the data. However, it often occurs in practice that part of the data does not follow any of the linear patterns. Therefore, we introduce a robust linear grouping algorithm based on trimming that can still find the linear structures even if part of the data does not belong to any of the groups.

Suggested Citation

  • Greet Pison & Stefan Van Aelst & Ruben H. Zamar, 2006. "A robust linear grouping algorithm," Springer Books, in: Alfredo Rizzi & Maurizio Vichi (ed.), Compstat 2006 - Proceedings in Computational Statistics, pages 43-53, Springer.
    • Handle: RePEc:spr:sprchp:978-3-7908-1709-6_4
    DOI: 10.1007/978-3-7908-1709-6_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;

    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:spr:sprchp:978-3-7908-1709-6_4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.