
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
F. Angiulli, "PrototypeBased Domain Description for OneClass Classification," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 34, no. 6, pp. 11311144, June, 2012.  
BibTex  x  
@article{ 10.1109/TPAMI.2011.204, author = {F. Angiulli}, title = {PrototypeBased Domain Description for OneClass Classification}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {34}, number = {6}, issn = {01628828}, year = {2012}, pages = {11311144}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2011.204}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  PrototypeBased Domain Description for OneClass Classification IS  6 SN  01628828 SP1131 EP1144 EPD  11311144 A1  F. Angiulli, PY  2012 KW  pattern classification KW  learning (artificial intelligence) KW  oneclass classification methods KW  prototypebased domain description rule KW  nearest neighborbased classifier KW  PDD classifier KW  NNDD classifier KW  statistical tests KW  outlier detection KW  logarithmic approximation factor algorithm KW  CPDD algorithm KW  CNNDD classifier KW  Prototypes KW  Handheld computers KW  Classification algorithms KW  Approximation algorithms KW  Approximation methods KW  Training KW  Measurement KW  data set condensation. KW  Oneclass classification KW  novelty detection KW  nearest neighbor classification VL  34 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] F. Angiulli, "PrototypeBased Domain Description," Proc. European Conf. Artificial Intelligence, pp. 107111, 2008.
[2] D.M.J. Tax, "OneClass Classification," PhD dissertation, Delft Univ. of Tech nology, June 2001.
[3] B. Schölkopf, C. Burges, and V. Vapnik, "Extracting Support Data for a Given Task," Proc. Int'l Conf. Knowledge Discovery & Data Mining, pp. 251256, 1995.
[4] D. Tax and R. Duin, "Data Domain Description Using Support Vectors," Proc. European Symp. Artificial Neural Networks, pp. 251256, Apr. 1999.
[5] 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. 363392, 2005.
[6] I. Tsang, A. Kocsor, and J. Kwok, "Simpler Core Vector Machines with Enclosing Balls," Proc. Int'l Conf. Machine Learning, pp. 911918, 2007.
[7] A. Ypma and R. Duin, "Support Objects for Domain Approximation," Proc. Int'l Conf. Artificial Neural Networks, 1998.
[8] D. Tax and R. Duin, "Data Descriptions in Subspaces," Proc. Int'l Conf. Pattern Recognition, pp. 672675, 2000.
[9] M. Breunig, H. Kriegel, R. Ng, and J. Sander, "LOF: Identifying DensityBased Local Outliers," Proc. ACM Int'l Conf. Management of Data, 2000.
[10] F. Angiulli, "Condensed Nearest Neighbor Data Domain Description," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 29, no. 10, pp. 17461758, Oct. 2007.
[11] E. Knorr and R. Ng, "Algorithms for Mining DistanceBased Outliers in Large Datasets," Proc. Int'l Conf. Very Large Databases, pp. 392403, 1998.
[12] V. Barnett and T. Lewis, Outliers in Statistical Data. John Wiley & Sons, 1994.
[13] P. Hart, "The Condensed Nearest Neighbor Rule," IEEE Trans. Information Theory, vol. 14, no. 3, pp. 515516, May 1968.
[14] F. Angiulli, "Fast Nearest Neighbor Condensation for Large Data Sets Classification," IEEE Trans. Knowledge and Data Eng., vol. 19, no. 11, pp. 14501464, Nov. 2007.
[15] N. Littlestone and M. Warmuth, "Relating Data Compression and Learnability," technical report, Univ. of California, Santa Cruz, 1986.
[16] S. Floyd and M. Warmuth, "Sample Compression, Learnability, and the VapnikChervonenkis Dimension," Machine Learning, vol. 21, no. 3, pp. 269304, 1995.
[17] F. Angiulli and F. Fassetti, "Dolphin: An Efficient Algorithm for Mining DistanceBased Outliers in Very Large Datasets," ACM Trans. Knowledge Discovery from Data, vol. 3, no. 1,pp. 4:14:57, 2009.
[18] G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. MarchettiSpaccamela, and M. Protasi, Complexity and Approximation. SpringerVerlag, 1999.
[19] M. Bellare, S. Goldwasser, C. Lund, and A. Russeli, "Efficient Probabilistically Checkable Proofs and Applications to Approximations," Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 294304, 1993.
[20] C.B.D.J. Newman, S. Hettich, and C. Merz, "UCI Repository of Machine Learning Databases," http://www.ics.uci.edu/~mlearnMLRepository.html , 1998.
[21] B. Schölkopf, J. Platt, J. ShaweTaylor, A. Smola, and R. Williamson, "Estimating the Support of a HighDimensional Distribution," Neural Computation, vol. 13, no. 7, pp. 14431471, 2001.
[22] C.C. Chang and C.J. Lin, LIBSVM: A Library for Support Vector Machines, aoftware http://www.csie.ntu.edu.tw/~cjlinlibsvm, 2001.