메뉴 건너뛰기




Volumn 2, Issue 3, 2008, Pages 279-294

Transfer distance between partitions

Author keywords

Centrality; Clustering; Distance; Partition; Transfer graph

Indexed keywords

CLUSTERING ALGORITHMS;

EID: 57849155235     PISSN: 18625347     EISSN: 18625355     Source Type: Journal    
DOI: 10.1007/s11634-008-0029-0     Document Type: Article
Times cited : (18)

References (23)
  • 1
    • 84861290606 scopus 로고
    • Propriétés métriques des ensembles ordonnés
    • PhD thesis, Université de Franche-Comté, Besançon
    • Barthélemy J-P (1979) Propriétés métriques des ensembles ordonnés. Comparaison et agrégation des relations binaires. PhD thesis, Université de Franche-Comté, Besançon
    • (1979) Comparaison et Agrégation des Relations Binaires
    • Barthélemy, J.-P.1
  • 6
    • 0000093992 scopus 로고
    • The complexity of computing metric distances between partitions
    • W Day 1981 The complexity of computing metric distances between partitions Math Soc Sci 1 269 287
    • (1981) Math Soc Sci , vol.1 , pp. 269-287
    • Day, W.1
  • 9
    • 34247110918 scopus 로고    scopus 로고
    • Comparing recent methods in graph partitioning
    • A Guénoche 2005 Comparing recent methods in graph partitioning Electron Notes Discrete Math 22 83 89
    • (2005) Electron Notes Discrete Math , vol.22 , pp. 83-89
    • Guénoche, A.1
  • 10
    • 0000008146 scopus 로고
    • Comparing partitions
    • L Hubert P Arabie 1985 Comparing partitions J Classif 2 193 218
    • (1985) J Classif , vol.2 , pp. 193-218
    • Hubert, L.1    Arabie, P.2
  • 12
    • 0002719797 scopus 로고
    • The Hungarian method for the assignment problem
    • HW Kuhn 1955 The Hungarian method for the assignment problem Naval Res Logist Q 2 83 97
    • (1955) Naval Res Logist Q , vol.2 , pp. 83-97
    • Kuhn, H.W.1
  • 15
    • 0000546425 scopus 로고    scopus 로고
    • Classifying molecular sequences using a linkage graph with their pairwise similarities
    • H Matsuda T Ishihara A Hashimoto 1999 Classifying molecular sequences using a linkage graph with their pairwise similarities Theor Comput Sci 210 305 325
    • (1999) Theor Comput Sci , vol.210 , pp. 305-325
    • Matsuda, H.1    Ishihara, T.2    Hashimoto, A.3
  • 16
    • 0035895239 scopus 로고    scopus 로고
    • The structure of scientific collaboration networks
    • MEJ Newman 2001 The structure of scientific collaboration networks Proc Natl Acad Sci USA 98 404 409
    • (2001) Proc Natl Acad Sci USA , vol.98 , pp. 404-409
    • Newman, M.E.J.1
  • 18
    • 84950632109 scopus 로고
    • Objective criteria for the evaluation of clustering methods
    • WM Rand 1971 Objective criteria for the evaluation of clustering methods J Am Stat Assoc 66 846 850
    • (1971) J Am Stat Assoc , vol.66 , pp. 846-850
    • Rand, W.M.1
  • 19
    • 0000006646 scopus 로고
    • Quelques aspects mathématiques des problèmes de classification automatique
    • Régnier S (1965) Quelques aspects mathématiques des problèmes de classification automatique. ICC Bull 4
    • (1965) ICC Bull , vol.4
    • Régnier, S.1
  • 20
    • 0000819568 scopus 로고
    • The number of partitions of a set
    • 5
    • G-C Rota 1964 The number of partitions of a set Am Math Mon 71 5 498 504
    • (1964) Am Math Mon , vol.71 , pp. 498-504
    • Rota, G.-C.1
  • 23
    • 33746182313 scopus 로고    scopus 로고
    • Une méthodologie pour la comparaison des partitions
    • 1
    • G Youness G Saporta 2004 Une méthodologie pour la comparaison des partitions Revue de Statistique Appliquée 52 1 97 120
    • (2004) Revue de Statistique Appliquée , vol.52 , pp. 97-120
    • Youness, G.1    Saporta, G.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.