메뉴 건너뛰기




Volumn 21, Issue 2, 2006, Pages 211-229

New clustering methods for interval data

Author keywords

Distances; Dynamic clustering; Interval data; Prototypes

Indexed keywords


EID: 33750148940     PISSN: 09434062     EISSN: 16139658     Source Type: Journal    
DOI: 10.1007/s00180-006-0260-0     Document Type: Article
Times cited : (84)

References (20)
  • 1
    • 33750146674 scopus 로고    scopus 로고
    • Clustering algorithms and kohonen maps for symbolic data
    • Osaka
    • Bock, H.-H. (2001), Clustering algorithms and kohonen maps for symbolic data, in 'ICNCB Proceedings', Osaka, pp. 203 215.
    • (2001) ICNCB Proceedings , pp. 203
    • Bock, H.-H.1
  • 2
    • 0004077589 scopus 로고    scopus 로고
    • Analysis of symbolic data. Exploratory methods for extracting statistical information from complex data
    • Bock, H.-H. & Diday, E., eds Springer Verlag, Heidelberg
    • Bock, H.-H. & Diday, E., eds (2000), Analysis of symbolic data. Exploratory methods for extracting statistical information from complex data, Studies in classification, data analysis and knowledge organisation, Springer Verlag, Heidelberg.
    • (2000) Studies in Classification, Data Analysis and Knowledge Organisation
  • 4
    • 33750188844 scopus 로고    scopus 로고
    • An hausdorff distance between hyper-rectangles for clustering interval data
    • D. Banks, L. House, F. McMorris, P. Arabie & W. Gaul, eds, Springer Verlag
    • Chavent, M. (2004), An hausdorff distance between hyper-rectangles for clustering interval data, in D. Banks, L. House, F. McMorris, P. Arabie & W. Gaul, eds, 'Classification, Clustering, and Data Mining applications', Springer Verlag, pp. 333-339.
    • (2004) Classification, Clustering, and Data Mining Applications , pp. 333-339
    • Chavent, M.1
  • 5
    • 33750175987 scopus 로고    scopus 로고
    • Trois nouvelles méthodes de classification automatique de données symboliques de type intervalle
    • Chavent, M., De Carvalho, F. A. T., Lechevallier, Y. & Verde, R. (2003), 'Trois nouvelles méthodes de classification automatique de données symboliques de type intervalle', Rev. Stat. Appliquées LI(4), 5-29.
    • (2003) Rev. Stat. Appliquées , vol.51 , Issue.4 , pp. 5-29
    • Chavent, M.1    De Carvalho, F.A.T.2    Lechevallier, Y.3    Verde, R.4
  • 6
    • 0012393548 scopus 로고    scopus 로고
    • Dynamical clustering of interval data, optimization of an adequacy criterion based on hausdorff distance
    • K. Jajuga, A. Sokolowski & H.-H. Bock, eds, Springer Verlag, Berlin
    • Chavent, M. & Lechevallier, Y. (2002), Dynamical clustering of interval data, optimization of an adequacy criterion based on hausdorff distance, in K. Jajuga, A. Sokolowski & H.-H. Bock, eds, 'Classification, Clustering, and Data Analysis', Springer Verlag, Berlin, pp. 53-60.
    • (2002) Classification, Clustering, and Data Analysis , pp. 53-60
    • Chavent, M.1    Lechevallier, Y.2
  • 8
    • 0343097154 scopus 로고    scopus 로고
    • Statistical proximity functions of boolean symbolic objects based on histograms
    • A. Rizzi, M. Vichi & H.-H. Bock, eds, Springer Verlag
    • De Carvalho, F. A. T. & Souza, R. M. C. (1998), Statistical proximity functions of boolean symbolic objects based on histograms, in A. Rizzi, M. Vichi & H.-H. Bock, eds, 'Advances in Data Science and Classification', Springer Verlag, pp. 391 396.
    • (1998) Advances in Data Science and Classification , vol.391 , pp. 396
    • De Carvalho, F.A.T.1    Souza, R.M.C.2
  • 10
    • 0346724786 scopus 로고    scopus 로고
    • Clustering of interval data based on city-block distances
    • De Souza, R. M. C. R. & De Carvalho, F. A. T. (2004), 'Clustering of interval data based on city-block distances.', Pattern Recognition Letters 25(3), 353-365.
    • (2004) Pattern Recognition Letters , vol.25 , Issue.3 , pp. 353-365
    • De Souza, R.M.C.R.1    De Carvalho, F.A.T.2
  • 11
    • 0002579892 scopus 로고
    • La méthode des nuées dynamiques
    • Diday, E. (1971), 'La méthode des nuées dynamiques', Rev. Stat. Appliquées 19(2).
    • (1971) Rev. Stat. Appliquées , vol.19 , Issue.2
    • Diday, E.1
  • 12
    • 0043135897 scopus 로고
    • The symbolic approach in clustering and related methods of data analysis: The basic choices
    • H.-H. Bock, ed., North Holland, Amsterdam
    • Diday, E. (1988), The symbolic approach in clustering and related methods of data analysis: The basic choices, in H.-H. Bock, ed., 'Classification and related methods of data anlysis', North Holland, Amsterdam, pp. 673-684.
    • (1988) Classification and Related Methods of Data Anlysis , pp. 673-684
    • Diday, E.1
  • 13
    • 0005900345 scopus 로고
    • Symbolic cluster analysis
    • Opitz & H.-H. Bock, eds, Springer Verlag, Berlin
    • Diday, E. & Brito, P. (1989), Symbolic cluster analysis, in 0. Opitz & H.-H. Bock, eds, 'Conceptual and Numerical Analysis of Data', Springer Verlag, Berlin, pp. 45-84.
    • (1989) Conceptual and Numerical Analysis of Data , pp. 45-84
    • Diday, E.1    Brito, P.2
  • 14
    • 0019111672 scopus 로고
    • Clustering analysis
    • K. Pu, ed., Springer Verlag
    • Diday, E. & Simon, J. C. (1976), Clustering analysis, in K. Pu, ed., 'Digital Pattern Classification', Springer Verlag, pp. 47 94.
    • (1976) Digital Pattern Classification , vol.94 , pp. 47
    • Diday, E.1    Simon, J.C.2
  • 15
    • 0346760234 scopus 로고    scopus 로고
    • An iteractive relocation algorithm for classifying symbolic data
    • W. e. a. Gaul, ed., Springer Verlag, Berlin
    • Gordon, A. D. (2000), An iteractive relocation algorithm for classifying symbolic data., in W. e. a. Gaul, ed., 'Data Analysis: Scientific Modeling and Practical Application', Springer Verlag, Berlin, pp. 17-23.
    • (2000) Data Analysis: Scientific Modeling and Practical Application , pp. 17-23
    • Gordon, A.D.1
  • 18
    • 0029415780 scopus 로고
    • A conceptual version of the k-means algorithm
    • Ralambondrainy, H. (1995), 'A conceptual version of the k-means algorithm.', Pattern Recognition Letters 16, 1147-1157.
    • (1995) Pattern Recognition Letters , vol.16 , pp. 1147-1157
    • Ralambondrainy, H.1
  • 19
    • 0026153079 scopus 로고
    • Computing the minimum hausdorff distance between two point sets on a line under translation
    • Rote, G. (1991), 'Computing the minimum hausdorff distance between two point sets on a line under translation', Information Processing Letters 38, 123-127.
    • (1991) Information Processing Letters , vol.38 , pp. 123-127
    • Rote, G.1


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