IDEAS home Printed from https://ideas.repec.org/a/spr/jclass/v42y2025i1d10.1007_s00357-024-09481-3.html
   My bibliography  Save this article

Cluster Validation Based on Fisher’s Linear Discriminant Analysis

Author

Listed:
  • Fabian Kächele

    (Institute for Operations Research, Analytics & Statistics, Karlsruhe Institute of Technology)

  • Nora Schneider

    (Institute for Operations Research, Analytics & Statistics, Karlsruhe Institute of Technology)

Abstract

Cluster analysis aims to find meaningful groups, called clusters, in data. The objects within a cluster should be similar to each other and dissimilar to objects from other clusters. The fundamental question arising is whether found clusters are “valid clusters” or not. Existing cluster validity indices are computation-intensive, make assumptions about the underlying cluster structure, or cannot detect the absence of clusters. Thus, we present a new cluster validation framework to assess the validity of a clustering and determine the underlying number of clusters $$k^*$$ k ∗ . Within the framework, we introduce a new merge criterion analyzing the data in a one-dimensional projection, which maximizes the ratio of between-cluster- variance to within-cluster-variance in the clusters. Nonetheless, other local methods can be applied as a merge criterion within the framework. Experiments on synthetic and real-world data sets show promising results for both the overall framework and the introduced merge criterion.

Suggested Citation

  • Fabian Kächele & Nora Schneider, 2025. "Cluster Validation Based on Fisher’s Linear Discriminant Analysis," Journal of Classification, Springer;The Classification Society, vol. 42(1), pages 54-71, March.
    • Handle: RePEc:spr:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09481-3
    DOI: 10.1007/s00357-024-09481-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00357-024-09481-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s00357-024-09481-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:jclass:v:42:y:2025:i:1:d:10.1007_s00357-024-09481-3. 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.