메뉴 건너뛰기




Volumn 2737, Issue , 2003, Pages 234-243

On complementarity of cluster and outlier detection schemes

Author keywords

[No Author keywords available]

Indexed keywords


EID: 35248861719     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45228-7_24     Document Type: Article
Times cited : (13)

References (17)
  • 5
    • 84899149437 scopus 로고    scopus 로고
    • A Fast Computer Intrusion Detection Algorithm based on Hypothesis Testing of Command Transition Probabilities
    • W. DuMouchel, M. Schonlau: "A Fast Computer Intrusion Detection Algorithm based on Hypothesis Testing of Command Transition Probabilities", Proc.of 4th Intl. Conf. On Knowledge Discovery and Data Mining, 1998, pp. 189-193.
    • (1998) Proc.of 4th Intl. Conf. on Knowledge Discovery and Data Mining , pp. 189-193
    • Dumouchel, W.1    Schonlau, M.2
  • 8
    • 0032091595 scopus 로고    scopus 로고
    • Cure: An Efficient Clustering Algorithm for Large Databases
    • S. Guha, R. Rastogi, K. Shim: "Cure: An Efficient Clustering Algorithm for Large Databases", In Proc. of the ACM SIGMOD Conf., 1998, pp 73-84.
    • (1998) Proc. of the ACM SIGMOD Conf. , pp. 73-84
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 10
    • 0002948319 scopus 로고    scopus 로고
    • Algorithms for Mining Distance-based Outliers in Large Datasets
    • E. Knorr, R. Ng: "Algorithms for Mining Distance-based Outliers in Large Datasets", Proc. of 24th Intl. Conf. On VLDB, 1998, pp 392-403.
    • (1998) Proc. of 24th Intl. Conf. on VLDB , pp. 392-403
    • Knorr, E.1    Ng, R.2
  • 11
    • 0012905555 scopus 로고    scopus 로고
    • Finding Intensional Knowledge of Distance-based Outliers
    • E. Knorr, R. Ng: "Finding Intensional Knowledge of Distance-based Outliers", Proc. of 25th Intl. Conf. On VLDB, 1999, pp 211-222.
    • (1999) Proc. of 25th Intl. Conf. on VLDB , pp. 211-222
    • Knorr, E.1    Ng, R.2
  • 12
  • 13
    • 0039845384 scopus 로고    scopus 로고
    • Efficient Algorithms for Mining Outliers from Large Data Sets
    • S. Ramaswamy, R. Rastogi, S. Kyuseok: "Efficient Algorithms for Mining Outliers from Large Data Sets", Proc. of ACM SIGMOD Conf., 2000, pp 427-438.
    • (2000) Proc. of ACM SIGMOD Conf. , pp. 427-438
    • Ramaswamy, S.1    Rastogi, R.2    Kyuseok, S.3
  • 16
    • 70449702302 scopus 로고    scopus 로고
    • A Robust Outlier Detection Scheme in Large Data Sets
    • J. Tang, Z. Chen, A. Fu, D. Cheung, "A Robust Outlier Detection Scheme in Large Data Sets", PAKDD, 2002.
    • (2002) PAKDD
    • Tang, J.1    Chen, Z.2    Fu, A.3    Cheung, D.4
  • 17
    • 0030157145 scopus 로고    scopus 로고
    • BIRCH: An Efficient Data Clustering Method for Very Large Databases
    • T. Zhang, R. Ramakrishnan, M. Linvy: "BIRCH: An Efficient Data Clustering Method for Very Large Databases", Proc. of ACM SIGMOD Intl. Conf., , 1996, pp 103-114.
    • (1996) Proc. of ACM SIGMOD Intl. Conf. , pp. 103-114
    • Zhang, T.1    Ramakrishnan, R.2    Linvy, M.3


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