메뉴 건너뛰기




Volumn 6271 LNCS, Issue PART 1, 2010, Pages 329-340

A distributed approach to detect outliers in very large data sets

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DISTANCE-BASED; DISTRIBUTED APPROACHES; DISTRIBUTED DATA; EXCELLENT PERFORMANCE; OUTLIER DETECTION; PARALLEL COMPUTATION; PARALLEL TASK; RUNTIMES; SOLVING SET; VERY LARGE DATUM; DISTANCE BASED OUTLIER DETECTION;

EID: 78349238131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15277-1_32     Document Type: Conference Paper
Times cited : (16)

References (14)
  • 1
    • 33244494218 scopus 로고    scopus 로고
    • Distance-based detection and prediction of outliers
    • Angiulli, F., Basta, S., Pizzuti, C.: Distance-based detection and prediction of outliers. TKDE 18(2), 145-160 (2006)
    • (2006) TKDE , vol.18 , Issue.2 , pp. 145-160
    • Angiulli, F.1    Basta, S.2    Pizzuti, C.3
  • 2
    • 67149118905 scopus 로고    scopus 로고
    • Dolphin: An efficient algorithm for mining distance-based outliers in very large datasets
    • Angiulli, F., Fassetti, F.: Dolphin: An efficient algorithm for mining distance-based outliers in very large datasets. TKDD 3(1) (2009)
    • (2009) TKDD , vol.3 , Issue.1
    • Angiulli, F.1    Fassetti, F.2
  • 3
    • 14644423912 scopus 로고    scopus 로고
    • Outlier mining in large high-dimensional data sets
    • Angiulli, F., Pizzuti, C.: Outlier mining in large high-dimensional data sets. TKDE 2(17), 203-215 (2005)
    • (2005) TKDE , vol.2 , Issue.17 , pp. 203-215
    • Angiulli, F.1    Pizzuti, C.2
  • 5
    • 77952380096 scopus 로고    scopus 로고
    • Mining distance-based outliers in near linear time with randomization and a simple pruning rule
    • Bay, S.D., Schwabacher, M.: Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In: Proc. KDD (2003)
    • Proc. KDD (2003)
    • Bay, S.D.1    Schwabacher, M.2
  • 6
    • 42749086305 scopus 로고    scopus 로고
    • Fast mining of distance-based outliers in high-dimensional datasets
    • Ghoting, A., Parthasarathy, S., Otey, M.E.: Fast mining of distance-based outliers in high-dimensional datasets. Data Min. Knowl. Discov. 16(3), 349-364 (2008)
    • (2008) Data Min. Knowl. Discov. , vol.16 , Issue.3 , pp. 349-364
    • Ghoting, A.1    Parthasarathy, S.2    Otey, M.E.3
  • 10
    • 78349261006 scopus 로고    scopus 로고
    • A fast outlier detection strategy for distributed high-dimensional data sets with mixed attributes
    • November 11, published online
    • Koufakou, A., Georgiopoulos, M.: A fast outlier detection strategy for distributed high-dimensional data sets with mixed attributes. Data Mining and Knowledge Discovery (November 11, 2009) (published online)
    • (2009) Data Mining and Knowledge Discovery
    • Koufakou, A.1    Georgiopoulos, M.2
  • 11
    • 34548570503 scopus 로고    scopus 로고
    • Parallel algorithms for distance-based and density-based outliers
    • Lozano, E., Acuña, E.: Parallel algorithms for distance-based and density-based outliers. In: ICDM, pp. 729-732 (2005)
    • (2005) ICDM , pp. 729-732
    • Lozano, E.1    Acuña, E.2
  • 12
    • 33646553013 scopus 로고    scopus 로고
    • Fast distributed outlier detection in mixed-attribute data sets
    • Otey, M.E., Ghoting, A., Parthasarathy, S.: Fast distributed outlier detection in mixed-attribute data sets. Data Min. Knowl. Discov. 12(2-3), 203-228 (2006)
    • (2006) Data Min. Knowl. Discov. , vol.12 , Issue.2-3 , pp. 203-228
    • Otey, M.E.1    Ghoting, A.2    Parthasarathy, S.3
  • 14
    • 33749567862 scopus 로고    scopus 로고
    • Mining distance-based outliers from large databases in any metric space
    • Tao, Y., Xiao, X., Zhou, S.: Mining distance-based outliers from large databases in any metric space. In: KDD, pp. 394-403 (2006)
    • (2006) KDD , pp. 394-403
    • Tao, Y.1    Xiao, X.2    Zhou, S.3


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