Skip to main content

Pertinence for a Classification

  • Conference paper
Advances in Data Science and Classification

Abstract

The Clique Partitioning Problem constitutes a general framework for clustering, when similarities assume positive and negative values. The effectiveness of various heuristic methods of solving the above problem has been proved by several authors.

In order to evaluate the validity of one optimal classification P* obtained by this approach, we propose a hierarchical process, working on the clusters of P*. Thus, we obtain a family of classifications, and the concept of pertinence enables us to detect the interesting classifications.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. De Amorim S. & Barthélémy & J.P., Ribeiro C. (1992). Clustering and Clique Partitioning: Simulated Annealing and Tabu Search Approaches, in Journal of Classification, 9, 17–41.

    Google Scholar 

  2. Bock H. (1994). Classification and Clustering: Problems for the Future, in: E. Diday et al (eds. New Approaches in Classification and Data Analysis, Springer Verlag, 3–24.

    Google Scholar 

  3. Grotschel M. & Wakabayashi Y. (1989) A Cutting Plane Algorithm for a Clustering Problem, in: Mathematical Programming, 45, 59–96.

    Google Scholar 

  4. Hansen P. & Jaumard B. & Sanlaville E. (1994). Partitionning Problems in Cluster Analysis: a Review of Mathematical Programming Approaches in: New Approaches in Classification and Data Analysis, E. Diday et al (eds), Springer Verlag, 228–240.

    Google Scholar 

  5. Marcotorchino J.F. & Michaud P. (1981). Heuristic Approach to the Similarity Aggregation Problem, in: Methods of Operations Research, 43, 395–404.

    Google Scholar 

  6. Saporta G. (1990). Probabilités, Analyse des Données et Statistiques, Technip, Paris

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Nicoloyannis, N., Terrenoire, M., Tounissoux, D. (1998). Pertinence for a Classification. In: Rizzi, A., Vichi, M., Bock, HH. (eds) Advances in Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72253-0_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-72253-0_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64641-9

  • Online ISBN: 978-3-642-72253-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics