메뉴 건너뛰기




Volumn 14, Issue 2, 1988, Pages 153-162

An Algorithm for Multidimensional Data Clustering

Author keywords

Clustering; divide and conquer strategy; divisive algorithm; k d tree; partition; quantization

Indexed keywords

OPTIMIZATION;

EID: 0024032487     PISSN: 00983500     EISSN: 15577295     Source Type: Journal    
DOI: 10.1145/45054.45056     Document Type: Article
Times cited : (80)

References (13)
  • 1
    • 0018999905 scopus 로고
    • Multidimensional divide-and-conquer
    • Apr.
    • Bentley, J. L. Multidimensional divide-and-conquer. Commun. ACM 23, 4 (Apr. 1980), 214–229.
    • (1980) Commun. ACM , vol.23 , Issue.4 , pp. 214-229
    • Bentley, J.L.1
  • 2
    • 0018702060 scopus 로고
    • Data structure for range searching
    • Dec.
    • Bentley, J. L., and Frieman, J. H. Data structure for range searching. ACM Comput. Surv. 11, 4 (Dec. 1979), 397–409.
    • (1979) ACM Comput. Surv. , vol.11 , Issue.4 , pp. 397-409
    • Bentley, J.L.1    Frieman, J.H.2
  • 4
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • Sept.
    • Frieman, J. H., Bentley, J. L., and Finkel, R. A. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 3 (Sept. 1977), 209–226.
    • (1977) ACM Trans. Math. Softw. , vol.3 , Issue.3 , pp. 209-226
    • Frieman, J.H.1    Bentley, J.L.2    Finkel, R.A.3
  • 7
    • 0020153694 scopus 로고
    • Color image quantization for frame buffer display
    • July
    • Heckbert, P. Color image quantization for frame buffer display. ACM Trans. Comput. Gr. 16, 3 (July 1982), 297–307.
    • (1982) ACM Trans. Comput. Gr. , vol.16 , Issue.3 , pp. 297-307
    • Heckbert, P.1
  • 8
    • 0001815269 scopus 로고
    • Construction optimal binary decision trees is NP-complete
    • May
    • Hyafil, L., and Rivest, R. L. Construction optimal binary decision trees is NP-complete. Inf. Process. Lett. 5 (May 1976), 15–17.
    • (1976) Inf. Process. Lett. , vol.5 , pp. 15-17
    • Hyafil, L.1    Rivest, R.L.2
  • 10
    • 0021202650 scopus 로고
    • K-means-type algorithms: A generalized convergence theorem and characterization of local optimality
    • Selim, S. Z., and Ismail, M. A. K-means-type algorithms: A generalized convergence theorem and characterization of local optimality. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-6, 1 (1984), 81–87.
    • (1984) IEEE Trans. Pattern Anal. Mach. Intell. , vol.PAMI-6 , Issue.1 , pp. 81-87
    • Selim, S.Z.1    Ismail, M.A.2


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