Skip to main content
SpringerLink
Log in

Transfer distance between partitions and search of dense zones in graphs

  • PhD Thesis
  • Published:
4OR Aims and scope Submit manuscript

Abstract

This text summarizes the Ph.D. thesis defended by the author in November 2006 under the supervision of Olivier Hudry, at the Université Paris 1. The thesis is written in French and can be obtained from the author upon request. The first part of the thesis is mainly devoted to the study of distances between partitions, and more precisely to the transfer distance. In the second part, we design a method for overlapping clustering and we apply it to protein interactions networks.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Charon I, Denœud L, Guénoche A, Hudry O (2006) Maximum transfer distance between partitions. J Classification 23(1): 103–121

    Article  Google Scholar 

  • Charon I, Denœud L, Hudry O (2007a) Maximum de la distance de transfert à une partition donnée. Math Sci Hum 179(3): 45–83

    Google Scholar 

  • Charon I, Denœud L, Hudry O (2007b) Overlapping clustering in a graph using k-means and application to protein interactions networks. In: Brito P, Bertrand P, Cucumel G, De Carvalho F (eds) Selected contributions in classification and data analysis. Springer, Berlin, pp 173–182

    Chapter  Google Scholar 

  • Day W (1981) The complexity of computing metric distances between partitions. Math Soc Sci 1: 269–287

    Article  Google Scholar 

  • Denœud L (2008) Transfer distance between partitions. Adv Data Anal Classification 2(3): 279–294

    Article  Google Scholar 

  • Denœud L, Guénoche A (2006) Comparison of distance indices between partitions. In: Batagelj V (eds) et al Proceedings of IFCS’2006, Data Science and Classification. Springer, Berlin, pp 21–28

    Chapter  Google Scholar 

  • Denœud L, Charon I, Guénoche A, Hudry O (2005a) Classes empiétantes dans un graphe et application aux interactions entre protéines. In: Billaut J-C, Esswein C (eds) Proceedings of ROADEF’05. Presses Universitaires François Rabelais, Tours, France, pp 393–408

  • Denœud L, Garreta H, Guénoche A (2005b) Comparison of distance indices between partitions. In: Proceedings of ASMDA, Brest, France

  • Dice LR (1945) Measures of the amount of ecologic association between species. Ecology 26: 297–302

    Article  Google Scholar 

  • Diday E (1971) Une nouvelle méthode en classification automatique et reconnaissance des formes : la méthode des nuées dynamiques. Rev Stat Appl 19(2): 19–33

    Google Scholar 

  • Hubert L, Arabie P (1985) Comparing partitions. J Classification 2: 193–218

    Article  Google Scholar 

  • Régnier S (1965) Sur quelques aspects mathématiques des problèmes de classification automatique, I.C.C. Bulletin 4, Rome

Download references

Author information

Authors and Affiliations

  1. Telecom ParisTech 46, rue barrault, 75634, Paris CEDEX 13, France

    Lucile Denœud-Belgacem

Authors
  1. Lucile Denœud-Belgacem
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lucile Denœud-Belgacem.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Denœud-Belgacem, L. Transfer distance between partitions and search of dense zones in graphs. 4OR-Q J Oper Res 7, 395–398 (2009). https://doi.org/10.1007/s10288-008-0093-5

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10288-008-0093-5

Keywords

MSCclassification (2000)

Search

Navigation