Cited By
View all- Menon ARooyen BNatarajan N(2018)Learning from binary labels with instance-dependent noiseMachine Language10.1007/s10994-018-5715-3107:8-10(1561-1595)Online publication date: 1-Sep-2018
Learning probabilistically consistent linear threshold functions
Pages 62 - 71
References
[1]
A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial-time algorithm for learning noisy linear threshold functions. In Proc. 37th IEEE Annual Symposium on Foundations of Computer Science, 1996.
[2]
T. Bylander. Learning linear-threshold functions in the presence of classification noise. In Proc. Seventh Annual ACM Conf. on Computational Learning Theory, pages 340-347,1994.
[3]
R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley, New York,1973.
[4]
U. M. Fayyad and K. B. Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In Proc. Thirteenth Int. Joint ConjI on Artificial Intelligence, pages 1022-1027. 1993.
[5]
S. I. Gallant. Perceptron-based learning algorithms. IEEE Trans. on Neural Networks, I : 179-191, 1990.
[6]
W. Hoeffding. Probability inequalities for sums of bounded variables. J. American Statistical Association, 58: 13-30, 1963.
[7]
R. C. Holte. Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11:63-91, 1993.
[8]
K.-U. Hoffgen, K. S. van Horn, and H.-U. Simon. Robust trainability of single neurons. J. Computer and System Sciences, 50: 114-125, 1995.
[9]
M. J. Kearns and R. E. Schapire. Efficient distribution-free learning of probabilistic concepts. In Proc. 31st Symposium on Foundations of Computer Science, 1990.
[10]
M. J. Kearns, R. E. Schapire, and L. M. Sellie. Towards efticient agnostic learning. In Proc. Fifth Annual ACM Workshop on Computational Learning Theory, pages 341-352,1992.
[11]
N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212-261, 1994.
[12]
P. M. Murphy and D. W. Aha. UCI Repository of machine learning databases {http://www.ics.uci.edu/mlearn/mlrepository.html}, 1994. Irvine, CA, University of California, Department of Information and Computer Science.
[13]
T. Mitchell. Machine Learning. McGraw-Hill. New York, 1997.
[14]
M. L. Minsky and S. A. Papert. Perceptrons. MIT Press, Cambridge, Massachusetts, 1969.
[15]
J. R. Quinlan. C4.S: Programs for Machine Learning. Morgan Kaufmann, San Mateo, California, 1993.
[16]
F. Rosenblatt. Principles of Neurodynamics. Spartan Books, New York, 1962.
[17]
B. Widrow and S. D. Stearns. Adaptive Signal Processing. Prentice-Hall, Englewood Cliffs, New Jersey, 1985.
Index Terms
- Learning probabilistically consistent linear threshold functions
Recommendations
Improved Approximation of Linear Threshold Functions
CCC '09: Proceedings of the 2009 24th Annual IEEE Conference on Computational ComplexityWe prove two main results on how arbitrary linear threshold functions $f(x) = \sign(w\cdot x - \theta)$ over the $n$-dimensional Boolean hypercube can be approximated by simple threshold functions. Our first result shows that every $n$-variable ...
Harmonic Analysis of Polynomial Threshold Functions
The analysis of linear threshold Boolean functions has recently attracted the attention of those interested in circuit complexity as well as of those interested in neural networks. Here a generalization of linear threshold functions is defined, namely, ...
A branch-reduce-cut algorithm for the global optimization of probabilistically constrained linear programs
We consider probabilistically constrained linear programs with general distributions for the uncertain parameters. These problems involve non-convex feasible sets. We develop a branch-and-bound algorithm that searches for a global optimal solution to ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 1997 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
- SIGAI: ACM Special Interest Group on Artificial Intelligence
- AT&T Labs
- SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
- Vanderbilt University: Vanderbilt University
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 July 1997
Check for updates
Qualifiers
- Article
Conference
COLT97: Tenth Annual Conference on Computational Learning Theory
July 6 - 9, 1997
Tennessee, Nashville, USA
Acceptance Rates
Overall Acceptance Rate 35 of 71 submissions, 49%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 264Total Downloads
- Downloads (Last 12 months)47
- Downloads (Last 6 weeks)11
Reflects downloads up to 26 Sep 2024
Other Metrics
Citations
Cited By
View all- Menon ARooyen BNatarajan N(2018)Learning from binary labels with instance-dependent noiseMachine Language10.1007/s10994-018-5715-3107:8-10(1561-1595)Online publication date: 1-Sep-2018
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in