메뉴 건너뛰기




Volumn 48, Issue 4, 1983, Pages 621-626

A least squares algorithm for fitting additive trees to proximity data

Author keywords

clustering; proximity data; tree structures

Indexed keywords


EID: 0001468642     PISSN: 00333123     EISSN: 18600980     Source Type: Journal    
DOI: 10.1007/BF02293884     Document Type: Article
Times cited : (418)

References (10)
  • 1
    • 84932921636 scopus 로고    scopus 로고
    • Carroll, J. D., & Pruzansky, S. Fitting of hierarchical tree structure (HTS) models, mixtures of HTS models, and hybrid models via mathematical programming and alternating least squares. Paper presented at the U.S.-Japan Seminar on Theory, Methods, and Applications of Multidimensional Scaling and Related Techniques, San Diego, August 1975.
  • 2
    • 84932921639 scopus 로고    scopus 로고
    • Furnas, G. W. The construction of random, terminally labeled, binary trees. Unpublished paper, Bell Laboratories, Murray Hill, New Jersey, 1981.


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