Interval Data Classification under Partial Information: A Chance-Constraint Approach

  • Sahely Bhadra
  • J. Saketha Nath
  • Aharon Ben-Tal
  • Chiranjib Bhattacharyya
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5476)

Abstract

This paper presents a Chance-constraint Programming approach for constructing maximum-margin classifiers which are robust to interval-valued uncertainty in training examples. The methodology ensures that uncertain examples are classified correctly with high probability by employing chance-constraints. The main contribution of the paper is to pose the resultant optimization problem as a Second Order Cone Program by using large deviation inequalities, due to Bernstein. Apart from support and mean of the uncertain examples these Bernstein based relaxations make no further assumptions on the underlying uncertainty. Classifiers built using the proposed approach are less conservative, yield higher margins and hence are expected to generalize better than existing methods. Experimental results on synthetic and real-world datasets show that the proposed classifiers are better equipped to handle interval-valued uncertainty than state-of-the-art.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Natsoulis, G., Ghaoui, L.E., Lanckriet, G.R.G., Tolley, A.M., Leroy, F., Dunlea, S., Eynon, B.P., Pearson, C.I., Tugendreich, S., Jarnagin, K.: Classification of a Large Microarray Data Set: Algorithm Comparison and Analysis of Drug Signatures. Genome Research 15, 724–736 (2005)CrossRefGoogle Scholar
  2. 2.
    Silva, F.C.D., de A.T. de Carvalho, F., de Souza, R.M.C.R., Silva, J.Q.: A Modal Symbolic Classifier for Interval Data. In: King, I., Wang, J., Chan, L.-W., Wang, D. (eds.) ICONIP 2006. LNCS, vol. 4233, pp. 50–59. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  3. 3.
    Ghaoui, L.E., Lanckriet, G.R.G., Natsoulis, G.: Robust Classification with Interval Data. Technical Report UCB/CSD-03-1279, Computer Science Division, University of California, Berkeley (2003)Google Scholar
  4. 4.
    Nemirovski, A., Shapiro, A.: Convex Approximations of Chance Constrained Programs. SIAM Journal of Optimization 17(4), 969–996 (2006)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Sturm, J.F.: Using SeDuMi 1.02, A MATLAB Toolbox for Optimization over Symmetric Cones. Optimization Methods and Software 11–12, 625–653 (1999)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Vapnik, V.: Statistical Learning Theory. John Wiley and Sons, New York (1998)MATHGoogle Scholar
  7. 7.
    Ben-Tal, A., Nemirovski, A.: Selected Topics in Robust Convex Optimization. Mathematical Programming 112(1) (2007)Google Scholar
  8. 8.
    Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)CrossRefMATHGoogle Scholar
  9. 9.
    Lanckriet, G.R., Ghaoui, L.E., Bhattacharyya, C., Jordan, M.I.: A Robust Minimax Approach to Classification. JMLR 3, 555–582 (2003)MathSciNetMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Sahely Bhadra
    • 1
  • J. Saketha Nath
    • 2
  • Aharon Ben-Tal
    • 2
  • Chiranjib Bhattacharyya
    • 1
  1. 1.Dept. of Computer Science and AutomationIndian Institute of ScienceBangaloreIndia
  2. 2.MINERVA Optimization centerFaculty of Industrial Engg. and Management, TechnionHaifaIsrael

Personalised recommendations