Learning Probabilistically Consistent Linear Threshold Functions
Abstract
Article Learning probabilistically consistent linear threshold functions Share on Author: Tom Bylander Division of Computer Science, The University of Texas at San Antonio, San Antonio, Texas Division of Computer Science, The University of Texas at San Antonio, San Antonio, TexasView Profile Authors Info & Claims COLT '97: Proceedings of the tenth annual conference on Computational learning theoryJuly 1997 Pages 62–71https://doi.org/10.1145/267460.267479Online:01 July 1997Publication History 1citation199DownloadsMetricsTotal Citations1Total Downloads199Last 12 Months2Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited. To manage your alert preferences, click on the button below. Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access
Cite
Text
Bylander. "Learning Probabilistically Consistent Linear Threshold Functions." Annual Conference on Computational Learning Theory, 1997. doi:10.1145/267460.267479Markdown
[Bylander. "Learning Probabilistically Consistent Linear Threshold Functions." Annual Conference on Computational Learning Theory, 1997.](https://mlanthology.org/colt/1997/bylander1997colt-learning/) doi:10.1145/267460.267479BibTeX
@inproceedings{bylander1997colt-learning,
title = {{Learning Probabilistically Consistent Linear Threshold Functions}},
author = {Bylander, Tom},
booktitle = {Annual Conference on Computational Learning Theory},
year = {1997},
pages = {62-71},
doi = {10.1145/267460.267479},
url = {https://mlanthology.org/colt/1997/bylander1997colt-learning/}
}