메뉴 건너뛰기




Volumn , Issue , 2004, Pages 43-50

Efficient density-based clustering of complex objects

Author keywords

[No Author keywords available]

Indexed keywords

CAD DRAWINGS; CLUSTERING ALGORITHM; DATA SETS; QUERY PROCESSING;

EID: 19544381705     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10082     Document Type: Conference Paper
Times cited : (29)

References (14)
  • 1
  • 2
    • 85006228721 scopus 로고    scopus 로고
    • Efficient similarity search in sequence databases
    • Agrawal R., Faloutsos C., Swami A. Efficient Similarity Search in Sequence Databases. FODO'93, pp. 69-84.
    • FODO'93 , pp. 69-84
    • Agrawal, R.1    Faloutsos, C.2    Swami, A.3
  • 4
    • 0033886624 scopus 로고    scopus 로고
    • Efficiently supporting multiple similarity queries for mining in metric databases
    • Braunmüller B., Ester M., Kriegel H.-P., Sander J.: Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases. ICDE'00, pp. 256-267.
    • ICDE'00 , pp. 256-267
    • Braunmüller, B.1    Ester, M.2    Kriegel, H.-P.3    Sander, J.4
  • 6
    • 84993661659 scopus 로고    scopus 로고
    • M-tree: An efficient access method for similarity search in metric spaces
    • Ciaccia P., Patella M., Zezula P.: M-tree: An Efficient Access Method for Similarity Search in Metric Spaces.VLDB'97, pp. 426-435.
    • VLDB'97 , pp. 426-435
    • Ciaccia, P.1    Patella, M.2    Zezula, P.3
  • 7
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial data-bases with noise
    • Ester M., Kriegel H.-P., Sander J., Xu X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Data-bases with Noise. KDD'96, pp. 226-231.
    • KDD'96 , pp. 226-231
    • Ester, M.1    Kriegel, H.-P.2    Sander, J.3    Xu, X.4
  • 8
    • 84943427674 scopus 로고    scopus 로고
    • Indexing high-dimensional data for content-based retrieval in large databases
    • Fonseca M. J., Jorge J. A.: Indexing High-Dimensional Data for Content-Based Retrieval in Large Databases. DASFAA'03, pp. 267-274.
    • DASFAA'03 , pp. 267-274
    • Fonseca, M.J.1    Jorge, J.A.2
  • 9
    • 0032083561 scopus 로고    scopus 로고
    • Multidimensional access methods
    • Gaede V., Günther O.: Multidimensional Access Methods. ACM Computing Surveys 30(2), pp. 170-231, 1998.
    • (1998) ACM Computing Surveys , vol.30 , Issue.2 , pp. 170-231
    • Gaede, V.1    Günther, O.2
  • 10
    • 0021615874 scopus 로고    scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • Guttman A.: R-trees: A Dynamic Index Structure for Spatial Searching. SIGMOD'84, pp. 47-57.
    • SIGMOD'84 , pp. 47-57
    • Guttman, A.1
  • 14
    • 35248813464 scopus 로고    scopus 로고
    • Similarity search in structured data
    • Kriegel H.-P., S. Schönauer S.: Similarity search in structured data. DAWAK'03, pp. 309-319.
    • DAWAK'03 , pp. 309-319
    • Kriegel, H.-P.1    Schönauer, S.2


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