메뉴 건너뛰기




Volumn 2, Issue 1-4, 2005, Pages 145-154

Shape-based clustering of enterprise CAD databases

Author keywords

Clustering; Knowledge discovery; Similarity search; Visual data mining

Indexed keywords

CLUSTERING; CLUSTERING TECHNIQUES; DATA SETS; DISSIMILARITY FUNCTION; DOMAIN KNOWLEDGE; EFFICIENT SYSTEMS; ENGINEERING DATA; KNOWLEDGE DISCOVERY; KNOWLEDGE DISCOVERY AND DATA MININGS; NUMBER AND SIZE; PRIMARY DATA; SEED MODEL; SHAPE BASED; SHAPE SIMILARITY; SIMILAR MODELS; SIMILARITY SEARCH; SINGLE SCAN; SPATIAL DATABASE; SPATIAL DOMAINS; STATISTICAL DATAS; VISUAL DATA MINING;

EID: 33744789060     PISSN: 16864360     EISSN: None     Source Type: Journal    
DOI: 10.1080/16864360.2005.10738362     Document Type: Article
Times cited : (12)

References (12)
  • 2
    • 0002755657 scopus 로고    scopus 로고
    • Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
    • Barequet, G., Har-Peled, S., :Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions. J. Algorithms 38 (1):91–109 (2001).
    • (2001) J. Algorithms , vol.38 , Issue.1 , pp. 91-109
    • Barequet, G.1    Har-Peled, S.2


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