Learning monotonic linear functions

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3120, Issue , 2004, Pages 487-501

  Kalai, Adam ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CLASSIFICATION (OF INFORMATION); ERROR CORRECTION; GRAPH THEORY; MATHEMATICAL MODELS; PARAMETER ESTIMATION; POLYNOMIALS; PROBABILITY DISTRIBUTIONS; REGRESSION ANALYSIS; RISK ASSESSMENT; THEOREM PROVING; ARTIFICIAL INTELLIGENCE; DECISION TREES; FORESTRY; GEOMETRY; LEARNING SYSTEMS; TREES (MATHEMATICS);

CORRELATION COEFFICIENTS (CC); LEARNING PROBABILITIES; LOGISTIC REGRESSION; MONO-LINEAR FUNCTIONS; ARBITRARY ACCURACY; CLASSIFICATION ACCURACY; GENERALIZED ADDITIVE MODEL; LEARNING PROBABILITY; LIPSCHITZ CONSTANT; LOGISTIC REGRESSIONS; NON-PARAMETRIC MODEL; POSITIVE CORRELATIONS;

LEARNING SYSTEMS; LEARNING ALGORITHMS;

EID: 9444252983     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-27819-1_34     Document Type: Conference Paper

References (23)

1. E. Baum. A polynomial time algorithm that learns two hidden unit nets, Neural Computation 2:510-522, 1991.
2. L. Bahl, P. Brown, P. deSouze, and R. Mercer. A Tree-based statistical language model for natural language speech recognition. IEEE Transactions on Acoustics, Speec, and Signal Processing, 37:1001-1008, 1989.
3. J. Aslam and S. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance. Journal of Computer and System Sciences, 56:191-208, 1998.
4. A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1/2):35-52, 1997.
5. T. Bylander. Polynomial learnability of linear threshold approximations. In Proceedings of the Sixth Annual ACM Conference on Computational Learning, 297-302, 1993.
6. L. Breiman, J. Friedman, R. Olshen, and C. Stone, Classification and Regression Trees. Wadsworth International Group, 1984.
7. P. Chou. Applications of Infromation Theory to Pattern Recognition and the Design of Decision Trees and Trellises. PhD thesis, Department of Electrical Engineering, Stanford University, June 1988.
8. J. Friedman, T. Hastie, and R. Tibshirani. Additive logistic regression: A statistical view of boosting. The Annals of Statistics, 28:337-374, 2000.
9. T. Hastie and R. Tibshirani. Generalized Additive Models. London: Chapman and Hall, 1990.
10. A. Kalai and R. Servedio. Boosting in the presence of Noise. Proceedings of the thirty-fifth ACM symposium on theory of computing, pages 195-205, 2003.
11. M. Kearns. Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 45(6):983-1006, 1998.
12. M. Kearns and Y. Mansour. On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and System Sciences, 58(1):109-128, 1999.
13. M. Kearns and R. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and Systems Sciences, 48:464-497, 1994.
14. R. Kohavi. Wrappers for Performance Enhancement and Oblivious Decision Graphs. Ph.D. dissertation, Comput. Sci. Depart., Stanford Univ., Stanford, CA, 1995.
15. Y. Mansour and D. McAllester. Boosting using branching programs. Journal of Computer and System Sciences, 64(1):103-112, 2002.
16. P. McCullagh and J. Neider. Generalized Linear Models, Chapman and Hall, London, 1989.
17. H. Royden. Real Analysis, 3rd edition. Macmillan, New York, 1988.
18. J. Oliver, Decision graphs - an extension of decision trees. In Proceedings of the Fourth International Workshop on Artificial Intelligence and Statistics, pp. 334350, 1993.
19. J. Oliver, D. Dowe, and C. Wallace. Inferring decision graphs using the minimum message length principle. In Proceedings of the 5th Austrailian Conference on Artificial Intelligence, pp. 361-367, 1992.
20. R. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197-227, 1990.
21. M. Shipp, D. Harrington, J. Anderson, J. Armitage, G. Bonadonna, G. Brittinger, et al. A predictive model for aggressive non-Hodgkin's lymphoma. The International Non-Hodgkin's Lymphoma Prognostic Factors Project. New England Journal of Medicine 329(14):987-94, 1993.
22. L. Valiant. A theory of the learnable. Communications of the ACM, 27(11): 1134-1142, 1984.
23. B. Zadrony and C. Elkan. Obtaining calibrated probability estimates from decision trees and naive Bayesian classifiers. In Proceedings of the Eighteenth International Conference on Machine Learning, pages 609-616, 2001.