메뉴 건너뛰기




Volumn 6086 LNAI, Issue , 2010, Pages 60-69

TI-DBSCAN: Clustering with DBSCAN by means of the triangle inequality

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING DATA; DATA MINING TASKS; DATA POINTS; DENSITY-BASED ALGORITHM; HIGH DIMENSIONAL DATA; HIGH QUALITY; NEIGHBORHOOD SEARCH; SPATIAL ACCESS METHODS; SPATIAL INDICES; SPEED-UPS; THREE ORDERS OF MAGNITUDE; TRIANGLE INEQUALITY;

EID: 79956257766     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13529-3_8     Document Type: Conference Paper
Times cited : (55)

References (10)
  • 1
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • Atlantic City
    • Beckmann, N., Kriegel, H.P.: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. In: Proc. of ACM SIGMOD, Atlantic City, pp. 322-331 (1990)
    • (1990) Proc. of ACM SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.P.2
  • 2
    • 1942485278 scopus 로고    scopus 로고
    • Using the triangle inequality to accelerate k-means
    • Washington
    • Elkan, C.: Using the Triangle Inequality to Accelerate k-Means. In: Proc. of ICML 2003, Washington, pp. 147-153 (2003)
    • (2003) Proc. of ICML 2003 , pp. 147-153
    • Elkan, C.1
  • 3
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial database with noise
    • Portland
    • Ester, M., Kriegel, H.P., Sander, J., Xu, X.: A Density-Based Algorithm for Discovering Clusters in Large Spatial Database with Noise. In: Proc. of KDD 1996, Portland, pp. 226- 231 (1996)
    • (1996) Proc. of KDD 1996 , pp. 226-231
    • Ester, M.1    Kriegel, H.P.2    Sander, J.3    Xu, X.4
  • 5
    • 79956290110 scopus 로고    scopus 로고
    • TI-DBSCAN: Clustering with DBSCAN by means of the triangle inequality
    • Warsaw University of Technology (April)
    • Kryszkiewicz, M., Lasek, P.: TI-DBSCAN: Clustering with DBSCAN by Means of the Triangle Inequality, ICS Research Report, Warsaw University of Technology (April 2010)
    • (2010) ICS Research Report
    • Kryszkiewicz, M.1    Lasek, P.2
  • 7
    • 1942419246 scopus 로고    scopus 로고
    • The anchors hierarchy: Using the triangle inequality to survive high dimensional data
    • Stanford
    • Moore, A.W.: The Anchors Hierarchy: Using the Triangle Inequality to Survive High Dimensional Data. In: Proc. of UAI, Stanford, pp. 397-405 (2000)
    • (2000) Proc. of UAI , pp. 397-405
    • Moore, A.W.1
  • 10
    • 79956281543 scopus 로고    scopus 로고
    • http://kdd.ics.uci.edu/databases/kddcup98/kddcup98.html


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