An Improved Branch-and-Bound Method for Maximum Monomial Agreement

References

• Ben-Tal A., Bhadra S., Bhattacharyya C., Nath J. S. Chance constrained uncertain classification via robust optimization. Math. Programming (2011) 127(1):115–173Crossref, Google Scholar
• Boros E., Hammer P. L., Ibaraki T., Kogan A. Logical analysis of numerical data. Math. Programming (1997) 79(1–3):163–190Crossref, Google Scholar
• Boros E., Horiyama T., Ibaraki T., Makino K., Yagiura M. Finding essential attributes from binary data. Ann. Math. Artificial Intelligence (2003) 39(3):223–257Crossref, Google Scholar
• Boros E., Hammer P. L., Ibaraki T., Kogan A., Mayoraz E., Muchnik I. An implementation of logical analysis of data. IEEE Trans. Knowledge Data Engrg. (2000) 12(2):292–306Crossref, Google Scholar
• Bshouty N. H., Burroughs L. Maximizing agreements and coagnostic learning. Theoret. Comput. Sci. (2006) 350(1):24–39Crossref, Google Scholar
• Carrizosa E., Martin-Barragán D. R., Morales B. Binarized support vector machines. INFORMS J. Comput. (2010) 22(1):154–167Link, Google Scholar
• Cohen W. W., Singer Y. A simple, fast, and effective rule learner. Proc. 16th National Conf. Artificial Intelligence (1999) (AAAI Press, Menlo Park, CA) 335–342Google Scholar
• Crama Y., Hammer P. L., Ibaraki T. Cause-effect relationships and partially defined Boolean functions. Ann. Oper. Res. (1988) 16(1–4):299–326Crossref, Google Scholar
• De Bontridder K. M. J., Lageweg B. J., Lenstra J. K., Orlin J. B., Stougie L., Möhring R., Raman R. Branch-and-bound algorithms for the test cover problem. Proc. 10th Annual Eur. Symp. Algorithms, Vol. 2461 (2002) (Springer, Berlin) 223–233Lecture Notes in Computer ScienceCrossref, Google Scholar
• Demiriz A., Bennett K. P., Shawe-Taylor J. Linear programming boosting via column generation. Machine Learn. (2002) 46(1–3):225–254Crossref, Google Scholar
• Dobkin D. P., Gunopulos D., Maass W. Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning. J. Comput. Sys. Sci. (1996) 52(3):453–470Crossref, Google Scholar
• Eckstein J., Phillips C. A., Hart W. E. PEBBL 1.0 user guide. (2006) . RUTCOR Research Report RRR 19-2006, RUTCOR, Rutgers University, Piscataway, NJGoogle Scholar
• Eckstein J., Hammer P. L., Liu Y., Nediak M., Simeone B. The maximum box problem and its application to data analysis. Comput. Optim. Appl. (2002) 23(2):285–298Crossref, Google Scholar
• Feldman V. Optimal hardness results for maximizing agreements with monomials. Proc. 21st Annual IEEE Conf. Comput. Complexity (2006) (IEEE, Piscataway, NJ) 226–236Crossref, Google Scholar
• Frank A., Asuncion A. UCI Machine Learning Repository. (2010) . University of California, Irvine, Irvine. http://archive.ics.uci.edu/mlGoogle Scholar
• Freund Y., Schapire R. E. A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. System Sci. (1997) 55(1):119–139Crossref, Google Scholar
• Friedman J. H., Popescu B. E. Predictive learning via rule ensembles. Ann. Appl. Statist. (2008) 2(3):916–954Crossref, Google Scholar
• Goldberg N., Eckstein J., Fürnkranz J., Joachims T. Boosting classifiers with tightened L0-relaxation penalties. Proc. 27th Internat. Conf. Machine Learning (2010) (Omnipress, Madison, WI) 383–390Google Scholar
• Goldberg N., Shan C., Aple C., Liu B., Parthasarathy S., Skillicorn D. Boosting optimal logical patterns using noisy data. Proc. 7th SIAM Internat. Conf. Data Mining (2007) (SIAM, Philadelphia) 228–236Crossref, Google Scholar
• Graepel T., Herbrich R., Schölkopf B., Smola A., Bartlett P., Müller K.-R., Obermayer K., Williamson R. Classification on proximity data with LP-machines. Proc. 9th Internat. Conf. Artificial Neural Networks (1999) (IEEE, Piscataway, NJ) 304–309Crossref, Google Scholar
• Kearns M., Li M. Learning in the presence of malicious errors. SIAM J. Comput. (1993) 22(4):807–837Crossref, Google Scholar
• Kearns M. J., Schapire R. E., Sellie L. M. Toward efficient agnostic learning. Machine Learn. (1994) 17(2–3):115–141Crossref, Google Scholar
• Khot S. Ruling out PTAS for graph min-bisection, dense k-subgraph, and bipartite clique. SIAM J. Comput. (2006) 36(4):1025–1071Crossref, Google Scholar
• Rätsch G., Schölkopf B., Smola A. J., Mika S., Onoda T., Müller K.-R., Smola A. J., Bartlett P. J., Schölkopf B., Schuurmans D. Robust ensemble learning. Advances in Large Margin Classifiers (2000) (MIT Press, Cambridge, MA) 207–219Crossref, Google Scholar
• Schapire R. E. The strength of weak learnability. Machine Learn. (1990) 5(2):197–227Crossref, Google Scholar
• Schapire R. E., Singer Y. Improved boosting algorithms using confidence-rate predictions. Machine Learn. (1999) 37(3):297–336Crossref, Google Scholar
• Servedio R. A. Smooth boosting and learning with malicious noise. J. Machine Learn. Res. (2003) 4:633–648Google Scholar
• Weiss S. M., Kulikowski C. A.Computer Systems That Learn (1991) (Morgan Kaufmann, San Francisco) Google Scholar