메뉴 건너뛰기




Volumn 34, Issue 6, 2012, Pages 1131-1144

Prototype-based domain description for one-class classification

Author keywords

Data set condensation; Nearest neighbor classification; Novelty detection; One class classification

Indexed keywords

CLASSIFICATION QUALITY; CONSISTENT SUBSET; CONSTANT FACTORS; DATA SETS; DOMAIN DESCRIPTION; LARGE DATASETS; LOGARITHMIC APPROXIMATION; NEAREST NEIGHBOR CLASSIFICATION; NEAREST NEIGHBOR DISTANCE; NOVELTY DETECTION; ONE-CLASS CLASSIFICATION; ONE-CLASS CLASSIFIER; OUTLIER DETECTION; REFERENCE SET; TRAINING SETS; VERY LARGE DATUM;

EID: 84860244162     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2011.204     Document Type: Article
Times cited : (30)

References (22)
  • 2
    • 0037753593 scopus 로고    scopus 로고
    • PhD dissertation Delft Univ. of Technology June
    • D.M.J. Tax, "One-Class Classification," PhD dissertation, Delft Univ. of Technology, June 2001.
    • (2001) One-Class Classification
    • Tax, D.M.J.1
  • 5
    • 21844440579 scopus 로고    scopus 로고
    • Core vector machines: Fast SVM training on very large data sets
    • I. Tsang, J. Kwok, and P.-M. Cheung, "Core Vector Machines: Fast SVM Training on Very Large Data Sets," J. Machine Learning Research, vol. 6, pp. 363-392, 2005.
    • (2005) J. Machine Learning Research , vol.6 , pp. 363-392
    • Tsang, I.1    Kwok, J.2    Cheung, P.-M.3
  • 10
    • 36048938087 scopus 로고    scopus 로고
    • Condensed nearest neighbor data domain description
    • Oct.
    • F. Angiulli, "Condensed Nearest Neighbor Data Domain Description," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 10, pp. 1746-1758, Oct. 2007.
    • (2007) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.29 , Issue.10 , pp. 1746-1758
    • Angiulli, F.1
  • 11
    • 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," Proc. Int'l Conf. Very Large Databases, pp. 392-403, 1998.
    • (1998) Proc. Int'l Conf. Very Large Databases , pp. 392-403
    • Knorr, E.1    Ng, R.2
  • 13
    • 84931162639 scopus 로고
    • The condensed nearest neighbor rule
    • May
    • P. Hart, "The Condensed Nearest Neighbor Rule," IEEE Trans. Information Theory, vol. 14, no. 3, pp. 515-516, May 1968.
    • (1968) IEEE Trans. Information Theory , vol.14 , Issue.3 , pp. 515-516
    • Hart, P.1
  • 14
    • 35348902771 scopus 로고    scopus 로고
    • Fast nearest neighbor condensation for large data sets classification
    • DOI 10.1109/TKDE.2007.190645
    • F. Angiulli, "Fast Nearest Neighbor Condensation for Large Data Sets Classification," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 11, pp. 1450-1464, Nov. 2007. (Pubitemid 47573790)
    • (2007) IEEE Transactions on Knowledge and Data Engineering , vol.19 , Issue.11 , pp. 1450-1464
    • Angiulli, F.1
  • 16
    • 0029521676 scopus 로고
    • Sample compression, learnability, and the vapnik-chervonenkis dimension
    • S. Floyd and M. Warmuth, "Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension," Machine Learning, vol. 21, no. 3, pp. 269-304, 1995.
    • (1995) Machine Learning , vol.21 , Issue.3 , pp. 269-304
    • Floyd, S.1    Warmuth, M.2
  • 17
    • 67149118905 scopus 로고    scopus 로고
    • Dolphin: An efficient algorithm for mining distance-based outliers in very large datasets
    • F. Angiulli and F. Fassetti, "Dolphin: An Efficient Algorithm for Mining Distance-Based Outliers in Very Large Datasets," ACM Trans. Knowledge Discovery from Data, vol. 3, no. 1, pp. 4:1-4:57, 2009.
    • (2009) ACM Trans. Knowledge Discovery from Data , vol.3 , Issue.1 , pp. 41-457
    • Angiulli, F.1    Fassetti, F.2
  • 21
    • 0000487102 scopus 로고    scopus 로고
    • Estimating the support of a high-dimensional distribution
    • DOI 10.1162/089976601750264965
    • B. Schölkopf, J. Platt, J. Shawe-Taylor, A. Smola, and R. Williamson, "Estimating the Support of a High-Dimensional Distribution," Neural Computation, vol. 13, no. 7, pp. 1443-1471, 2001. (Pubitemid 33595028)
    • (2001) Neural Computation , vol.13 , Issue.7 , pp. 1443-1471
    • Scholkopf, B.1    Platt, J.C.2    Shawe-Taylor, J.3    Smola, A.J.4    Williamson, R.C.5


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