메뉴 건너뛰기




Volumn 15, Issue 1, 1998, Pages 37-55

Minimum sum of squares clustering in a low dimensional space

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0032395795     PISSN: 01764268     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003579900019     Document Type: Article
Times cited : (40)

References (30)
  • 2
    • 0000670412 scopus 로고
    • Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques
    • BENZÉCRI, J. P. (1982), "Construction d'une classification ascendante hiérarchique par la recherche en chaîne des voisins réciproques," Les Cahiers de l'Analyse des Données, VII(2), 209-218.
    • (1982) Les Cahiers de l'Analyse des Données , vol.7 , Issue.2 , pp. 209-218
    • Benzécri, J.P.1
  • 3
    • 0002546287 scopus 로고
    • Efficient algorithms for agglomerative hierarchical clustering methods
    • DAY, H. E., and EDELSBRUNNER, H. (1984), "Efficient Algorithms for Agglomerative Hierarchical Clustering Methods," Journal of Classification, 1, 7-24.
    • (1984) Journal of Classification , vol.1 , pp. 7-24
    • Day, H.E.1    Edelsbrunner, H.2
  • 4
    • 0004408560 scopus 로고
    • K-means clustering in a low-dimensional euclidean space
    • Eds., D. Diday et al., Berlin: Springer
    • DE SOETE, G., and CARROLL, J. D. (1994), "K-means Clustering in a Low-dimensional Euclidean Space," in New Approaches in Classification and Data Analysis, Eds., D. Diday et al., Berlin: Springer, 212-219.
    • (1994) New Approaches in Classification and Data Analysis , pp. 212-219
    • De Soete, G.1    Carroll, J.D.2
  • 5
    • 0022714544 scopus 로고
    • Constructing arrangements of lines and hyperplanes with applications
    • EDELSBRUNNER, H., O'ROURKE, J. O., and SEIDEL, R. (1986), "Constructing Arrangements of Lines and Hyperplanes with Applications," SIAM Journal on Computing, 15, 341-343.
    • (1986) SIAM Journal on Computing , vol.15 , pp. 341-343
    • Edelsbrunner, H.1    O'Rourke, J.O.2    Seidel, R.3
  • 6
  • 9
    • 0001925540 scopus 로고
    • Admissible clustering procedures
    • FISHER, L., and VAN NESS, J. W. (1971), "Admissible Clustering Procedures," Biometrika, 58, 91-104.
    • (1971) Biometrika , vol.58 , pp. 91-104
    • Fisher, L.1    Van Ness, J.W.2
  • 10
    • 0004353660 scopus 로고
    • Philadelphia: Institute for Scientific Information Press
    • GARFIELD, E., (editor) (1965-1996), Science Citation Index, Philadelphia: Institute for Scientific Information Press.
    • (1965) Science Citation Index
    • Garfield, E.1
  • 13
  • 14
    • 0017402076 scopus 로고
    • An algorithm for Euclidean sum of squares classification
    • GORDON, A. D., and HENDERSON, J. T. (1977), "An Algorithm for Euclidean Sum of Squares Classification," Biometrics, 33, 355-362.
    • (1977) Biometrics , vol.33 , pp. 355-362
    • Gordon, A.D.1    Henderson, J.T.2
  • 15
    • 0014185876 scopus 로고
    • A comparison of some methods of cluster analysis
    • GOWER, J. C. (1967), "A Comparison of some Methods of Cluster Analysis," Biometrics, 23, 623-637.
    • (1967) Biometrics , vol.23 , pp. 623-637
    • Gower, J.C.1
  • 16
    • 84974054501 scopus 로고
    • The number of partitions of a set of N partitions in k dimensions induced by hyperplanes
    • HARDING, E. F. (1967), "The Number of Partitions of a Set of N Partitions in k Dimensions Induced by Hyperplanes," Proceedings of the Edinburgh Mathematical Society (Series II), 15, 285-289.
    • (1967) Proceedings of the Edinburgh Mathematical Society (Series II) , vol.15 , pp. 285-289
    • Harding, E.F.1
  • 18
    • 84970541720 scopus 로고
    • Multidimensional group analysis
    • JANCEY, R. C. (1966), "Multidimensional Group Analysis," Australian Journal of Botany, 14, 127-130.
    • (1966) Australian Journal of Botany , vol.14 , pp. 127-130
    • Jancey, R.C.1
  • 19
    • 0040586206 scopus 로고
    • Programme de classification hiérarchique par l'algorithme de la recherche en chaîne des voisins réciproques
    • JUAN, J. (1982), "Programme de classification hiérarchique par l'algorithme de la recherche en chaîne des voisins réciproques," Les Cahiers de l'Analyse des Données, VII(2), 219-225.
    • (1982) Les Cahiers de l'Analyse des Données , vol.7 , Issue.2 , pp. 219-225
    • Juan, J.1
  • 21
    • 0003126317 scopus 로고
    • A general theory of classificatory sorting strategies: I. Hierarchical systems
    • LANCE, G. N., and WILLIAMS, W. T. (1967), "A General Theory of Classificatory Sorting Strategies: I. Hierarchical Systems," Computer Journal, 9, 373-380.
    • (1967) Computer Journal , vol.9 , pp. 373-380
    • Lance, G.N.1    Williams, W.T.2
  • 23
    • 0020765701 scopus 로고
    • Expected-time complexity results for hierarchical clustering algorithms which use cluster centers
    • MURTAGH, F. (1983), "Expected-Time Complexity Results for Hierarchical Clustering Algorithms which use Cluster Centers," Information Processing Letters, 16, 237-241.
    • (1983) Information Processing Letters , vol.16 , pp. 237-241
    • Murtagh, F.1
  • 26
    • 0014810305 scopus 로고
    • Numerical methods for fuzzy clustering
    • RUSPINI, E. H. (1970), "Numerical Methods for Fuzzy Clustering," Information Sciences, 2, 319-350.
    • (1970) Information Sciences , vol.2 , pp. 319-350
    • Ruspini, E.H.1
  • 27
    • 0040586207 scopus 로고
    • On the Edwards and Cavalli-Sforza method of cluster analysis
    • SCOTT, A. J., and SYMONS, M. J. (1971), "On the Edwards and Cavalli-Sforza Method of Cluster Analysis," Biometrics, 27 217-219.
    • (1971) Biometrics , vol.27 , pp. 217-219
    • Scott, A.J.1    Symons, M.J.2
  • 30
    • 84944178665 scopus 로고
    • Hierarchical grouping to optimize an objective function
    • WARD, J. H. (1963), ̈Hierarchical Grouping to Optimize an Objective Function,̈ Journal of the American Statistical Association, 58, 236-244.
    • (1963) Journal of the American Statistical Association , vol.58 , pp. 236-244
    • Ward, J.H.1


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