메뉴 건너뛰기




Volumn , Issue , 2011, Pages 410-421

Locality sensitive outlier detection: A ranking driven approach

Author keywords

[No Author keywords available]

Indexed keywords

DATA SETS; DISTANCE-BASED; EMPIRICAL STUDIES; GEOMETRIC APPROACHES; LARGE HIGH-DIMENSIONAL DATA; LIGHT WEIGHT; LOCALITY SENSITIVE HASHING; OUTLIER DETECTION; OUTLIER DISCOVERY; THEORETICAL ARGUMENTS;

EID: 79957849567     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767852     Document Type: Conference Paper
Times cited : (52)

References (47)
  • 1
    • 2442589699 scopus 로고    scopus 로고
    • On-line outlier detection and data cleaning
    • DOI 10.1016/j.compchemeng.2004.01.009, PII S0098135404000249
    • H. Liu, S. Shah, and W. Jiang, "On-line outlier detection and data cleaning," Computers & Chemical Engineering, vol. 28, no. 9, pp. 1635- 1647, 2004. (Pubitemid 38638287)
    • (2004) Computers and Chemical Engineering , vol.28 , Issue.9 , pp. 1635-1647
    • Liu, H.1    Shah, S.2    Jiang, W.3
  • 3
    • 4544379047 scopus 로고    scopus 로고
    • Mining class outliers: Concepts, algorithms and applications in CRM
    • Z. He, X. Xu, J. Huang, and S. Deng, "Mining class outliers: concepts, algorithms and applications in CRM," Expert Systems with applications, vol. 27, no. 4, pp. 681-697, 2004.
    • (2004) Expert Systems with Applications , vol.27 , Issue.4 , pp. 681-697
    • He, Z.1    Xu, X.2    Huang, J.3    Deng, S.4
  • 5
    • 0040481253 scopus 로고    scopus 로고
    • A comparison of multivariate outlier detection methods for clinical laboratory safety data
    • K. Penny and I. Jolliffe, "A comparison of multivariate outlier detection methods for clinical laboratory safety data," Journal of the Royal Statistical Society: Series D, vol. 50, no. 3, pp. 295-307, 2001.
    • (2001) Journal of the Royal Statistical Society: Series D , vol.50 , Issue.3 , pp. 295-307
    • Penny, K.1    Jolliffe, I.2
  • 6
    • 33750339350 scopus 로고    scopus 로고
    • Bioinformatics approach leads to the discovery of the TMPRSS2:ETS gene fusion in prostate cancer
    • DOI 10.1038/labinvest.3700477, PII 3700477
    • M. Rubin and A. Chinnaiyan, "Bioinformatics approach leads to the discovery of the TMPRSS2: ETS gene fusion in prostate cancer," Laboratory Investigation, vol. 86, no. 11, pp. 1099-1102, 2006. (Pubitemid 44624146)
    • (2006) Laboratory Investigation , vol.86 , Issue.11 , pp. 1099-1102
    • Rubin, M.A.1    Chinnaiyan, A.M.2
  • 7
    • 0034842930 scopus 로고    scopus 로고
    • GRR: Graphical representation of relationship errors
    • G. Abecasis, S. Cherny, W. Cookson, and L. Cardon, "GRR: graphical representation of relationship errors," Bioinformatics, vol. 17, no. 8, pp. 742-743, 2001. (Pubitemid 32851384)
    • (2001) Bioinformatics , vol.17 , Issue.8 , pp. 742-743
    • Abecasis, G.R.1    Cherny, S.S.2    Cookson, W.O.C.3    Cardon, L.R.4
  • 15
    • 77952380096 scopus 로고    scopus 로고
    • Mining distance-based outliers in near linear time with randomization and a simple pruning rule
    • S. Bay and M. Schwabacher, "Mining Distance-based Outliers in Near Linear Time with Randomization and a Simple Pruning Rule," Proc. 9th Int'l Conf. on Knowledge Discovery and Data Mining, pp. 29-38, 2003.
    • (2003) Proc. 9th Int'l Conf. on Knowledge Discovery and Data Mining , pp. 29-38
    • Bay, S.1    Schwabacher, M.2
  • 16
    • 42749086305 scopus 로고    scopus 로고
    • Fast mining of distancebased outliers in high-dimensional datasets
    • A. Ghoting, S. Parthasarathy, and M. Otey, "Fast Mining of Distancebased Outliers in High-dimensional Datasets," Data Mining and Knowl- edge Discovery, vol. 16, no. 3, pp. 349-364, 2008.
    • (2008) Data Mining and Knowl- Edge Discovery , vol.16 , Issue.3 , pp. 349-364
    • Ghoting, A.1    Parthasarathy, S.2    Otey, M.3
  • 21
    • 0039845384 scopus 로고    scopus 로고
    • Efficient algorithms for mining outliers from large data sets
    • S. Ramaswamy, R. Rastogi, and K. Shim, "Efficient algorithms for mining outliers from large data sets," ACM SIGMOD Record, vol. 29, no. 2, pp. 427-438, 2000.
    • (2000) ACM SIGMOD Record , vol.29 , Issue.2 , pp. 427-438
    • Ramaswamy, S.1    Rastogi, R.2    Shim, K.3
  • 25
  • 27
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial data mining
    • R. T. Ng and J. Han, "Efficient and effective clustering methods for spatial data mining," 20th Int. Conf. on Very Large Data Bases, 1994, pp. 144-155, 1994.
    • (1994) 20th Int. Conf. on Very Large Data Bases , pp. 144-155
    • Ng, R.T.1    Han, J.2
  • 28
    • 0034228041 scopus 로고    scopus 로고
    • Rock: A robust clustering algorithm for categorical attributes* 1
    • S. Guha, R. Rastogi, and K. Shim, "Rock: A robust clustering algorithm for categorical attributes* 1," Information Systems, vol. 25, no. 5, pp. 345-366, 2000.
    • (2000) Information Systems , vol.25 , Issue.5 , pp. 345-366
    • Guha, S.1    Rastogi, R.2    Shim, K.3
  • 29
    • 0037410488 scopus 로고    scopus 로고
    • Discovering cluster-based local outliers
    • Z. He, X. Xu, and S. Deng, "Discovering cluster-based local outliers," Pattern Recognition Letters, vol. 24, no. 9-10, pp. 1641-1650, 2003.
    • (2003) Pattern Recognition Letters , vol.24 , Issue.9-10 , pp. 1641-1650
    • He, Z.1    Xu, X.2    Deng, S.3
  • 31
    • 0034133513 scopus 로고    scopus 로고
    • Distance-based outliers: Algorithms and applications
    • E. Knorr, R. Ng, and V. Tucakov, "Distance-based outliers: algorithms and applications," The VLDB Journal, vol. 8, no. 3, pp. 237-253, 2000.
    • (2000) The VLDB Journal , vol.8 , Issue.3 , pp. 237-253
    • Knorr, E.1    Ng, R.2    Tucakov, V.3
  • 33
    • 70349971701 scopus 로고    scopus 로고
    • Efficient pruning schemes for distancebased outlier detection
    • N. H. Vu and V. Gopalkrishnan, "Efficient pruning schemes for distancebased outlier detection," ECML/PKDD (2), pp. 160-175, 2009.
    • (2009) ECML/PKDD (2) , pp. 160-175
    • Vu, N.H.1    Gopalkrishnan, V.2
  • 36
    • 37549058056 scopus 로고    scopus 로고
    • Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions
    • A. Andoni and P. Indyk, "Near-optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions," Communications of ACM, vol. 51, no. 1, pp. 117-122, 2008.
    • (2008) Communications of ACM , vol.51 , Issue.1 , pp. 117-122
    • Andoni, A.1    Indyk, P.2
  • 46
    • 0000681228 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • R. Weber, H. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," Proc. of the 24th International Conf. on Very Large Data Base, pp. 194-205, 1998.
    • (1998) Proc. of the 24th International Conf. on Very Large Data Base , pp. 194-205
    • Weber, R.1    Schek, H.2    Blott, S.3
  • 47
    • 79957813735 scopus 로고    scopus 로고
    • http://tamandua.speed.dcc.ufmg.br/, Projeto Tamandua, 2006.
    • (2006) Projeto Tamandua


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