메뉴 건너뛰기




Volumn , Issue , 2008, Pages 420-426

Application of two partial search methods to Euclidean distance-based outlier detection

Author keywords

Distance based outlier detection; High dimensional data sets; Indexing; Nearest neighbor search

Indexed keywords

DATA ITEMS; DISTANCE CALCULATIONS; DISTANCE-BASED OUTLIER DETECTION; EUCLIDEAN DISTANCES; EXECUTION TIME; HIGH-DIMENSIONAL DATA SETS; INDEXING; NEAREST NEIGHBOR SEARCH; NEAREST NEIGHBORS; NUMBER OF DATUM; PARTIAL SEARCHES; SEARCH STRUCTURES;

EID: 62649169726     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (1)

References (17)
  • 2
    • 0002948319 scopus 로고    scopus 로고
    • Algorithms for mining distance-based outliers in large datasets
    • E.M. Knorr and R.T. Ng. "Algorithms for mining distance-based outliers in large datasets". In Proceedings of the VLDB Conference, pages 392-403, 1998.
    • (1998) In Proceedings of the VLDB Conference , pp. 392-403
    • Knorr, E.M.1    Ng, R.T.2
  • 4
    • 84857121791 scopus 로고    scopus 로고
    • th VLDB Conference, pages 221-222, 1999.
    • th VLDB Conference, pages 221-222, 1999.
  • 5
    • 0034133513 scopus 로고    scopus 로고
    • Distance-based outliers: Algorithms and applications
    • E.M. Knorr, R.T. Ng and V. Tucakov. "Distance-based outliers: algorithms and applications". VLDB Journal: Very Large Databases, 8 (3-4) : 237-253, 2000.
    • (2000) VLDB Journal: Very Large Databases , vol.8 , Issue.3-4 , pp. 237-253
    • Knorr, E.M.1    Ng, R.T.2    Tucakov, V.3
  • 7
    • 77952380096 scopus 로고    scopus 로고
    • S.D. Bay and M. Schwabacher. Mining distance-based outliers in near linear time with randomization and a simple pruning rule. KDD'03, pages 29-38, 2003.
    • S.D. Bay and M. Schwabacher. "Mining distance-based outliers in near linear time with randomization and a simple pruning rule". KDD'03, pages 29-38, 2003.
  • 11
    • 0027658829 scopus 로고
    • A fast mean-distance-ordered partial codebook search algorithm for image vector quantization
    • S. W. Ra and J.K. Kim. "A fast mean-distance-ordered partial codebook search algorithm for image vector quantization". IEEE-CS, 40(9), 576-579, 1993.
    • (1993) IEEE-CS , vol.40 , Issue.9 , pp. 576-579
    • Ra, S.W.1    Kim, J.K.2
  • 12
    • 0035519014 scopus 로고    scopus 로고
    • Practical methods for speeding-up the pairwise nearest neighbor method
    • O. Virmajoki, P. Franti and T. Kaukoranta. "Practical methods for speeding-up the pairwise nearest neighbor method". Optical Engineering, 40(11), 2495-2504, 2001.
    • (2001) Optical Engineering , vol.40 , Issue.11 , pp. 2495-2504
    • Virmajoki, O.1    Franti, P.2    Kaukoranta, T.3
  • 14
    • 0003704318 scopus 로고    scopus 로고
    • Irvine, CA: University of California, Department of Information and Computer Science
    • S. Hettich and S.D Bay. The UCI KDD archive. [http://kdd.ics.uci.edu/]. Irvine, CA: University of California, Department of Information and Computer Science, 1999.
    • (1999) The UCI KDD archive
    • Hettich, S.1    Bay, S.D.2
  • 16
    • 62649133689 scopus 로고    scopus 로고
    • A. Ghoting, S. Parthasarathy and M.E. Otey. Fast mining of distance-based outliers in high-dimensional datasets. SDM'06, pages 608-612, 2006.
    • A. Ghoting, S. Parthasarathy and M.E. Otey. "Fast mining of distance-based outliers in high-dimensional datasets". SDM'06, pages 608-612, 2006.
  • 17
    • 38549108906 scopus 로고    scopus 로고
    • K. Niu, C. Huang, S. Zhang and J. Chen. ODDC:outlier detection using distance distribution clustering. HPDMA'07 in conjunction with PAKDDd 07, pages 332-343, 2007.
    • K. Niu, C. Huang, S. Zhang and J. Chen. "ODDC:outlier detection using distance distribution clustering". HPDMA'07 in conjunction with PAKDDd 07, pages 332-343, 2007.


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