메뉴 건너뛰기




Volumn , Issue , 2001, Pages 126-135

Robust space transformations for distance-based operations

Author keywords

Data Mining; Distance based Operations; Outliers; Robust Estimators; Robust Statistics; Space Transformations

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; RANDOM PROCESSES; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0035789577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/502512.502532     Document Type: Conference Paper
Times cited : (35)

References (27)
  • 1
    • 0032090765 scopus 로고    scopus 로고
    • Automatic subspace clustering of high dimensional data for data mining applications
    • R,. Agrawal, J. Gehrke, D. Gunopulos and P. Raghavan. Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications. In Proc. 1998 SIGMOD, pp. 94-105.
    • (1998) Proc. 1998 SIGMOD , pp. 94-105
    • Agrawal, R.1    Gehrke, J.2    Gunopulos, D.3    Raghavan, P.4
  • 4
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H.-P. Kriegel, R. Schneider and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proc. 1990 SIGMOD, pp. 322-331.
    • (1990) Proc. 1990 SIGMOD , pp. 322-331
    • Beckmann, N.1    Kriegel, H.-P.2    Schneider, R.3    Seeger, B.4
  • 5
    • 0000608834 scopus 로고    scopus 로고
    • Density-based indexing for approximate nearest-neighbor queries
    • K. Bennett, U. Fayyad, and D. Geiger. Density-Based Indexing for Approximate Nearest-Neighbor Queries. In Proc. 1999 SIGKDD, pp. 233-243.
    • (1999) Proc. 1999 SIGKDD , pp. 233-243
    • Bennett, K.1    Fayyad, U.2    Geiger, D.3
  • 6
    • 0031162001 scopus 로고    scopus 로고
    • Distance-based indexing for high-dimensional metric spaces
    • T. Bozkaya and M. Ozsoyoglu. Distance-based indexing for high-dimensional metric spaces. In Proc 1997 SIGMOD, pp. 357-368.
    • (1997) Proc 1997 SIGMOD , pp. 357-368
    • Bozkaya, T.1    Ozsoyoglu, M.2
  • 8
    • 0000133998 scopus 로고
    • An analysis of transformations
    • Series B (Methodological)
    • G.E.P. Box and D.R. Cox. An Analysis of Transformations (with Discussion). In Journal of the Royal Statistical Society, 26, Series B (Methodological), pp. 211-252, 1964.
    • (1964) Journal of the Royal Statistical Society , vol.26 , pp. 211-252
    • Box, G.E.P.1    Cox, D.R.2
  • 10
    • 0002593186 scopus 로고    scopus 로고
    • A fast algorithm for robust principal components based on projection pursuit
    • Prat, A., editor, Heidelberg: Physica-Verlag
    • C. Croux and A. Ruiz-Gazen. A fast algorithm for robust principal components based on projection pursuit. In Prat, A., editor, Compstat: Proceedings in Computational Statistics, Heidelberg: Physica-Verlag, pp. 211-216.
    • Compstat: Proceedings in Computational Statistics , pp. 211-216
    • Croux, C.1    Ruiz-Gazen, A.2
  • 11
    • 85170282443 scopus 로고    scopus 로고
    • A density-based algorithm for discovering clusters in large spatial databases with noise
    • M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. In Proc. 1996 KDD, pp. 226-231.
    • (1996) Proc. 1996 KDD , pp. 226-231
    • Ester, M.1    Kriegel, H.-P.2    Sander, J.3    Xu, X.4
  • 13
    • 0021615874 scopus 로고
    • R-trees: A dynamic index structure for spatial searching
    • A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proc. 1984 SIGMOD, pp. 47-57.
    • (1984) Proc. 1984 SIGMOD , pp. 47-57
    • Guttman, A.1
  • 14
    • 85140527321 scopus 로고    scopus 로고
    • An efficient approach to clustering in large multimedia databases with noise
    • A. Hinneburg and D. Keim. An efficient approach to clustering in large multimedia databases with noise. In Proc. 1998 KDD, pp. 58-65.
    • (1998) Proc. 1998 KDD , pp. 58-65
    • Hinneburg, A.1    Keim, D.2
  • 16
    • 0002948319 scopus 로고    scopus 로고
    • Algorithms for mining distance-based outliers in large datasets
    • E. Knorr and R. Ng. Algorithms for Mining Distance-Based Outliers in Large Datasets. In Proc. 1998 VLDB, pp. 392-403.
    • (1998) Proc. 1998 VLDB , pp. 392-403
    • Knorr, E.1    Ng, R.2
  • 17
    • 0001337027 scopus 로고    scopus 로고
    • Projection-pursuit approach to robust dispersion matrices and principal components: Primary theory and Monte Carlo
    • G. Li and Z. Chen. Projection-pursuit approach to robust dispersion matrices and principal components: primary theory and Monte Carlo. In Journal of the American Statistical Association, 80, pp. 759-766.
    • Journal of the American Statistical Association , vol.80 , pp. 759-766
    • Li, G.1    Chen, Z.2
  • 18
    • 21144475161 scopus 로고
    • Bias robust estimation of scale
    • R. Martin and R. Zamar. Bias robust estimation of scale. In The Annals of Statistics, 21, 2, pp. 991-1017, 1993.
    • (1993) The Annals of Statistics , vol.21 , Issue.2 , pp. 991-1017
    • Martin, R.1    Zamar, R.2
  • 19
    • 0344133271 scopus 로고
    • The behaviour of the Stahel-Donoho robust multivariate estimator
    • R. Maronna and V. Yohai. The behaviour of the Stahel-Donoho robust multivariate estimator. In Journal of the American Statistical Association, 90 (429), pp. 330-341, 1995.
    • (1995) Journal of the American Statistical Association , vol.90 , Issue.429 , pp. 330-341
    • Maronna, R.1    Yohai, V.2
  • 20
    • 0003136237 scopus 로고
    • Efficient and effective clustering methods for spatial searching
    • R. Ng and J. Han. Efficient and Effective Clustering Methods for Spatial Searching, In Proc. 1994 VLDB, pp. 144-155.
    • (1994) Proc. 1994 VLDB , pp. 144-155
    • Ng, R.1    Han, J.2
  • 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. In Proc. 2000 SIGMOD, pp. 427-438.
    • (2000) Proc. 2000 SIGMOD , pp. 427-438
    • Ramaswamy, S.1    Rastogi, R.2    Shim, K.3
  • 24
    • 84993661650 scopus 로고    scopus 로고
    • Efficient user-adaptable similarity search in large multimedia databases
    • T. Seidl and H.-P. Kriegel. Efficient User-Adaptable Similarity Search in Large Multimedia Databases. In Proc. 1997 VLDB, pp. 506-515.
    • (1997) Proc. 1997 VLDB , pp. 506-515
    • Seidl, T.1    Kriegel, H.-P.2
  • 25
    • 0003926139 scopus 로고
    • Research report, 31, Fachgruppe fur Statistik, ETH, Zurich
    • W. A. Stahel. Breakdown of Covariance Estimators. Research report, 31, Fachgruppe fur Statistik, ETH, Zurich, 1981.
    • (1981) Breakdown of Covariance Estimators
    • Stahel, W.A.1
  • 26
    • 84994158589 scopus 로고    scopus 로고
    • STING: A statistical information grid approach to spatial data mining
    • W. Wang, J. Yang and R. Muntz. STING: A statistical information grid approach to spatial data mining. In Proc. 1997 VLDB, pp. 186-195.
    • (1997) Proc. 1997 VLDB , pp. 186-195
    • Wang, W.1    Yang, J.2    Muntz, R.3
  • 27
    • 84950426631 scopus 로고
    • High breakdown point estimates of regression by means of the minimization of an efficient scale
    • V. Yohai and R. Zamar. High breakdown point estimates of regression by means of the minimization of an efficient scale. In Journal of the American Statistical Association, 83 (402), pp. 406-413, 1988.
    • (1988) Journal of the American Statistical Association , vol.83 , Issue.402 , pp. 406-413
    • Yohai, V.1    Zamar, R.2


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