• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
  •   BIRD Home
  • CEREMADE (UMR CNRS 7534)
  • CEREMADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

Set Systems and Dissimilarities

Bertrand, Patrice (2000), Set Systems and Dissimilarities, European Journal of Combinatorics, 21, 6, p. 727-743. http://dx.doi.org/10.1006/eujc.1999.0379

Type
Article accepté pour publication ou publié
Date
2000
Journal name
European Journal of Combinatorics
Volume
21
Number
6
Publisher
Elsevier
Pages
727-743
Publication identifier
http://dx.doi.org/10.1006/eujc.1999.0379
Metadata
Show full item record
Author(s)
Bertrand, Patrice
Abstract (EN)
Different one–one correspondences exist between classes of indexed clustering structures (such as indexed hierarchies) and classes of dissimilarities (such as ultrametrics). Following the line developed in previous works (i.e., Johnson (1967), Diday (1984, 1986), Bertrand and Diday (1991), Batbedat (1988), Bandelt and Dress (1994)), we associate each pseudo-dissimilarityδ defined on a finite set E with the set system of all maximal linked subsets of E. This provides a one–one correspondence that maps the set of pseudo-dissimilarities onto the collection of all the valued set systems (S, f) that satisfy two conditions. One of these conditions was introduced by Batbedat (1988) and is related to the characterization of 2-conformity in hypergraphs (see also Bandelt and Dress (1994)). We introduce the other condition which requires the index f to be a weak index. Our approach includes a characterization of the valued set systems (S, f) such that S contains (respectively is contained in) the set of all finite nonempty intersections of maximal linked subsets with respect to the pseudo-dissimilarity induced by the pair (S, f).
Subjects / Keywords
Cluster Analysis

Related items

Showing items related by title and author.

  • Thumbnail
    Prepyramidal clustering and Robinsonian dissimilarities: one-to-one correspondences 
    Bertrand, Patrice; Diatta, Jean (2013) Article accepté pour publication ou publié
  • Thumbnail
    Systems of sets such that each set properly intersects at most one other set - Application to cluster analysis 
    Bertrand, Patrice (2008) Article accepté pour publication ou publié
  • Thumbnail
    Set systems for which each set properly intersects at most one other set - Application to pyramidal clustering 
    Bertrand, Patrice (2002) Document de travail / Working paper
  • Thumbnail
    Classifications en classes recouvrantes ou non, et leurs dissimilarités 
    Bertrand, Patrice (2010) Article accepté pour publication ou publié
  • Thumbnail
    Stability measures for assessing a partition and its clusters: application to symbolic data sets. 
    Bertrand, Patrice; Bel Mufti, Ghazi (2008) Chapitre d'ouvrage
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo