메뉴 건너뛰기




Volumn 34, Issue 1, 2009, Pages

Detecting outlying properties of exceptional objects

Author keywords

Data mining; Knowledge discovery; Outlier characterization

Indexed keywords

APRIORI; ATTRIBUTE VALUES; COMPUTATIONAL TASK; DATA POPULATION; DATA SETS; EFFICIENT ALGORITHM; EXPERIMENTAL EVIDENCE; GLOBAL PROPERTIES; KNOWLEDGE DISCOVERY; LOCAL PROPERTY; OUTLIER CHARACTERIZATION; SEARCH SPACES;

EID: 67649205496     PISSN: 03625915     EISSN: 15574644     Source Type: Journal    
DOI: 10.1145/1508857.1508864     Document Type: Article
Times cited : (72)

References (39)
  • 4
    • 14644423912 scopus 로고    scopus 로고
    • Outlier mining in large high-dimensional datasets
    • ANGIULLI, F. AND PIZZUTI, C. 2005. Outlier mining in large high-dimensional datasets. IEEE Trans. Knowl. Data Eng. 17, 2, 203-215.
    • (2005) IEEE Trans. Knowl. Data Eng , vol.17 , Issue.2 , pp. 203-215
    • ANGIULLI, F.1    PIZZUTI, C.2
  • 9
    • 0344811122 scopus 로고    scopus 로고
    • An overview of data warehousing and olap technology
    • CHAUDHURI, S. AND DAYAL, U. 1997. An overview of data warehousing and olap technology. SIGMOD Rec. 26, 1, 65-74.
    • (1997) SIGMOD Rec , vol.26 , Issue.1 , pp. 65-74
    • CHAUDHURI, S.1    DAYAL, U.2
  • 10
    • 30244551622 scopus 로고
    • The complexity of selecting maximal solutions
    • CHEN, Z. AND TODA, S. 1995. The complexity of selecting maximal solutions. Inf. Comput. 1192, 2, 231-239.
    • (1995) Inf. Comput , vol.1192 , Issue.2 , pp. 231-239
    • CHEN, Z.1    TODA, S.2
  • 11
    • 67649218077 scopus 로고    scopus 로고
    • CODD, E., CODD, S., AND SALLEY, C. 1993. Providing OLAP (on-line analytical processing) to user-analysts: An it mandate. Tech. rep., Codd & Date, Inc.
    • CODD, E., CODD, S., AND SALLEY, C. 1993. Providing OLAP (on-line analytical processing) to user-analysts: An it mandate. Tech. rep., Codd & Date, Inc.
  • 13
    • 2542476271 scopus 로고    scopus 로고
    • A study of the average effect of the 3'apob-vntr polymorphism on lipidemic parameters could explain why the short alleles (< 35 repeats) are rare in centenarians
    • GARASTO, S., BERARDELLI, M., RANGO, F. D., MARI, V., FERACO, E., AND BENEDICTIS, G. D. 2004. A study of the average effect of the 3'apob-vntr polymorphism on lipidemic parameters could explain why the short alleles (< 35 repeats) are rare in centenarians. BMC Medical Genetics 5, 3.
    • (2004) BMC Medical Genetics , vol.5 , pp. 3
    • GARASTO, S.1    BERARDELLI, M.2    RANGO, F.D.3    MARI, V.4    FERACO, E.5    BENEDICTIS, G.D.6
  • 15
    • 0012057129 scopus 로고
    • Measurement of inequality of incomes
    • GINI, C. 1921. Measurement of inequality of incomes. The Economic J. 31, 124-126.
    • (1921) The Economic J , vol.31 , pp. 124-126
    • GINI, C.1
  • 17
    • 7544223741 scopus 로고    scopus 로고
    • A survey of outlier detection methodologies
    • HODGE, V. AND AUSTIN, J. 2004. A survey of outlier detection methodologies. Artif Intell. Rev. 22, 2, 85-126.
    • (2004) Artif Intell. Rev , vol.22 , Issue.2 , pp. 85-126
    • HODGE, V.1    AUSTIN, J.2
  • 18
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Plenum, New York
    • KARP, R. 1972. Reducibility among combinatorial problems. In Complexity of Computer Computations. Plenum, New York, 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • KARP, R.1
  • 22
    • 0034133513 scopus 로고    scopus 로고
    • Distance-based outlier: Algorithms and applications
    • KNORR, E., NG, R., AND TUCAKOV, V. 2000. Distance-based outlier: Algorithms and applications. VLDB J. 8, 3-4, 237-253.
    • (2000) VLDB J , vol.8 , Issue.3-4 , pp. 237-253
    • KNORR, E.1    NG, R.2    TUCAKOV, V.3
  • 23
    • 0003294665 scopus 로고    scopus 로고
    • The Art of Computer Programming
    • 2nd ed. Addison-Wesley
    • KNUTH, D. 1998. The Art of Computer Programming, Volume 3: Sorting and Searching, 2nd ed. Addison-Wesley.
    • (1998) Sorting and Searching , vol.3
    • KNUTH, D.1
  • 24
    • 0024020188 scopus 로고
    • The complexity of optimization problems
    • KRENTEL, M. 1988. The complexity of optimization problems. J. Comput. Syst. Sci. 36, 3, 490-509.
    • (1988) J. Comput. Syst. Sci , vol.36 , Issue.3 , pp. 490-509
    • KRENTEL, M.1
  • 32
    • 0028408927 scopus 로고
    • A taxonomy of complexity classes of functions
    • SELMAN, A. 1994. A taxonomy of complexity classes of functions. J. Comput. Syst. Sci. 48, 2, 357-381.
    • (1994) J. Comput. Syst. Sci , vol.48 , Issue.2 , pp. 357-381
    • SELMAN, A.1
  • 34
    • 33746820611 scopus 로고    scopus 로고
    • Data mining methods for discovering interesting exceptions from an unsuper-vised table
    • SUZUKI, E. 2006. Data mining methods for discovering interesting exceptions from an unsuper-vised table. J. Universal Comput. Sci. 12, 6, 627-653.
    • (2006) J. Universal Comput. Sci , vol.12 , Issue.6 , pp. 627-653
    • SUZUKI, E.1
  • 37
  • 38
    • 33749316703 scopus 로고    scopus 로고
    • Detecting outlying subspaces for high-dimensional data: The new task, algorithms, and performance
    • ZHANG, J. AND WANG, H. 2006. Detecting outlying subspaces for high-dimensional data: The new task, algorithms, and performance. Knowl. Inf. Syst. 10, 3, 333-355.
    • (2006) Knowl. Inf. Syst , vol.10 , Issue.3 , pp. 333-355
    • ZHANG, J.1    WANG, H.2


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