Learning minimum volume sets

Journal of Machine Learning Research

Volumn 7, Issue , 2006, Pages 665-704

  Scott, Clayton D ^a   Nowak, Robert D ^b  

^a Rice University   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

Anomaly detection; Minimum volume sets; Sample complexity; Statistical learning theory; Uniform deviation bounds; Universal consistency

Indexed keywords

DECISION MAKING; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILITY; RISK ASSESSMENT; SET THEORY; TREES (MATHEMATICS);

ANOMALY DETECTION; MINIMUM VOLUME SETS; SAMPLE COMPLEXITY; STATISTICAL LEARNING THEORY; UNIFORM DEVIATION BOUNDS; UNIVERSAL CONSISTENCY;

LEARNING SYSTEMS;

EID: 33646350762     PISSN: 15337928     EISSN: 15337928     Source Type: Journal    
DOI: 10.1016/j.neuron.2006.05.014     Document Type: Short Survey

References (42)

1. A. Baillo, J. A. Cuesta-Albertos, and A. A. Cuevas. Convergence rates in nonparametric estimation of level sets. Stat. Prob. Letters, 53:27-35, 2001.
2. P. Bartlett, S. Boucheron, and G. Lugosi. Model selection and error estimation. Machine Learning, 48:85-113, 2002.
3. S. Ben-David and M. Lindenbaum. Learning distributions by their density levels: a paradigm for learning without a teacher. J. Comp. Sys. Sci., 55:171-182, 1997.
4. G. Blanchard, C. Schäfer, and Y. Rozenholc. Oracle bounds and exact algorithm for dyadic classification trees. In J. Shawe-Taylor and Y. Singer, editors, Learning Theory: 17th Annual Conference on Learning Theory, COLT 2004, pages 378-392. Springer-Verlag, Heidelberg, 2004.
5. O. Bousquet, S. Boucheron, and G. Lugosi. Introduction to statistical learning theory. In O. Bousquet, U.v. Luxburg, and G. Rtsch, editors, Advanced Lectures in Machine Learning, pages 169-207. Springer, 2004.
6. L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth, Belmont, CA, 1984.
7. A. Cannon, J. Howse, D. Hush, and C. Scovel. Learning with the Neyman-Pearson and min-max criteria. Technical Report LA-UR 02-2951, Los Alamos National Laboratory, 2002. URL http: //www.c3.lanl.gov/~kelly/ml/pubs/ 2002_minmax/paper.pdf.
8. A. Cohen, W. Dahmen, I. Daubechies, and R. A. DeVore. Tree approximation and optimal encoding. Applied and Computational Harmonic Analysis, 11(2):192-226, 2001.
9. T. Cover and J. Thomas. Elements of Information Theory. John Wiley and Sons, New York, 1991.
10. A. Cuevas and R. Fraiman. A plug-in approach to support estimation. Ann. Stat., 25:2300-2312, 1997.
11. A. Cuevas and A. Rodriguez-Casal. Set estimation: An overview and some recent developments. Recent advances and trends in nonparametric statistics, pages 251-264, 2003.
12. R. A. DeVore. Nonlinear approximation. Acta Numerica, 7:51-150, 1998.
13. L. Devroye, L. Györfi, and G. Lugosi. A Probabilistic Theory of Pattern Recognition. Springer, New York, 1996.
14. D. Donoho. Wedgelets: Nearly minimax estimation of edges. Ann. Stat., 27:859-897, 1999.
15. R. Durrett. Probability: Theory and Examples. Wadsworth & Brooks/Cole, Pacific Grove, CA, 1991.
16. J. Hartigan. Estimation of a convex density contour in two dimensions. J. Amer. Statist. Assoc., 82 (397):267-270, 1987.
17. X. Huo and J. Lu. A network flow approach in finding maximum likelihood estimate of high concentration regions. Computational Statistics and Data Analysis, 46(1):33-56, 2004.
18. J. Klemelä. Complexity penalized support estimation. J. Multivariate Anal., 88:274-297, 2004.
19. V. Koltchinskii. Rademacher penalties and structural risk minimization. IEEE Trans. Inform. Theory, 47:1902-1914, 2001.
20. J. Langford. Tutorial on practical prediction theory for classification. J. Machine Learning Research, 6:273-306, 2005.
21. M. Ledoux and M. Talagrand. Probability in Banach spaces. Springer-Verlag, Berlin, 1991.
22. G. Lugosi and K. Zeger. Concept learning using complexity regularization. IEEE Trans. Inform. Theory, 42(1):48-54, 1996.
23. G. Lugosi and K. Zeger. Nonparametric estimation using empirical risk minimization. IEEE Trans. Inform. Theory, 41(3):677-687, 1995.
24. D. Müller and G Sawitzki. Excess mass estimates and tests for multimodality. J. Amer. Statist. Assoc., 86(415):738-746, 1991.
25. A. Muñoz and J. M. Moguerza. Estimation of high-density regions using one-class neighbor machines. IEEE Trans. Patt. Anal. Mach. Intell., 28:476-480, 2006.
26. D. Nolan. The excess mass ellipsoid. J. Multivariate Analysis, 39:348-371, 1991.
27. J. Nunez-Garcia, Z. Kutalik, K.-H.Cho, and O. Wolkenhauer. Level sets and minimum volume sets of probability density functions. Approximate Reasoning, 34:25-47, Sept. 2003.
28. W. Polonik. Measuring mass concentrations and estimating density contour cluster-an excess mass approach. Ann. Stat., 23(3):855-881, 1995.
29. W. Polonik. Minimum volume sets and generalized quantile processes. Stochastic Processes and their Applications, 69:1-24, 1997.
30. T. W. Sager. An iterative method for estimating a multivariate mode and isopleth. J. Am. Stat. Asso., 74:329-339, 1979.
31. B. Schölkopf, J. Platt, J. Shawe-Taylor, A. Smola, and R. Williamson. Estimating the support of a high-dimensional distribution. Neural Computation, 13(7):1443-1472, 2001.
32. C. Scott and R. Nowak. Learning minimum volume sets. Technical Report ECE-05-2, UW-Madison, 2005a. URL http://www.stat.rice.edu/~cscott.
33. C. Scott and R. Nowak. A Neyman-Pearson approach to statistical learning. IEEE Trans. Inform. Theory, 51(8):3806-3819, 2005b.
34. C. Scott and R. Nowak. Minimax-optimal classification with dyadic decision trees. IEEE Trans. Inform. Theory, pages 1335-1353, April 2006.
35. I. Steinwart, D. Hush, and C. Scovel. A classification framework for anomaly detection. J. Machine Learning Research, 6:211-232, 2005.
36. A. B. Tsybakov. On nonparametric estimation of density level sets. Ann. Stat., 25:948-969, 1997.
37. V. Vapnik. Estimation of Dependencies Based on Empirical Data. Springer-Verlag, New York, 1982.
38. V. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.
39. R. Vert and J.-P. Vert. Consistency and convergence rates of one-class SVM and related algorithms. Technical Report 1414, Universit Paris-Sud, 2005.
40. G. Walther. Granulometric smoothing. Ann. Stat., 25:2273-2299, 1997.
41. R. Willett and R. Nowak. Minimax optimal level set estimation. submitted to IEEE Trans. Image Proc., 2006. URL http://www.ee.duke.edu/~willett/.
42. R. Willett and R. Nowak. Minimax optimal level set estimation. In Proc. SPIE, Wavelets XI, 31 July - 4 August, San Diego, CA, USA, 2005.