ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A theory of the learnable
Full text PdfPdf (806 KB)
Source
Communications of the ACM archive
Volume 27 ,  Issue 11  (November 1984) table of contents
Pages: 1134 - 1142  
Year of Publication: 1984
ISSN:0001-0782
Author
L. G. Valiant  Harvard Univ., Cambridge, MA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 66,   Downloads (12 Months): 416,   Citation Count: 474
Additional Information:

references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1968.1972
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983  [doi>10.1145/356914.356918]
 
2
Barr, A., and Feigenbaum, E.A. The Handbook of Artificial Intelligence. Vol. 2. William Kaufmann, Los Altos, Calif., 1982.
3
Stephen A. Cook, The complexity of theorem-proving procedures, Proceedings of the third annual ACM symposium on Theory of computing, p.151-158, May 03-05, 1971, Shaker Heights, Ohio, United States  [doi>10.1145/800157.805047]
 
4
Duda, R.O., and Hart, P.F. Pattern Classification and Scene Analysis. Wiley, New York. 1973.
 
5
ErdSs, P., and Spencer, J. Probabilistic Methods in Combinatorics. Academic Press, New York, 1974.
 
6
Goldreich, O., Goldwasser, S., and Micali, S. How to construct random functions. In Proceedings of 25th IEEE Symposium on Foundations of Computer Science (Singer Island, Fla., Oct. 24-26). IEEE, New York, 1984.
 
7
S Ryszard Michalski , G Jaime Carbonell , M Tom Mitchell, Machine learning an artificial intelligence approach volume II, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1986
 
8
Skyum, S., and Valiant, L.G. A complexity theory based on Boolean algebra. In Proceedings of 22rid IEEE Symposium on Foundations of Computer Science (Nashville, Tenn., Oct. 28-30). IEEE, New York, 1981, 244-253.
 
9
Valiant, L.G. Deductive learning. Philosophical Transactions of the Royal Society of London (1984). To be published.

CITED BY  474
Peter L. Bartlett, Lower bounds on the Vapnik-Chervonenkis dimension of multi-layer threshold networks, Proceedings of the sixth annual conference on Computational learning theory, p.144-150, July 26-28, 1993, Santa Cruz, California, United States
 
Haim Shvaytser, Representing knowledge in learning systems by pseudo boolean functions, Proceedings of the 2nd conference on Theoretical aspects of reasoning about knowledge, March 07-09, 1988, Pacific Grove, California
 
Kayvan Najarian, Learning-Based Complexity Evaluation of Radial Basis Function Networks, Neural Processing Letters, v.16 n.2, p.137-150, October 2002
 
Hanzhong Gu , Haruhisa Takahashi, How Bad May Learning Curves Be?, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.22 n.10, p.1155-1167, October 2000
Robert Goldman, Book review: Analogical Modeling of Language by Royal Skousen (Kluwer Academic Publishers, 1989), ACM SIGART Bulletin, v.2 n.1, p.75, Jan. 1991
 
Stan Z. Li , ZhenQiu Zhang, FloatBoost Learning and Statistical Face Detection, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.26 n.9, p.1112-1123, September 2004
 
S. Edelman, On Learning to Recognize 3-D Objects from Examples, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.8, p.833-837, August 1993
Michael de la Maza, Book review: The Design and Analysis of Efficient Learning Algorithms by Robert E. Schapire (MIT Press, 1992), ACM SIGART Bulletin, v.4 n.4, p.18-19, Oct. 1993
Yoshifumi Sakai , Eiji Takimoto , Akira Maruoka, Proper learning algorithm for functions of k terms under smooth distributions, Proceedings of the eighth annual conference on Computational learning theory, p.206-213, July 05-08, 1995, Santa Cruz, California, United States
Larry J. Morell , Jeffrey Voas, On the inadequacies of data state space sampling as a measure of the trustworthiness of programs, ACM SIGSOFT Software Engineering Notes, v.16 n.2, p.73-74, April 1991
 
Peter L. Bartlett, Vapnik-chervonenkis dimension bounds for two-and three-layer networks, Neural Computation, v.5 n.3, p.371-373, May 1993
Alberto Bertoni , Paola Campadelli , Anna Morpurgo , Sandra Panizza, Polynomial uniform convergence and polynomial-sample learnability, Proceedings of the fifth annual workshop on Computational learning theory, p.265-271, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
 
H. John Caulfield , Angelo Karavolos , Jacques E. Ludman, Improving optical Fourier pattern recognition by accommodating the missing information, Information Sciences: an International Journal, v.162 n.1, p.35-52, 5 May 2004
 
Bradford Starkie , François Coste , Menno van Zaanen, Progressing the state-of-the-art in grammatical inference by competition: The Omphalos Context-Free Language Learning Competition, AI Communications, v.18 n.2, p.93-115, April 2005
 
Steve Chien , Jonathan Gratch , Michael Burl, On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.7, p.652-665, July 1995
Jianhua Chen, Application of Boolean expression minimization to learning via hierarchical generalization, Proceedings of the 1994 ACM symposium on Applied computing, p.303-307, March 06-08, 1994, Phoenix, Arizona, United States
 
Salvador Nieto Sanchez , Evangelos Triantaphyllou , Jianhua Chen , T. Warren Liao, An incremental learning algorithm for constructing boolean functions from positive and negative examples, Computers and Operations Research, v.29 n.12, p.1677-1700, October 2002
Daniel Lowd , Christopher Meek, Adversarial learning, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
 
Y. Kabashima , S. Shinomoto, Learning curves for error minimum and maximum likelihood algorithms, Neural Computation, v.4 n.5, p.712-719, September 1992
 
Jimmy Liu Jiang , Kia-Fock Loe , Hong Jiang Zhang, Robust face detection in airports, EURASIP Journal on Applied Signal Processing, v.2004 n.1, p.503-509, 1 January 2004
 
Yaser S. Abu-Mostafa, Review:, Neural Computation, v.1 n.3, p.312-317, Fall 1989
Ulf Berggren, Linear time deterministic learning of k-term DNF, Proceedings of the sixth annual conference on Computational learning theory, p.37-40, July 26-28, 1993, Santa Cruz, California, United States
Philip M. Long , Lei Tan, PAC learning axis-aligned rectangles with respect to product distributions from multiple-instance examples, Proceedings of the ninth annual conference on Computational learning theory, p.228-234, June 28-July 01, 1996, Desenzano del Garda, Italy
Liva Ralaivola , François Denis , Christophe Nicolas Magnan, CN = CPCN, Proceedings of the 23rd international conference on Machine learning, p.721-728, June 25-29, 2006, Pittsburgh, Pennsylvania
 
Charles H.-P. Wen , Li-C. Wang , Jayanta Bhadra, An incremental learning framework for estimating signal controllability in unit-level verification, Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, November 05-08, 2007, San Jose, California
Yiqun Lisa Yin, Reducing the number of queries in self-directed learning, Proceedings of the eighth annual conference on Computational learning theory, p.128-135, July 05-08, 1995, Santa Cruz, California, United States
 
M. Hasenjäger , H. Ritter, Active learning in neural networks, New learning paradigms in soft computing, Physica-Verlag GmbH, Heidelberg, Germany, 2002
 
William Aiello , Milena Mihail, Learning the Fourier spectrum of probabilistic lists and trees, Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms, p.291-299, January 28-30, 1991, San Francisco, California, United States
Avrim Blum , Prasad Chalasani , Jeffrey Jackson, On learning embedded symmetric concepts, Proceedings of the sixth annual conference on Computational learning theory, p.337-346, July 26-28, 1993, Santa Cruz, California, United States
Kenji Yamanishi, On polynomial-time probably almost discriminative learnability, Proceedings of the sixth annual conference on Computational learning theory, p.94-100, July 26-28, 1993, Santa Cruz, California, United States
Yoshifumi Sakai , Akira Maruoka, Learning monotone log-term DNF formulas, Proceedings of the seventh annual conference on Computational learning theory, p.165-172, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Pieter Adriaans , Erik de Haas, Learning from a substructural perspective, Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning, September 13-14, 2000, Lisbon, Portugal
 
Ralf Herbrich , Thore Graepel, Introduction to the special issue on learning theory, The Journal of Machine Learning Research, 4, 12/1/2003
 
Qing Tao , Gao-wei Wu , Jue Wang, The theoretical analysis of FDA and applications, Pattern Recognition, v.39 n.6, p.1199-1204, June, 2006
 
Martin Anthony , Peter L. Hammer, A Boolean measure of similarity, Discrete Applied Mathematics, v.154 n.16, p.2242-2246, 1 November 2006
Claude-Nicolas Fiechter, PAC adaptive control of linear systems, Proceedings of the tenth annual conference on Computational learning theory, p.72-80, July 06-09, 1997, Nashville, Tennessee, United States
Kathleen Romanik, Approximate testing and learnability, Proceedings of the fifth annual workshop on Computational learning theory, p.327-332, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Paul Fischer, More or less efficient agnostic learning of convex polygons, Proceedings of the eighth annual conference on Computational learning theory, p.337-344, July 05-08, 1995, Santa Cruz, California, United States
Joel Ratsaby , Santosh S. Venkatesh, Learning from a mixture of labeled and unlabeled examples with parametric side information, Proceedings of the eighth annual conference on Computational learning theory, p.412-417, July 05-08, 1995, Santa Cruz, California, United States
 
José L. Balcázar , Jorge Castro , David Guijarro , Hans-Ulrich Simon, The consistency dimension and distribution-dependent learning from queries, Theoretical Computer Science, v.288 n.2, p.197-215, 16 October 2002
Yasubumi Sakakibara , Rani Siromoney, A noise model on learning sets of strings, Proceedings of the fifth annual workshop on Computational learning theory, p.295-302, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Dan Boneh , Richard J. Lipton, Amplification of weak learning under the uniform distribution, Proceedings of the sixth annual conference on Computational learning theory, p.347-351, July 26-28, 1993, Santa Cruz, California, United States
 
Sanjoy Dasgupta, The Sample Complexity of Learning Fixed-Structure Bayesian Networks, Machine Learning, v.29 n.2-3, p.165-180, Nov./Dec. 1997
 
Qing Tao , Jue Wang, A New Fuzzy Support Vector Machine Based on the Weighted Margin, Neural Processing Letters, v.20 n.3, p.139-150, November 2004
 
Paola Velardi , Alessandro Cucchiarelli, Dependency of context-based word sense disambiguation from representation and domain complexity, NAACL-ANLP 2000 Workshop on Syntactic and semantic complexity in natural language processing systems, p.28-34, April 30-30, 2000, Seattle, Washington
Avrim Blum , Steven Rudich, Fast learning of k-term DNF formulas with queries, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.382-389, May 04-06, 1992, Victoria, British Columbia, Canada
M. Kearns , M. Li , L. Pitt , L. Valiant, On the learnability of Boolean formulae, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.285-295, January 1987, New York, New York, United States
Howard Aizenstein , Leonard Pitt, Exact learning of read-k disjoint DNF and not-so-disjoint DNF, Proceedings of the fifth annual workshop on Computational learning theory, p.71-76, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Hans Ulrich Simon, General bounds on the number of examples needed for learning probabilistic concepts, Proceedings of the sixth annual conference on Computational learning theory, p.402-411, July 26-28, 1993, Santa Cruz, California, United States
Shai Ben-David , Nicolò Cesa-Bianchi , Philip M. Long, Characterizations of learnability for classes of {O, …, n}-valued functions, Proceedings of the fifth annual workshop on Computational learning theory, p.333-340, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Eiji Takimoto , Akira Maruoka, Conservativeness and monotonicity for learning algorithms, Proceedings of the sixth annual conference on Computational learning theory, p.377-383, July 26-28, 1993, Santa Cruz, California, United States
Gyora M. Benedek , Alon Itai, Dominating distributions and learnability, Proceedings of the fifth annual workshop on Computational learning theory, p.253-264, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
 
Dick Hamlet , Ross Taylor, Partition Testing Does Not Inspire Confidence (Program Testing), IEEE Transactions on Software Engineering, v.16 n.12, p.1402-1411, December 1990
 
Alp Atici , Rocco A. Servedio, Improved Bounds on Quantum Learning Algorithms, Quantum Information Processing, v.4 n.5, p.355-386, November 2005
 
Peter L. Bartlett , Robert C. Williamson, The vc dimension and pseudodimension of two-layer neural networks with discrete inputs, Neural Computation, v.8 n.3, p.625-628, April 1, 1996
Zhixiang Chen , Wolfgang Maass, On-line learning of rectangles, Proceedings of the fifth annual workshop on Computational learning theory, p.16-28, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Mihir Bellare, A technique for upper bounding the spectral norm with applications to learning, Proceedings of the fifth annual workshop on Computational learning theory, p.62-70, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
José L. Balcázar , Josep Díaz , Ricard Gavaldà , Osamu Watanabe, An optimal parallel algorithm for learning DFA, Proceedings of the seventh annual conference on Computational learning theory, p.208-217, July 12-15, 1994, New Brunswick, New Jersey, United States
Peter L. Bartlett, Learning with a slowly changing distribution, Proceedings of the fifth annual workshop on Computational learning theory, p.243-252, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Sampath K. Kannan, On the query complexity of learning, Proceedings of the sixth annual conference on Computational learning theory, p.58-66, July 26-28, 1993, Santa Cruz, California, United States
A. Blum, Learning boolean functions in an infinite attribute space, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.64-72, May 13-17, 1990, Baltimore, Maryland, United States
Nader H. Bshouty, Simple learning algorithms using divide and conquer, Proceedings of the eighth annual conference on Computational learning theory, p.447-453, July 05-08, 1995, Santa Cruz, California, United States
Michael Kearns , Ming Li, Learning in the presence of malicious errors, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.267-280, May 02-04, 1988, Chicago, Illinois, United States
 
Yasubumi Sakakibara, DNA-based algorithms for learning Boolean formulae, Natural Computing: an international journal, v.2 n.2, p.153-171, 2003
 
Nader H. Bshouty, The monotone theory for the PAC-model, Information and Computation, v.186 n.1, p.20-35, 10 October 2003
Yoav Freund, An improved boosting algorithm and its implications on learning complexity, Proceedings of the fifth annual workshop on Computational learning theory, p.391-398, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
 
Steffen Lange , Sandra Zilles, Formal language identification: query learning vs. gold-style learning, Information Processing Letters, v.91 n.6, p.285-292, 30 September 2004
 
Alexander Clark , Franck Thollard, Partially distribution-free learning of regular languages from positive samples, Proceedings of the 20th international conference on Computational Linguistics, p.85-es, August 23-27, 2004, Geneva, Switzerland
 
Atsuyoshi Nakamura , Jun-ichi Takeuchi , Naoki Abe, Efficient distribution-free population learning of simple concepts, Annals of Mathematics and Artificial Intelligence, v.23 n.1-2, p.53-82, 1998
 
Sanjay Jain , Steffen Lange , Sandra Zilles, Some natural conditions on incremental learning, Information and Computation, v.205 n.11, p.1671-1684, November, 2007
Scott E. Decatur , Rosario Gennaro, On learning from noisy and incomplete examples, Proceedings of the eighth annual conference on Computational learning theory, p.353-360, July 05-08, 1995, Santa Cruz, California, United States
Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, ACM SIGMOD Record, v.22 n.2, p.207-216, June 1, 1993
Avrim Blum , Tao Jiang , Ming Li , John Tromp , Mihalis Yannakakis, Linear approximation of shortest superstrings, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.328-336, May 05-08, 1991, New Orleans, Louisiana, United States
 
P. Smyth , R. M. Goodman, An Information Theoretic Approach to Rule Induction from Databases, IEEE Transactions on Knowledge and Data Engineering, v.4 n.4, p.301-316, August 1992
David Helmbold , Sandra Panizza, Some label efficient learning results, Proceedings of the tenth annual conference on Computational learning theory, p.218-230, July 06-09, 1997, Nashville, Tennessee, United States
 
Alp Atıcı , Rocco A. Servedio, Quantum Algorithms for Learning and Testing Juntas, Quantum Information Processing, v.6 n.5, p.323-348, October 2007
Alexander L. Strehl , Chris Mesterharm , Michael L. Littman , Haym Hirsh, Experience-efficient learning in associative bandit problems, Proceedings of the 23rd international conference on Machine learning, p.889-896, June 25-29, 2006, Pittsburgh, Pennsylvania
 
Eric Martin , Arun Sharma , Frank Stephan, On ordinal VC-dimension and some notions of complexity, Theoretical Computer Science, v.364 n.1, p.62-76, 2 November 2006
 
Philip M. Long , Lei Tan, PAC Learning Axis-aligned Rectangles with Respect toProduct Distributions from Multiple-Instance Examples, Machine Learning, v.30 n.1, p.7-21, Jan. 1998
 
Nageswara S. V. Rao , Vladimir Protopopescu, Function Estimation by Feedforward Sigmoidal Networks with BoundedWeights, Neural Processing Letters, v.7 n.3, p.125-131, June 1, 1998
Thomas R. Hancock, Learning k&mgr; decision trees on the uniform distribution, Proceedings of the sixth annual conference on Computational learning theory, p.352-360, July 26-28, 1993, Santa Cruz, California, United States
Nader H. Bshouty , Christino Tamon , David K. Wilson, On learning decision trees with large output domains (extended abstract), Proceedings of the eighth annual conference on Computational learning theory, p.190-197, July 05-08, 1995, Santa Cruz, California, United States
Michele Flammini , Alberto Marchetti-Spaccamela , Luděk Kučera, Learning DNF formulae under classes of probability distributions, Proceedings of the fifth annual workshop on Computational learning theory, p.85-92, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
David P. Helmbold , Manfred K. Warmuth, Some weak learning results, Proceedings of the fifth annual workshop on Computational learning theory, p.399-412, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Peter Cholak , Efim Kinber , Rod Downey , Martin Kummer , Lance Fortnow , Stuart Kurtz , William Gasarch , Theodore A. Slaman, Degrees of inferability, Proceedings of the fifth annual workshop on Computational learning theory, p.180-192, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Kevin L. Buescher , P. R. Kumar, Learning stochastic functions by smooth simultaneous estimation, Proceedings of the fifth annual workshop on Computational learning theory, p.272-279, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Nader H. Bshouty , Christino Tamon , David K. Wilson, On learning width two branching programs (extended abstract), Proceedings of the ninth annual conference on Computational learning theory, p.224-227, June 28-July 01, 1996, Desenzano del Garda, Italy
Hervé Brönnimann , Bin Chen , Manoranjan Dash , Peter Haas , Peter Scheuermann, Efficient data reduction with EASE, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
 
Nader H. Bshouty , Jeffrey C. Jackson , Christino Tamon, More efficient PAC-learning of DNF with membership queries under the uniform distribution, Journal of Computer and System Sciences, v.68 n.1, p.205-234, February 2004
Paul W. Goldberg , Sally A. Goldman, Learning one-dimensional geometric patterns under one-sided random misclassification noise, Proceedings of the seventh annual conference on Computational learning theory, p.246-255, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Ke Yang, New lower bounds for statistical query learning, Journal of Computer and System Sciences, v.70 n.4, p.485-509, June 2005
 
Cai-Yan Jia , Xie-Ping Gao, Multi-scaling sampling: an adaptive sampling method for discovering approximate association rules, Journal of Computer Science and Technology, v.20 n.3, p.309-318, May 2005
Shai Shalev-Shwartz , Nathan Srebro, SVM optimization: inverse dependence on training set size, Proceedings of the 25th international conference on Machine learning, p.928-935, July 05-09, 2008, Helsinki, Finland
 
Adam J. Grove , Dan Roth, Linear Concepts and Hidden Variables, Machine Learning, v.42 n.1-2, p.123-141, January-February 2001
Jeffrey Jackson , Andrew Tomkins, A computational model of teaching, Proceedings of the fifth annual workshop on Computational learning theory, p.319-326, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Eyal Kushilevitz , Yishay Mansour, Learning decision trees using the Fourier spectrum, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.455-464, May 05-08, 1991, New Orleans, Louisiana, United States
Nader H. Bshouty, Towards the learnability of DNF formulae, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.131-140, May 22-24, 1996, Philadelphia, Pennsylvania, United States
Alvis Brāzma, Efficient identification of regular expressions from representative examples, Proceedings of the sixth annual conference on Computational learning theory, p.236-242, July 26-28, 1993, Santa Cruz, California, United States
Nicolò Cesa-Bianchi , Eli Dichterman , Paul Fischer , Hans Ulrich Simon, Noise-tolerant learning near the information-theoretic bound, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.141-150, May 22-24, 1996, Philadelphia, Pennsylvania, United States
Kenji Yamanishi, The minimum L-complexity algorithm and its applications to learning non-parametric rules, Proceedings of the seventh annual conference on Computational learning theory, p.173-182, July 12-15, 1994, New Brunswick, New Jersey, United States
Peter L. Bartlett , Paul Fischer , Klaus-Uwe Höffgen, Exploiting random walks for learning, Proceedings of the seventh annual conference on Computational learning theory, p.318-327, July 12-15, 1994, New Brunswick, New Jersey, United States
Krishnan Pillaipakkamnatt , Vijay Raghavan, On the limits of proper learnability of subclasses of DNF formulas, Proceedings of the seventh annual conference on Computational learning theory, p.118-129, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Philip M. Long, An upper bound on the sample complexity of PAC-learning halfspaces with respect to the uniform distribution, Information Processing Letters, v.87 n.5, p.229-234, 15 September 2003
 
Achim Hoffman, Performance comparisons of neural networks and machine learning techniques: a critical assessment of the methodology, New learning paradigms in soft computing, Physica-Verlag GmbH, Heidelberg, Germany, 2002
 
Nader H. Bshouty , Jeffrey C. Jackson , Christino Tamon, Exploring learnability between exact and PAC, Journal of Computer and System Sciences, v.70 n.4, p.471-484, June 2005
 
Eric B. Baum, Review:, Neural Computation, v.1 n.2, p.201-207, Summer 1989
Yishay Mansour , Mariano Schain, Learning with maximum-entropy distributions, Proceedings of the tenth annual conference on Computational learning theory, p.201-210, July 06-09, 1997, Nashville, Tennessee, United States
F. Bergadano , D. Catalano , S. Varricchio, Learning Sat-k-DNF formulas from membership queries, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.126-130, May 22-24, 1996, Philadelphia, Pennsylvania, United States
Yishay Mansour, An O(nlog log n) learning algorithm for DNF under the uniform distribution, Proceedings of the fifth annual workshop on Computational learning theory, p.53-61, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Jyrki Kivinen , Manfred K. Warmuth, The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant, Proceedings of the eighth annual conference on Computational learning theory, p.289-296, July 05-08, 1995, Santa Cruz, California, United States
Wee Sun Lee , Peter L. Bartlett , Robert C. Williamson, Lower bounds on the VC-dimension of smoothly parametrized function classes, Proceedings of the seventh annual conference on Computational learning theory, p.362-367, July 12-15, 1994, New Brunswick, New Jersey, United States
Henrik Nottelmann , Norbert Fuhr, Learning probabilistic datalog rules for information classification and transformation, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
Zhixiang Chen, Learning unions of two rectangles in the plane with equivalence queries, Proceedings of the sixth annual conference on Computational learning theory, p.243-252, July 26-28, 1993, Santa Cruz, California, United States
R. Board , L. Pitt, On the necessity of Occam algorithms, Proceedings of the twenty-second annual ACM symposium on Theory of computing, p.54-63, May 13-17, 1990, Baltimore, Maryland, United States
Shai Ben-David , Michal Jacovi, On learning in the limit and non-uniform (&egr;,&dgr;)-learning, Proceedings of the sixth annual conference on Computational learning theory, p.209-217, July 26-28, 1993, Santa Cruz, California, United States
 
Nader H. Bshouty, Exact Learning of Formulas in Parallel, Machine Learning, v.26 n.1, p.25-41, Jan. 1997
 
H. Shvayster, Learnable and Nonlearnable Visual Concepts, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.5, p.459-466, May 1990
 
LiMin Fu, Knowledge Discovery by Inductive Neural Networks, IEEE Transactions on Knowledge and Data Engineering, v.11 n.6, p.992-998, November 1999
 
Yasuhiro Tajima , Etsuji Tomita , Mitsuo Wakatsuki , Matsuaki Terada, Polynomial time learning of simple deterministic languages via queries and a representative sample, Theoretical Computer Science, v.329 n.1-3, p.203-221, 13 December 2004
Alina Beygelzimer , Varsha Dani , Tom Hayes , John Langford , Bianca Zadrozny, Error limiting reductions between classification tasks, Proceedings of the 22nd international conference on Machine learning, p.49-56, August 07-11, 2005, Bonn, Germany
 
Naoki Abe, Polynomial learnability and locality of formal grammars, Proceedings of the 26th annual meeting on Association for Computational Linguistics, p.225-232, June 07-10, 1988, Buffalo, New York
 
S. J. Wan , S. K. M. Wong, A Partially Supervised Learning Algorithm for Linearly Separable Systems, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.10, p.1052-1056, October 1992
 
Ming Li , John Tromp , Paul Vitányi, Sharpening Occam's razor, Information Processing Letters, v.85 n.5, p.267-274, 16 March 2003
Dana Angluin , James Aspnes , Jiang Chen , Yinghua Wu, Learning a circuit by injecting values, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
 
Laurence Bisht , Nader H. Bshouty , Lawrance Khoury, Learning with errors in answers to membership queries, Journal of Computer and System Sciences, v.74 n.1, p.2-15, February, 2008
 
Stefano Rovetta , Francesco Masulli, Shared farthest neighbor approach to clustering of high dimensionality, low cardinality data, Pattern Recognition, v.39 n.12, p.2415-2425, December, 2006
 
Hiroki Ishizaka , Hiroki Arimura , Takeshi Shinohara, Finding tree patterns consistent with positive and negative examples using queries, Annals of Mathematics and Artificial Intelligence, v.23 n.1-2, p.101-115, 1998
 
Anthony M. Zador , Barak A. Pearlmutter, Vc dimension of an integrate-and-fire neuron model, Neural Computation, v.8 n.3, p.611-624, April 1, 1996
Jonathan Baxter, A Bayesian/information theoretic model of bias learning, Proceedings of the ninth annual conference on Computational learning theory, p.77-88, June 28-July 01, 1996, Desenzano del Garda, Italy
Nader H. Bshouty, A new composition theorem for learning algorithms, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.583-589, May 24-26, 1998, Dallas, Texas, United States
Michael J. Kearns , Robert E. Schapire , Linda M. Sellie, Toward efficient agnostic learning, Proceedings of the fifth annual workshop on Computational learning theory, p.341-352, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Claude-Nicolas Fiechter, Efficient reinforcement learning, Proceedings of the seventh annual conference on Computational learning theory, p.88-97, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Letizia Magnoni , Massimo Mirolli , Franco Montagna , Giulia Simi, PAC learning of probability distributions over a discrete domain, Theoretical Computer Science, v.299 n.1-3, p.37-63, 18 April 2003
S. R. Kulkarni , J. N. Tsitsiklis , S. K. Mitter , O. Zeitouni, PAC learning with generalized samples and an application to stochastic geometry, Proceedings of the fifth annual workshop on Computational learning theory, p.172-179, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
 
Naoki Abe, Feasible learnability of formal grammars and the theory of natural language acquisition, Proceedings of the 12th conference on Computational linguistics, p.1-6, August 22-27, 1988, Budapest, Hungry
Michael Barbehenn , Seth Hutchinson, An integrated architecture for learning and planning in robotic domains, ACM SIGART Bulletin, v.2 n.4, p.29-33, Aug. 1991
 
Yishay Mansour , Mariano Schain, Learning with Maximum-Entropy Distributions, Machine Learning, v.45 n.2, p.123-145, November 2001
 
György Turán, Remarks on computational learning theory, Annals of Mathematics and Artificial Intelligence, v.28 n.1-4, p.43-45, 2000
 
Kunihiko Hiraishi, Synthesis of Supervisors Using Learning Algorithm of RegularLanguages, Discrete Event Dynamic Systems, v.11 n.3, p.211-234, July 2001
Avrim Blum , Tao Jiang , Ming Li , John Tromp , Mihalis Yannakakis, Linear approximation of shortest superstrings, Journal of the ACM (JACM), v.41 n.4, p.630-647, July 1994
David P. Dobkin , Dimitrios Gunopulos, Concept learning with geometric hypotheses, Proceedings of the eighth annual conference on Computational learning theory, p.329-336, July 05-08, 1995, Santa Cruz, California, United States
Nicolò Cesa-Bianchi , Eli Dichterman , Paul Fischer , Eli Shamir , Hans Ulrich Simon, Sample-efficient strategies for learning in the presence of noise, Journal of the ACM (JACM), v.46 n.5, p.684-719, Sept. 1999
Javed A. Aslam , Scott E. Decatur, Specification and simulation of statistical query algorithms for efficiency and noise tolerance, Proceedings of the eighth annual conference on Computational learning theory, p.437-446, July 05-08, 1995, Santa Cruz, California, United States
Michael Kearns , Yishay Mansour, On the boosting ability of top-down decision tree learning algorithms, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.459-468, May 22-24, 1996, Philadelphia, Pennsylvania, United States
Eyal Kushilevitz , Dan Roth, On learning visual concepts and DNF formulae, Proceedings of the sixth annual conference on Computational learning theory, p.317-326, July 26-28, 1993, Santa Cruz, California, United States
Michael Kharitonov, Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution, Proceedings of the fifth annual workshop on Computational learning theory, p.29-36, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Paul W. Goldberg , Sally A. Goldman , H. David Mathias, Learning unions of boxes with membership and equivalence queries, Proceedings of the seventh annual conference on Computational learning theory, p.198-207, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Svetlana Kiritchenko , Stan Matwin, Email classification with co-training, Proceedings of the 2001 conference of the Centre for Advanced Studies on Collaborative research, p.8, November 05-07, 2001, Toronto, Ontario, Canada
 
Peter L. Bartlett , Paul Fischer , Klaus-Uwe Höffgen, Exploiting random walks for learning, Information and Computation, v.176 n.2, p.121-135, 01 August 2002
Xindong Wu, The HCV induction algorithm, Proceedings of the 1993 ACM conference on Computer science, p.168-175, February 16-18, 1993, Indianapolis, Indiana, United States
Nader H. Bshouty , Richard Cleve , Sampath Kannan , Christino Tamon, Oracles and queries that are sufficient for exact learning (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.130-139, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Kenneth Basye , Thomas Dean , Jeffrey Scott Vitter, Coping with Uncertainty in Map Learning, Machine Learning, v.29 n.1, p.65-88, Oct. 1997
 
Jonathan E. Cook , Zhidian Du , Chongbing Liu , Alexander L. Wolf, Discovering models of behavior for concurrent workflows, Computers in Industry, v.53 n.3, p.297-319, April 2004
 
Hwanjo Yu, Single-Class Classification with Mapping Convergence, Machine Learning, v.61 n.1-3, p.49-69, November 2005
 
Rocco A. Servedio, On learning embedded midbit functions, Theoretical Computer Science, v.350 n.1, p.13-23, 18 January 2006
 
Nader H. Bshouty , Lynn Burroughs, Maximizing agreements and coagnostic learning, Theoretical Computer Science, v.350 n.1, p.24-39, 18 January 2006
 
Ziv Nevo , Ran El-Yaniv, On online learning of decision lists, The Journal of Machine Learning Research, 3, p.271-301, 3/1/2003
 
Ariel Elbaz , Homin K. Lee , Rocco A. Servedio , Andrew Wan, Separating Models of Learning from Correlated and Uncorrelated Data, The Journal of Machine Learning Research, 8, p.277-290, 5/1/2007
 
Osamu Takata , Koukichi Nakanishi , Nariaki Horinouchi , Hiroshi Yano , Tadashi Akashi , Toyohide Watanabe, A Knowledge-Based Mesh Generation System for Forging Simulation, Applied Intelligence, v.11 n.2, p.149-168, September-October 1999
 
Paul Helman , Rebecca Gore, Prioritizing Information for the Discovery of Phenomena, Journal of Intelligent Information Systems, v.11 n.2, p.99-138, Sept./Oct. 1998
 
Mario Marchand , John Shawe Taylor, The set covering machine, The Journal of Machine Learning Research, 3, 3/1/2003
 
Jeffrey Jackson, On the Efficiency of Noise-Tolerant PAC Algorithms Derived from Statistical Queries, Annals of Mathematics and Artificial Intelligence, v.39 n.3, p.291-313, November 2003
 
Andrei Bulatov , Hubie Chen , Víctor Dalmau, Learning intersection-closed classes with signatures, Theoretical Computer Science, v.382 n.3, p.209-220, September, 2007
 
Mostefa Golea , Mario Marchand, On learning perceptrons with binary weights, Neural Computation, v.5 n.5, p.767-782, September 1993
Avrim Blum , Roni Khardon , Eyal Kushilevitz , Leonard Pitt , Dan Roth, On learning Read-k-Satisfy-j DNF, Proceedings of the seventh annual conference on Computational learning theory, p.110-117, July 12-15, 1994, New Brunswick, New Jersey, United States
Nader H. Bshouty , Zhixiang Chen , Scott E. Decatur , Steven Homer, On the learnability of Zn-DNF formulas (extended abstract), Proceedings of the eighth annual conference on Computational learning theory, p.198-205, July 05-08, 1995, Santa Cruz, California, United States
Rodney G. Downey , Patricia A. Evans , Michael R. Fellows, Parameterized learning complexity, Proceedings of the sixth annual conference on Computational learning theory, p.51-57, July 26-28, 1993, Santa Cruz, California, United States
Scott Evan Decatur, Statistical queries and faulty PAC oracles, Proceedings of the sixth annual conference on Computational learning theory, p.262-268, July 26-28, 1993, Santa Cruz, California, United States
Robert E. Schapire , Linda M. Sellie, Learning sparse multivariate polynomials over a field with queries and counterexamples, Proceedings of the sixth annual conference on Computational learning theory, p.17-26, July 26-28, 1993, Santa Cruz, California, United States
Nathan Linial , Yishay Mansour , Noam Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM (JACM), v.40 n.3, p.607-620, July 1993
 
Xiao-Jia M. Zhou , Tharam S. Dillon, Theoretical and Practical Considerations of Uncertainty and Complexity in Automated Knowledge Acquisition, IEEE Transactions on Knowledge and Data Engineering, v.7 n.5, p.699-712, October 1995
A Blumer , A Ehrenfeucht , D Haussler , M Warmuth, Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension, Proceedings of the eighteenth annual ACM symposium on Theory of computing, p.273-282, May 28-30, 1986, Berkeley, California, United States
Wolfgang Maass, Efficient agnostic PAC-learning with simple hypothesis, Proceedings of the seventh annual conference on Computational learning theory, p.67-75, July 12-15, 1994, New Brunswick, New Jersey, United States
Foster Provost , David Jensen , Tim Oates, Efficient progressive sampling, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.23-32, August 15-18, 1999, San Diego, California, United States
Sebastien M. Lahaie , David C. Parkes, Applying learning algorithms to preference elicitation, Proceedings of the 5th ACM conference on Electronic commerce, May 17-20, 2004, New York, NY, USA
 
Marcos Salganicoff, Tolerating Concept and Sampling Shift in Lazy Learning UsingPrediction Error Context Switching, Artificial Intelligence Review, v.11 n.1-5, p.133-155, Feb. 1997
 
François Denis , Rémi Gilleron , Fabien Letouzey, Learning from positive and unlabeled examples, Theoretical Computer Science, v.348 n.1, p.70-83, 2 December 2005
 
Hai Huang , Wei-Tek Tsai , Yinong Chen, Binary analysis and automated hot patching for Web-based applications, Information and Software Technology, v.48 n.12, p.1148-1158, December, 2006
 
Thomas R. Amoth , Paul Cull , Prasad Tadepalli, On Exact Learning of Unordered Tree Patterns, Machine Learning, v.44 n.3, p.211-243, September 2001
 
Charles H. -P. Wen , Li-C. Wang , Kwang-Ting Cheng, Simulation-Based Functional Test Generation for Embedded Processors, IEEE Transactions on Computers, v.55 n.11, p.1335-1343, November 2006
Nader H. Bshouty , Jeffrey C. Jackson , Christino Tamon, More efficient PAC-learning of DNF with membership queries under the uniform distribution, Proceedings of the twelfth annual conference on Computational learning theory, p.286-295, July 07-09, 1999, Santa Cruz, California, United States
Dana Ron , Ronitt Rubinfeld, Learning fallible finite state automata, Proceedings of the sixth annual conference on Computational learning theory, p.218-227, July 26-28, 1993, Santa Cruz, California, United States
Martin Anthony , Graham Brightwell , Dave Cohen , John Shawe-Taylor, On exact specification by examples, Proceedings of the fifth annual workshop on Computational learning theory, p.311-318, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Jyrki Kivinen , Heikki Mannila, The power of sampling in knowledge discovery, Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.77-85, May 24-27, 1994, Minneapolis, Minnesota, United States
Elchanan Mossel , Ryan O'Donnell , Rocco P. Servedio, Learning juntas, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
Sašo Džeroski , Stephen Muggleton , Stuart Russell, PAC-learnability of determinate logic programs, Proceedings of the fifth annual workshop on Computational learning theory, p.128-135, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
 
Nader H. Bshouty , Dmitry Gavinsky, On boosting with polynomially bounded distributions, The Journal of Machine Learning Research, 3, 3/1/2003
Eric A. Breimer , Mark K. Goldberg , Darren T. Lim, A learning algorithm for the longest common subsequence problem, Journal of Experimental Algorithmics (JEA), 8, 2003
Haim Kaplan , Eyal Kushilevitz , Yishay Mansour, Learning with attribute costs, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
 
Dana Angluin, Queries revisited, Theoretical Computer Science, v.313 n.2, p.175-194, 17 February 2004
 
Kayvan Najarian, A Fixed-Distribution PAC Learning Theory for Neural FIR Models, Journal of Intelligent Information Systems, v.25 n.3, p.275-291, November 2005
Parikshit Gopalan , Adam Tauman Kalai , Adam R. Klivans, Agnostically learning decision trees, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
 
Dana Angluin , James Aspnes , Jiang Chen , Yinghua Wu, Learning a circuit by injecting values, Journal of Computer and System Sciences, v.75 n.1, p.60-77, January, 2009
 
Liang-Bin Lai , Ray-I Chang , Jen-Shiang Kouh, Detecting network intrusions using signal processing with query-based sampling filter, EURASIP Journal on Advances in Signal Processing, v.2009 n.1, p.1-8, January 2009
 
M. Subasi , E. Subasi , M. Anthony , P. L. Hammer, Using a similarity measure for credible classification, Discrete Applied Mathematics, v.157 n.5, p.1104-1112, March, 2009
 
Jason Riggle, The complexity of ranking hypotheses in optimality theory, Computational Linguistics, v.35 n.1, p.47-59, March 2009
Roni Khardon , Dan Roth, Learning to reason with a restricted view, Proceedings of the eighth annual conference on Computational learning theory, p.301-310, July 05-08, 1995, Santa Cruz, California, United States
L. Pitt , M. K. Warmuth, The minimum consistent DFA problem cannot be approximated within and polynomial, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.421-432, May 14-17, 1989, Seattle, Washington, United States
Wolfgang Maass , Michael Schmitt, On the complexity of learning for a spiking neuron (extended abstract), Proceedings of the tenth annual conference on Computational learning theory, p.54-61, July 06-09, 1997, Nashville, Tennessee, United States
Víctor Dalmau, A dichotomy theorem for learning quantified Boolean formulas, Proceedings of the tenth annual conference on Computational learning theory, p.193-200, July 06-09, 1997, Nashville, Tennessee, United States
 
Nina Mishra , Dan Oblinger , Leonard Pitt, Sublinear time approximate clustering, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, p.439-447, January 07-09, 2001, Washington, D.C., United States
Peter Auer , Philip M. Long, Simulating access to hidden information while learning, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.263-272, May 23-25, 1994, Montreal, Quebec, Canada
 
Dmitry Gavinsky, Optimally-smooth adaptive boosting and application to agnostic learning, The Journal of Machine Learning Research, 4, p.101-117, 12/1/2003
Anthony M. Zador , Barak A. Pearlmutter, VC dimension of an integrate-and-fire neuron model, Proceedings of the ninth annual conference on Computational learning theory, p.10-18, June 28-July 01, 1996, Desenzano del Garda, Italy
 
LiMin Fu, An Expert Network for DNA Sequence Analysis, IEEE Intelligent Systems, v.14 n.1, p.65-71, January 1999
 
S. R. Kulkarni , S. K. Mitter , J. N. Tsitsiklis , O. Zeitouni, PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.9, p.933-942, September 1993
Shai Ben-David , Nader H. Bshouty , Eyal Kushilevitz, A composition theorem for learning algorithms with applications to geometric concept classes, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.324-333, May 04-06, 1997, El Paso, Texas, United States
 
Philip K. Chan , Salvatore J. Stolfo, On the Accuracy of Meta-learning for Scalable Data Mining, Journal of Intelligent Information Systems, v.8 n.1, p.5-28, Jan./Feb. 1997
 
Lorenza Saitta , Francesco Bergadano, Pattern Recognition and Valiant's Learning Framework, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.2, p.145-155, February 1993
 
Nader H. Bshouty , Lynn Burroughs, Maximizing Agreements with One-Sided Error with Applications to Heuristic Learning, Machine Learning, v.59 n.1-2, p.99-123, May 2005
David Lipton, Logical authentication method, ACM SIGSAC Review, v.4 n.2, p.9-20, Spring 1986
Wee Sun Lee , Peter L. Bartlett , Robert C. Williamson, On efficient agnostic learning of linear combinations of basis functions, Proceedings of the eighth annual conference on Computational learning theory, p.369-376, July 05-08, 1995, Santa Cruz, California, United States
Rakesh D. Barve , Philip M. Long, On the complexity of learning from drifting distributions, Proceedings of the ninth annual conference on Computational learning theory, p.122-130, June 28-July 01, 1996, Desenzano del Garda, Italy
 
Ran Avnimelech , Nathan Intrator, Boosting regression estimators, Neural Computation, v.11 n.2, p.499-520, Feb. 15, 1999
 
Yoav Freund , H. Sebastian Seung , Eli Shamir , Naftali Tishby, Selective Sampling Using the Query by Committee Algorithm, Machine Learning, v.28 n.2-3, p.133-168, Aug./Sept. 1997
 
Martin Anthony, Probabilistic ’generalization‘ of functions and dimension-based uniform convergence results, Statistics and Computing, v.8 n.1, p.5-14, 1998
Lihong Li , Michael L. Littman , Thomas J. Walsh, Knows what it knows: a framework for self-aware learning, Proceedings of the 25th international conference on Machine learning, p.568-575, July 05-09, 2008, Helsinki, Finland
 
Amitava Karmaker , Kihoon Yoon , Chau Nguyen , Stephen Kwek, iBoost: Boosting using an instance-based exponential weighting scheme, International Journal of Hybrid Intelligent Systems, v.4 n.4, p.243-254, December 2007
Mrutyunjaya Panda , Manas Ranjan Patra, Ensemble of classifiers for detecting network intrusion, Proceedings of the International Conference on Advances in Computing, Communication and Control, January 23-24, 2009, Mumbai, India
Scott Decatur , Oded Goldreich , Dana Ron, Computational sample complexity, Proceedings of the tenth annual conference on Computational learning theory, p.130-142, July 06-09, 1997, Nashville, Tennessee, United States
Philip K. Chan , Salvatore J. Stolfo, Experiments on multistrategy learning by meta-learning, Proceedings of the second international conference on Information and knowledge management, p.314-323, November 01-05, 1993, Washington, D.C., United States
Ana-Maria Popescu , Oren Etzioni , Henry Kautz, Towards a theory of natural language interfaces to databases, Proceedings of the 8th international conference on Intelligent user interfaces, January 12-15, 2003, Miami, Florida, USA
 
Nader H. Bshouty , Nadav Eiron , Eyal Kushilevitz, PAC learning with nasty noise, Theoretical Computer Science, v.288 n.2, p.255-275, 16 October 2002
Stephen S. Kwek, An apprentice learning model (extended abstract), Proceedings of the twelfth annual conference on Computational learning theory, p.63-74, July 07-09, 1999, Santa Cruz, California, United States
Léa Meyer, Aspects of complexity of conservative probabilistic learning, Proceedings of the eleventh annual conference on Computational learning theory, p.72-78, July 24-26, 1998, Madison, Wisconsin, United States
Stuart J. Russell, An architecture for bounded rationality, ACM SIGART Bulletin, v.2 n.4, p.146-150, Aug. 1991
 
Víictor Dalmau, A Dichotomy Theorem for Learning Quantified Boolean Formulas, Machine Learning, v.35 n.3, p.207-224, June 1999
 
Bart Massey , Mick Thomure , Raya Budrevich , Scott Long, Learning spam: simple techniques for freely-available software, Proceedings of the USENIX Annual Technical Conference 2003 on USENIX Annual Technical Conference, p.13-13, June 09-14, 2003, San Antonio, Texas
 
Wenxin Jiang, The VC Dimension for Mixtures of Binary Classifiers, Neural Computation, v.12 n.6, p.1293-1301, June 2000
 
Peter Auer , Nicolò Cesa-Bianchi, On-line learning with malicious noise and the closure algorithm, Annals of Mathematics and Artificial Intelligence, v.23 n.1-2, p.83-99, 1998
 
Alexander L. Strehl , Michael L. Littman, An analysis of model-based Interval Estimation for Markov Decision Processes, Journal of Computer and System Sciences, v.74 n.8, p.1309-1331, December, 2008
Michael Kearns , Ming Li , Leslie Valiant, Learning Boolean formulas, Journal of the ACM (JACM), v.41 n.6, p.1298-1328, Nov. 1994
 
Martin Anthony, Some connections between learning and optimization, Discrete Applied Mathematics, v.144 n.1-2, p.17-26, 30 November 2004
 
Steffen Lange , Jochen Nessel, Decision lists over regular patterns, Theoretical Computer Science, v.298 n.1, p.71-87, 4 April 2003
 
Alexander Clark , Franck Thollard, PAC-learnability of Probabilistic Deterministic Finite State Automata, The Journal of Machine Learning Research, 5, p.473-497, 12/1/2004
György Turán, Lower bounds for PAC learning with queries, Proceedings of the sixth annual conference on Computational learning theory, p.384-391, July 26-28, 1993, Santa Cruz, California, United States
Peter L. Bartlett , Philip M. Long , Robert C. Williamson, Fat-shattering and the learnability of real-valued functions, Proceedings of the seventh annual conference on Computational learning theory, p.299-310, July 12-15, 1994, New Brunswick, New Jersey, United States
Leslie G. Valiant, Robust logics, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.642-651, May 01-04, 1999, Atlanta, Georgia, United States
 
Steven Hampson , Dennis Kibler, Minimum Generalization Via Reflection: A Fast Linear Threshold Learner, Machine Learning, v.37 n.1, p.51-73, Oct. 1999
 
Vetle I. Torvik , Evangelos Triantaphyllou, Guided inference of nested monotone Boolean functions, Information Sciences—Informatics and Computer Science: An International Journal, 151, p.171-200, May 2003
Nicolas Baskiotis , Michèle Sebag, C4.5 competence map: a phase transition-inspired approach, Proceedings of the twenty-first international conference on Machine learning, p.10, July 04-08, 2004, Banff, Alberta, Canada
 
Elchanan Mossel , Ryan O'Donnell , Rocco A. Servedio, Learning functions of k relevant variables, Journal of Computer and System Sciences, v.69 n.3, p.421-434, November 2004
Michael O'Mahony , Neil Hurley , Nicholas Kushmerick , Guénolé Silvestre, Collaborative recommendation: A robustness analysis, ACM Transactions on Internet Technology (TOIT), v.4 n.4, p.344-377, November 2004
Avrim Blum , Prasad Chalasani , Sally A. Goldman , Donna K. Slonim, Learning with unreliable boundary queries, Proceedings of the eighth annual conference on Computational learning theory, p.98-107, July 05-08, 1995, Santa Cruz, California, United States
Adam Tauman Kalai , Yishay Mansour , Elad Verbin, On agnostic boosting and parity learning, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
 
Stephen Soderland, Learning Information Extraction Rules for Semi-Structured and Free Text, Machine Learning, v.34 n.1-3, p.233-272, Feb. 1999
 
Dov Monderer , Moshe Tennenholtz, Dynamic non-Bayesian decision making in multi-agent systems, Annals of Mathematics and Artificial Intelligence, v.25 n.1-2, p.91-106, 1999
 
Junghuei Chen , Russell Deaton , Yu-Zhen Wang, A DNA-based memory with in vitro learning and associative recall, Natural Computing: an international journal, v.4 n.2, p.83-101, June 2005
Vitaly Feldman, Evolvability from learning algorithms, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
Moni Naor , Guy N. Rothblum, Learning to impersonate, Proceedings of the 23rd international conference on Machine learning, p.649-656, June 25-29, 2006, Pittsburgh, Pennsylvania
Avrim Blum , Merrick Furst , Jeffrey Jackson , Michael Kearns , Yishay Mansour , Steven Rudich, Weakly learning DNF and characterizing statistical query learning using Fourier analysis, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.253-262, May 23-25, 1994, Montreal, Quebec, Canada
Dana Angluin , Michael Kharitonov, When won't membership queries help?, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.444-454, May 05-08, 1991, New Orleans, Louisiana, United States
 
Jochen Nessel , Steffen Lange, Learning erasing pattern languages with queries, Theoretical Computer Science, v.348 n.1, p.41-57, 2 December 2005
 
N. S. V. Rao , E. M. Oblow , C. W. Glover, Learning Separations by Boolean Combinations of Half-Spaces, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.16 n.7, p.765-768, July 1994
 
M. P. Harper , C. M. White , W. Wang , M. T. Johnson , R. A. Helzerman, The effectiveness of corpus-induced dependency grammars for post-processing speech, Proceedings of the first conference on North American chapter of the Association for Computational Linguistics, p.102-109, April 29-May 04, 2000, Seattle, Washington
William W. Cohen, The dual DFA learning problem (extended abstract): hardness results for programming by demonstration and learning first-order representations, Proceedings of the ninth annual conference on Computational learning theory, p.29-40, June 28-July 01, 1996, Desenzano del Garda, Italy
 
Nageswara S. V. Rao , David B. Reister , Jacob Barhen, Information Fusion Methods Based on Physical Laws, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.1, p.66-77, January 2005
Dale Schuurmans , Russell Greiner, Sequential PAC learning, Proceedings of the eighth annual conference on Computational learning theory, p.377-384, July 05-08, 1995, Santa Cruz, California, United States
Charles W. Glover , Nageswara S. V. Rao , E. M. Oblow, Hybrid pattern recognition system capable of self-modification, Proceedings of the second international conference on Information and knowledge management, p.239-244, November 01-05, 1993, Washington, D.C., United States
 
Sanjay Jain , Steffen Lange , Sandra Zilles, A general comparison of language learning from examples and from queries, Theoretical Computer Science, v.387 n.1, p.51-66, November, 2007
Michael Kearns , Yishay Mansour , Dana Ron , Ronitt Rubinfeld , Robert E. Schapire , Linda Sellie, On the learnability of discrete distributions, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.273-282, May 23-25, 1994, Montreal, Quebec, Canada
 
Adam R. Klivans , Alexander A. Sherstov, Unconditional lower bounds for learning intersections of halfspaces, Machine Learning, v.69 n.2-3, p.97-114, December 2007
Ryan O'Donnell , Rocco A. Servedio, New degree bounds for polynomial threshold functions, Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, June 09-11, 2003, San Diego, CA, USA
 
George V. Lashkia , Laurence Anthony, An inductive learning method for medical diagnosis, Pattern Recognition Letters, v.24 n.1-3, p.273-282, January 2003
 
Detlef Sieling, The complexity of minimizing and learning OBDDs and FBDDs, Discrete Applied Mathematics, v.122 n.1-3, p.263-282, 15 October 2002
 
Steffen Lange , Gunter Grieser , Klaus P. Jantke, Advanced elementary formal systems, Theoretical Computer Science, v.298 n.1, p.51-70, 4 April 2003
 
Andreas Albrecht , Chak-Kuen Wong, Approximation of Boolean Functions by Local Search, Computational Optimization and Applications, v.27 n.1, p.53-82, January 2004
 
Kazushi Ikeda, An asymptotic statistical theory of polynomial kernel methods, Neural Computation, v.16 n.8, p.1705-1719, August 2004
Ronald L. Rivest , Yiqun Lisa Yin, Being taught can be faster than asking questions, Proceedings of the eighth annual conference on Computational learning theory, p.144-151, July 05-08, 1995, Santa Cruz, California, United States
Yoav Freund , Michael Kearns , Dana Ron , Ronitt Rubinfeld , Robert E. Schapire , Linda Sellie, Efficient learning of typical finite automata from random walks, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.315-324, May 16-18, 1993, San Diego, California, United States
Philip M. Long, On the sample complexity of learning functions with bounded variation, Proceedings of the eleventh annual conference on Computational learning theory, p.126-133, July 24-26, 1998, Madison, Wisconsin, United States
Susanne Kaufmann , Frank Stephan, Resource bounded next value and explanatory identification: learning automata, patterns and polynomials on-line, Proceedings of the tenth annual conference on Computational learning theory, p.263-274, July 06-09, 1997, Nashville, Tennessee, United States
 
Yi Li , Philip M. Long , Aravind Srinivasan, Improved bounds on the sample complexity of learning, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms, p.309-318, January 09-11, 2000, San Francisco, California, United States
 
Maria-Florina Balcan , Avrim Blum , Nathan Srebro, A theory of learning with similarity functions, Machine Learning, v.72 n.1-2, p.89-112, August 2008
 
Christopher K. I. Williams , Francesco Vivarelli, Upper and Lower Bounds on the Learning Curve for Gaussian Processes, Machine Learning, v.40 n.1, p.77-102, July 2000
Leonard Pitt , Manfred K. Warmuth, The minimum consistent DFA problem cannot be approximated within any polynomial, Journal of the ACM (JACM), v.40 n.1, p.95-142, Jan. 1993
 
Bala Kalyanasundaram , Mahendran Velauthapillai, Taming teams with mind changes, Journal of Computer and System Sciences, v.74 n.4, p.513-526, June, 2008
Leslie G. Valiant, Evolvability, Journal of the ACM (JACM), v.56 n.1, p.1-21, January 2009
 
Vitaly Feldman , Shrenik Shah, Separating models of learning with faulty teachers, Theoretical Computer Science, v.410 n.19, p.1903-1912, April, 2009
 
Michael Schmitt, On the Sample Complexity for Nonoverlapping Neural Networks, Machine Learning, v.37 n.2, p.131-141, Nov.1.1999
 
Bala Kalyanasundaram , Mahe Velauthapillai, Capabilities of Thoughtful Machines, Fundamenta Informaticae, v.74 n.2,3, p.329-340, August 2006
Nader H. Bshouty , Sally A. Goldman , Thomas R. Hancock , Sleiman Matar, Asking questions to minimize errors, Proceedings of the sixth annual conference on Computational learning theory, p.41-50, July 26-28, 1993, Santa Cruz, California, United States
David Gillman , Michael Sipser, Inference and minimization of hidden Markov chains, Proceedings of the seventh annual conference on Computational learning theory, p.147-158, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Rocco A. Servedio, On learning monotone DNF under product distributions, Information and Computation, v.193 n.1, p.57-74, 25 August 2004
Tatsuya Akutsu , Satoru Miyano , Satoru Kuhara, Algorithms for identifying Boolean networks and related biological networks based on matrix multiplication and fingerprint function, Proceedings of the fourth annual international conference on Computational molecular biology, p.8-14, April 2000, Tokyo, Japan
William W. Cohen , Haym Hirsh, Learnability of description logics, Proceedings of the fifth annual workshop on Computational learning theory, p.116-127, July 27-29, 1992, Pittsburgh, Pennsylvania, United States
Michael Kearns, Efficient noise-tolerant learning from statistical queries, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.392-401, May 16-18, 1993, San Diego, California, United States
Michael Kharitonov, Cryptographic hardness of distribution-specific learning, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.372-381, May 16-18, 1993, San Diego, California, United States
Martin Anthony , Sean B. Holden, Cross-validation for binary classification by real-valued functions: theoretical analysis, Proceedings of the eleventh annual conference on Computational learning theory, p.218-229, July 24-26, 1998, Madison, Wisconsin, United States
 
Andreas Birkendorf , Hans Ulrich Simon, Using computational learning strategies as a tool for combinatorial optimization, Annals of Mathematics and Artificial Intelligence, v.22 n.3-4, p.237-257, 1998
 
Adam R. Klivans , Rocco A. Servedio, Learning intersections of halfspaces with a margin, Journal of Computer and System Sciences, v.74 n.1, p.35-48, February, 2008
 
Tianming Hu , Sam Yuan Sung, Consensus clustering, Intelligent Data Analysis, v.9 n.6, p.551-565, November 2005
Nader H. Bshouty , Christino Tamon, On the Fourier spectrum of monotone functions, Journal of the ACM (JACM), v.43 n.4, p.747-770, July 1996
Dana Angluin , Lisa Hellerstein , Marek Karpinski, Learning read-once formulas with queries, Journal of the ACM (JACM), v.40 n.1, p.185-210, Jan. 1993
 
Peter Rossmanith , Thomas Zeugmann, Stochastic Finite Learning of the Pattern Languages, Machine Learning, v.44 n.1-2, p.67-91, July-August 2001
Nader H. Bshouty , Jeffrey C. Jackson, Learning DNF over the uniform distribution using a quantum example oracle, Proceedings of the eighth annual conference on Computational learning theory, p.118-127, July 05-08, 1995, Santa Cruz, California, United States
 
Andreas Engel, Complexity of learning in artificial neural networks, Theoretical Computer Science, v.265 n.1_2, p.285-306, 08/28/2001
 
Andreas Birkendorf , Eli Dichterman , Jeffrey Jackson , Norbert Klasner , Hans Ulrich Simon, On Restricted-Focus-of-Attention Learnability of Boolean Functions, Machine Learning, v.30 n.1, p.89-123, Jan. 1998
 
Pierre Dupont , Bernard Lambeau , Christophe Damas , Axel van Lamsweerde, THE QSM ALGORITHM AND ITS APPLICATION TO SOFTWARE BEHAVIOR MODEL INDUCTION, Applied Artificial Intelligence, v.22 n.1-2, p.77-115, January 2008
 
Jiří Šíma , Jiří Sgall, On the Nonlearnability of a Single Spiking Neuron, Neural Computation, v.17 n.12, p.2635-2647, December 2005
 
Ricard Gavaldà , Pascal Tesson , Denis Thérien, Learning expressions and programs over monoids, Information and Computation, v.204 n.2, p.177-209, February 2006
 
Steffen Lange , Gunter Grieser, Variants of iterative learning, Theoretical Computer Science, v.292 n.2, p.359-376, 27 January 2003
 
Richard Nock, Complexity in the case against accuracy estimation, Theoretical Computer Science, v.301 n.1-3, p.143-165, 14 May 2003
 
Philip M. Long, Efficient algorithms for learning functions with bounded variation, Information and Computation, v.188 n.1, p.99-115, 10 January 2004
 
Roni Khardon , Dan Roth, Learning to Reason with a Restricted View, Machine Learning, v.35 n.2, p.95-116, May 1999
Ziv Bar-Yossef , Ravi Kumar , D. Sivakumar, Sampling algorithms: lower bounds and applications, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.266-275, July 2001, Hersonissos, Greece
 
Michael Schmitt, Identification criteria and lower bounds for perceptron-like learning rules, Neural Computation, v.10 n.1, p.235-250, Jan. 1, 1998
 
Daniil Ryabko, Pattern Recognition for Conditionally Independent Data, The Journal of Machine Learning Research, 7, p.645-664, 12/1/2006
Rocco A. Servedio, Computational sample complexity and attribute-efficient learning, Proceedings of the thirty-first annual ACM symposium on Theory of computing, p.701-710, May 01-04, 1999, Atlanta, Georgia, United States
Roni Khardon, Learning first order universal Horn expressions, Proceedings of the eleventh annual conference on Computational learning theory, p.154-165, July 24-26, 1998, Madison, Wisconsin, United States
Jeffrey C. Jackson , Adam R. Klivans , Rocco A. Servedio, Learnability beyond AC0, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
Lisa Hellerstein , Vijay Raghavan , Krishnan Pillaipakkamnatt , Dawn Wilkins, How many queries are needed to learn?, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.190-199, May 29-June 01, 1995, Las Vegas, Nevada, United States
 
Gunnar Rätsch , Sebastian Mika , Bernhard Schölkopf , Klaus-Robert Müller, Constructing Boosting Algorithms from SVMs: An Application to One-Class Classification, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.24 n.9, p.1184-1199, September 2002
 
D. L. Shrestha , D. P. Solomatine, Experiments with AdaBoost.RT, an improved boosting scheme for regression, Neural Computation, v.18 n.7, p.1678-1710, July 2006
 
Takashi Horiyama , Toshihide Ibaraki, Ordered binary decision diagrams as knowledge-bases, Artificial Intelligence, v.136 n.2, p.189-213, April 2002
Martin Anthony , Sean B. Holden, On the power of polynomial discriminators and radial basis function networks, Proceedings of the sixth annual conference on Computational learning theory, p.158-164, July 26-28, 1993, Santa Cruz, California, United States
Russell Greiner, Learning efficient query processing strategies, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.33-46, June 02-05, 1992, San Diego, California, United States
 
Adam R. Klivans , Alexander A. Sherstov, Cryptographic hardness for learning intersections of halfspaces, Journal of Computer and System Sciences, v.75 n.1, p.2-12, January, 2009
Elchanan Mossel , Sébastien Roch, Learning nonsingular phylogenies and hidden Markov models, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, May 22-24, 2005, Baltimore, MD, USA
 
Jonathan E. Cook , Zhidian Du, Discovering thread interactions in a concurrent system, Journal of Systems and Software, v.77 n.3, p.285-297, September 2005
 
Russell Greiner , Wei Zhou, Structural extension to logistic regression: discriminative parameter learning of belief net classifiers, Eighteenth national conference on Artificial intelligence, p.167-173, July 28-August 01, 2002, Edmonton, Alberta, Canada
 
Ivan Bruha , Josef Tkadlec, Rule quality for multiple-rule classifier: Empirical expertise and theoretical methodology, Intelligent Data Analysis, v.7 n.2, p.99-124, April 2003
 
Marc Fischlin, Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions, Theoretical Computer Science, v.268 n.2, p.199-219, 17 October 2001
 
Richard Nock , Frank Nielsen, A Real generalization of discrete AdaBoost, Artificial Intelligence, v.171 n.1, p.25-41, January, 2007
Lisa Hellerstein , Krishnan Pillaipakkamnatt , Vijay Raghavan , Dawn Wilkins, How many queries are needed to learn?, Journal of the ACM (JACM), v.43 n.5, p.840-862, Sept. 1996
 
Nader H. Bshouty , Vitaly Feldman, On using extended statistical queries to avoid membership queries, The Journal of Machine Learning Research, 2, p.359-395, 3/1/2002
 
Sally A. Goldman , Stephen D. Scott, A Theoretical and Empirical Study of a Noise-TolerantAlgorithm to Learn Geometric Patterns, Machine Learning, v.37 n.1, p.5-49, Oct. 1999
 
Renato Vicente , Osame Kinouchi , Nestor Caticha, Statistical Mechanics of Online Learning of Drifting Concepts: A Variational Approach, Machine Learning, v.32 n.2, p.179-201, Aug. 1998
 
Martin Jansche, Learning Local Transductions Is Hard, Journal of Logic, Language and Information, v.13 n.4, p.439-455, March 2004
Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki, Noise-tolerant distribution-free learning of general geometric concepts, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, p.151-160, May 22-24, 1996, Philadelphia, Pennsylvania, United States
 
Enes Eryarsoy , Gary J. Koehler , Haldun Aytug, Using domain-specific knowledge in generalization error bounds for support vector machine learning, Decision Support Systems, v.46 n.2, p.481-491, January, 2009
 
Seishi Okamoto , Nobuhiro Yugami, Effects of domain characteristics on instance-based learning algorithms, Theoretical Computer Science, v.298 n.1, p.207-233, 4 April 2003
 
Marta Arias , Aaron Feigelson , Roni Khardon , Rocco A. Servedio, Polynomial certificates for propositional classes, Information and Computation, v.204 n.5, p.816-834, May 2006
 
Luigi Iannone , Ignazio Palmisano , Nicola Fanizzi, An algorithm based on counterfactuals for concept learning in the Semantic Web, Applied Intelligence, v.26 n.2, p.139-159, April 2007
 
Steffen Lange , Gunter Grieser, On the power of incremental learning, Theoretical Computer Science, v.288 n.2, p.277-307, 16 October 2002
 
Adam R. Klivans , Rocco A. Servedio, Boosting and Hard-Core Set Construction, Machine Learning, v.51 n.3, p.217-238, June 2003
 
Sally A. Goldman , Stephen S. Kwek , Stephen D. Scott, Learning from examples with unspecified attribute values, Information and Computation, v.180 n.2, p.82-100, 29 January 2003
 
Victor Dalmau , Peter Jeavons, Learnability of quantified formulas, Theoretical Computer Science, v.306 n.1-3, p.485-511, 5 September 2003
 
Chris Thornton, What do Constructive Learners Really Learn?, Artificial Intelligence Review, v.13 n.4, p.249-257, August 1999
 
Rajesh Parekh , Vasant G. Honavar, Learning DFA from Simple Examples, Machine Learning, v.44 n.1-2, p.9-35, July-August 2001
M. Kearns , L. G. Valiant, Crytographic limitations on learning Boolean formulae and finite automata, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.433-444, May 14-17, 1989, Seattle, Washington, United States
Nicolò Cesa-Bianchi , Yoav Freund , David P. Helmbold , David Haussler , Robert E. Schapire , Manfred K. Warmuth, How to use expert advice, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.382-391, May 16-18, 1993, San Diego, California, United States
 
Misha Alekhnovich , Mark Braverman , Vitaly Feldman , Adam R. Klivans , Toniann Pitassi, The complexity of properly learning simple concept classes, Journal of Computer and System Sciences, v.74 n.1, p.16-34, February, 2008
 
Geoffrey I. Webb , Michael J. Pazzani , Daniel Billsus, Machine Learning for User Modeling, User Modeling and User-Adapted Interaction, v.11 n.1-2, p.19-29, 2001
Paolo Ferragina , Raffaele Giancarlo , Giovanni Manzini , Marinella Sciortino, Boosting textual compression in optimal linear time, Journal of the ACM (JACM), v.52 n.4, p.688-713, July 2005
 
Pei Wang, Problem solving with insufficient resources, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, v.12 n.5, p.673-700, October 2005
 
Nigel Duffy , David Helmbold, Boosting Methods for Regression, Machine Learning, v.47 n.2-3, p.153-200, May-June 2002
Stephen Kwek , Leonard Pitt, PAC learning intersections of halfspaces with membership queries (extended abstract), Proceedings of the ninth annual conference on Computational learning theory, p.244-254, June 28-July 01, 1996, Desenzano del Garda, Italy
 
Joel Ratsaby, On learning multicategory classification with sample queries, Information and Computation, v.185 n.2, p.298-327, September 15, 2003
Leonard Pitt , Leslie G. Valiant, Computational limitations on learning from examples, Journal of the ACM (JACM), v.35 n.4, p.965-984, Oct. 1988
Michael Kearns, Efficient noise-tolerant learning from statistical queries, Journal of the ACM (JACM), v.45 n.6, p.983-1006, Nov. 1998
 
Artur S. d'Avila Garcez , Luís C. Lamb, A connectionist computational model for epistemic and temporal reasoning, Neural Computation, v.18 n.7, p.1711-1738, July 2006
Petros Drineas , Iordanis Kerenidis , Prabhakar Raghavan, Competitive recommendation systems, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing, May 19-21, 2002, Montreal, Quebec, Canada
 
Frank J. Balbach, Measuring teachability using variants of the teaching dimension, Theoretical Computer Science, v.397 n.1-3, p.94-113, May, 2008
 
Roland Nilsson , José M. Peña , Johan Björkegren , Jesper Tegnér, Consistent Feature Selection for Pattern Recognition in Polynomial Time, The Journal of Machine Learning Research, 8, p.589-612, 5/1/2007
 
Roni Khardon , Gabriel Wachman, Noise Tolerant Variants of the Perceptron Algorithm, The Journal of Machine Learning Research, 8, p.227-248, 5/1/2007
Maria-Florina Balcan , Avrim Blum , Santosh Vempala, A discriminative framework for clustering via similarity functions, Proceedings of the 40th annual ACM symposium on Theory of computing, May 17-20, 2008, Victoria, British Columbia, Canada
Roberto Battiti , Marco Protasi, Reactive search, a history-sensitive heuristic for MAX-SAT, Journal of Experimental Algorithmics (JEA), 2, p.2-es, 1997
 
Philip M. Long , Vinsensius Berlian Vega, Boosting and Microarray Data, Machine Learning, v.52 n.1-2, p.31-44, July-August 2003
 
Kouichi Hirata, Prediction-hardness of acyclic conjunctive queries, Theoretical Computer Science, v.348 n.1, p.84-94, 2 December 2005
 
Natalia L. Komarova , Martin A. Nowak, Population dynamics of grammar acquisition, Simulating the evolution of language, Springer-Verlag New York, Inc., New York, NY, 2002
 
David T. Hau , Enrico W. Coiera, Learning Qualitative Models of Dynamic Systems, Machine Learning, v.26 n.2-3, p.177-211, Feb./March 1, 1997
Claudio Gentile , David P. Helmbold, Improved lower bounds for learning from noisy examples: an information-theoretic approach, Proceedings of the eleventh annual conference on Computational learning theory, p.104-115, July 24-26, 1998, Madison, Wisconsin, United States
Nader H. Bshouty , Sally A. Goldman , H. David Mathias , Subhash Suri , Hisao Tamaki, Noise-tolerant distribution-free learning of general geometric concepts, Journal of the ACM (JACM), v.45 n.5, p.863-890, Sept. 1998
Nader H. Bshouty , Sally A. Goldman , H. David Mathias, Noise-tolerant parallel learning of geometric concepts, Proceedings of the eighth annual conference on Computational learning theory, p.345-352, July 05-08, 1995, Santa Cruz, California, United States
Peter Auer , Philip M. Long , Aravind Srinivasan, Approximating hyper-rectangles: learning and pseudo-random sets, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.314-323, May 04-06, 1997, El Paso, Texas, United States
 
Thomas Erlebach , Peter Rossmanith , Hans Stadtherr , Agelika Steger , Thomas Zeugmann, Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries, Theoretical Computer Science, v.261 n.1, p.119-156, 06/17/2001
 
Lance Fortnow , Adam R. Klivans, Efficient learning algorithms yield circuit lower bounds, Journal of Computer and System Sciences, v.75 n.1, p.27-36, January, 2009
 
Benjamin W. Wah, Generalization and Generalizability Measures, IEEE Transactions on Knowledge and Data Engineering, v.11 n.1, p.175-186, January 1999
Marco Barreno , Blaine Nelson , Russell Sears , Anthony D. Joseph , J. D. Tygar, Can machine learning be secure?, Proceedings of the 2006 ACM Symposium on Information, computer and communications security, March 21-24, 2006, Taipei, Taiwan
 
François Denis, Learning Regular Languages from Simple Positive Examples, Machine Learning, v.44 n.1-2, p.37-66, July-August 2001
Sally A. Goldman , Stephen S. Kwek , Stephen D. Scott, Learning from examples with unspecified attribute values (extended abstract), Proceedings of the tenth annual conference on Computational learning theory, p.231-242, July 06-09, 1997, Nashville, Tennessee, United States
Lane A. Hemaspaandra, SIGACT News complexity theory column 32, ACM SIGACT News, v.32 n.2, June 2001
Michael Kearns , Leslie Valiant, Cryptographic limitations on learning Boolean formulae and finite automata, Journal of the ACM (JACM), v.41 n.1, p.67-95, Jan. 1994
 
Nader H. Bshouty , Elchanan Mossel , Ryan O'Donnell , Rocco A. Servedio, Learning DNF from random walks, Journal of Computer and System Sciences, v.71 n.3, p.250-265, October 2005
 
Andris Ambainis, Probabilistic inductive inference: a survey, Theoretical Computer Science, v.264 n.1, p.155-167, 08/06/2001
Leslie G. Valiant, A neuroidal architecture for cognitive computation, Journal of the ACM (JACM), v.47 n.5, p.854-882, Sept. 2000
 
Balaji Krishnapuram , Lawrence Carin , Mario A. T. Figueiredo , Alexander J. Hartemink, Sparse Multinomial Logistic Regression: Fast Algorithms and Generalization Bounds, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.6, p.957-968, June 2005
 
Nigel Duffy , David Helmbold, A geometric approach to leveraging weak learners, Theoretical Computer Science, v.284 n.1, p.67-108, 6 July 2002
Michael Frazier , Leonard Pitt, CLASSIC learning, Proceedings of the seventh annual conference on Computational learning theory, p.23-34, July 12-15, 1994, New Brunswick, New Jersey, United States
Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Proceedings of the sixth annual conference on Computational learning theory, p.165-174, July 26-28, 1993, Santa Cruz, California, United States
F. Bergadano, Test case generation by means of learning techniques, ACM SIGSOFT Software Engineering Notes, v.18 n.5, p.149-162, Dec. 1993
Adam R. Klivans , Rocco Servedio, Learning DNF in time, Proceedings of the thirty-third annual ACM symposium on Theory of computing, p.258-265, July 2001, Hersonissos, Greece
 
La Meyer, Aspects of complexity of probabilistic learning under monotonicity constraints, Theoretical Computer Science, v.268 n.2, p.275-322, 17 October 2001
 
Prasad Tadepalli , Stuart Russell, Learning from Examples and Membership Queries with Structured Determinations, Machine Learning, v.32 n.3, p.245-295, Sept. 1998
L. Pitt, Probabilistic inductive inference, Journal of the ACM (JACM), v.36 n.2, p.383-433, April 1989
 
Paul W. Goldberg, Learning fixed-dimension linear thresholds from fragmented data, Information and Computation, v.171 n.1, p.98-122, November 25, 2001
 
John Case , Sanjay Jain , Rüdiger Reischuk , Frank Stephan , Thomas Zeugmann, Learning a subclass of regular patterns in polynomial time, Theoretical Computer Science, v.364 n.1, p.115-131, 2 November 2006
 
Martin Anthony, Aspects of discrete mathematics and probability in the theory of machine learning, Discrete Applied Mathematics, v.156 n.6, p.883-902, March, 2008
 
Alexander A. Sherstov, Halfspace Matrices, Computational Complexity, v.17 n.2, p.149-178, May 2008
 
Thomas Eiter , Toshihide Ibaraki , Kazuhisha Makino, Decision lists and related Boolean functions, Theoretical Computer Science, v.270 n.1-2, p.493-524, January
 
Jochen Burghardt, E-generalization using grammars, Artificial Intelligence, v.165 n.1, p.1-35, June 2005
 
Daniel Borrajo , Manuela Veloso, Lazy Incremental Learning of Control Knowledge for EfficientlyObtaining Quality Plans, Artificial Intelligence Review, v.11 n.1-5, p.371-405, Feb. 1997
 
Michael Collins, Parameter estimation for statistical parsing models: theory and practice of distribution-free methods, New developments in parsing technology, Kluwer Academic Publishers, Norwell, MA, 2004
 
William W. Cohen, Hardness Results for Learning First-Order Representations and Programming by Demonstration, Machine Learning, v.30 n.1, p.57-87, Jan. 1998
Vitaly Feldman, Hardness of approximate two-level logic minimization and PAC learning with membership queries, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, May 21-23, 2006, Seattle, WA, USA
 
Vitaly Feldman, Hardness of approximate two-level logic minimization and PAC learning with membership queries, Journal of Computer and System Sciences, v.75 n.1, p.13-26, January, 2009
 
Dan Roth, Learning in natural language: theory and algorithmic approaches, Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning, September 13-14, 2000, Lisbon, Portugal
Michael Frazier , Sally Goldman , Nina Mishra , Leonard Pitt, Learning from a consistently ignorant teacher, Proceedings of the seventh annual conference on Computational learning theory, p.328-339, July 12-15, 1994, New Brunswick, New Jersey, United States
 
Giuliano Armano , Alessandro Orro , Eloisa Vargiu, MASSP3: a system for predicting protein secondary structure, EURASIP Journal on Applied Signal Processing, v.2006 n.1, p.54-54, 01 January
Nicolò Cesa-Bianchi , Yoav Freund , David Haussler , David P. Helmbold , Robert E. Schapire , Manfred K. Warmuth, How to use expert advice, Journal of the ACM (JACM), v.44 n.3, p.427-485, May 1997
Rocco A. Servedio, On PAC learning using Winnow, Perceptron, and a Perceptron-like algorithm, Proceedings of the twelfth annual conference on Computational learning theory, p.296-307, July 07-09, 1999, Santa Cruz, California, United States
 
Nageswara S.V. Rao, On Fusers that Perform Better than Best Sensor, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.23 n.8, p.904-909, August 2001
 
Oded Goldreich, Property testing in massive graphs, Handbook of massive data sets, Kluwer Academic Publishers, Norwell, MA, 2002
 
Martin Anthony, Generalization Error Bounds for Threshold Decision Lists, The Journal of Machine Learning Research, 5, p.189-217, 12/1/2004
 
Adam R. Klivans , Rocco A. Servedio, Learning DNF in time 2õ(n1/3), Journal of Computer and System Sciences, v.68 n.2, p.303-318, March 2004
William I. Gasarch , Carl H. Smith, Learning via queries, Journal of the ACM (JACM), v.39 n.3, p.649-674, July 1992
 
Hiroshi Sakamoto , Kouichi Hirata , Hiroki Arimura, Learning elementary formal systems with queries, Theoretical Computer Science, v.298 n.1, p.21-50, 4 April 2003
 
Ghaith Hammouri , Erdinç Öztürk , Berk Sunar, A tamper-proof and lightweight authentication scheme, Pervasive and Mobile Computing, v.4 n.6, p.807-818, December, 2008
 
Marco Botta , Attilio Giordana , Lorenza Saitta , Michèle Sebag, Relational learning as search in a critical region, The Journal of Machine Learning Research, 4, 12/1/2003
 
Shaul Markovitch , Asaf Shatil, Speedup learning for repair-based search by identifying redundant steps, The Journal of Machine Learning Research, 4, p.649-682, 12/1/2003
Roni Khardon , Dan Roth, Learning to reason, Journal of the ACM (JACM), v.44 n.5, p.697-725, Sept. 1997
 
Carlos Domingo , Nina Mishra , Leonard Pitt, Efficient Read-Restricted Monotone CNF/DNF Dualization by Learning with Membership Queries, Machine Learning, v.37 n.1, p.89-110, Oct. 1999
 
Christopher K. Monson , Kevin D. Seppi, A graphical model for evolutionary optimization, Evolutionary Computation, v.16 n.3, p.289-313, Fall 2008
Jörg-Uwe Kietz , Sašo Džeroski, Inductive logic programming and learnability, ACM SIGART Bulletin, v.5 n.1, p.22-32, Jan. 1994
Wolfgang Maass, Bounds for the computational power and learning complexity of analog neural nets, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.335-344, May 16-18, 1993, San Diego, California, United States
 
Dorian Aur , Mandar S. Jog, Neuronal spatial learning, Neural Processing Letters, v.25 n.1, p.31-47, February 2007
Francesco Bergadano , Daniele Gunetti, Testing by means of inductive program learning, ACM Transactions on Software Engineering and Methodology (TOSEM), v.5 n.2, p.119-145, April 1996
 
Rosa I. Arriaga , Santosh Vempala, An algorithmic theory of learning: Robust concepts and random projection, Machine Learning, v.63 n.2, p.161-182, May 2006
 
Roni Khardon, Learning Function-Free Horn Expressions, Machine Learning, v.37 n.3, p.241-275, Dec. 1999
 
Tina Eliassi-Rad , Jude Shavlik, A System for Building Intelligent Agents that Learn to Retrieve and Extract Information, User Modeling and User-Adapted Interaction, v.13 n.1-2, p.35-88, February -May 2003
 
David J. Stracuzzi , Paul E. Utgoff, Randomized Variable Elimination, The Journal of Machine Learning Research, 5, p.1331-1362, 12/1/2004
 
Thomas Zeugmann, From learning in the limit to stochastic finite learning, Theoretical Computer Science, v.364 n.1, p.77-97, 2 November 2006
 
Matthias Seeger, Pac-bayesian generalisation error bounds for gaussian process classification, The Journal of Machine Learning Research, 3, p.233-269, 3/1/2003
L. Thorne McCarty, On the role of prototypes in appellate legal argument (abstract), Proceedings of the 3rd international conference on Artificial intelligence and law, p.185-190, May 1991, Oxford, England
 
Rhys A. Newman, A New Model of Computation for Learning Vision Modules from Examples, Journal of Mathematical Imaging and Vision, v.11 n.1, p.45-63, Sept. 1999
 
Sally A. Goldman , Stephen S. Kwek, On learning unions of pattern languages and tree patterns in the mistake bound model, Theoretical Computer Science, v.288 n.2, p.237-254, 16 October 2002
 
Attilio Giordana , Lorenza Saitta, Phase Transitions in Relational Learning, Machine Learning, v.41 n.2, p.217-251, November 2000
 
Henning Fernau, Identification of function distinguishable languages, Theoretical Computer Science, v.290 n.3, p.1679-1711, 3 January 2003
 
Russell Greiner , Adam J. Grove , Dan Roth, Learning cost-sensitive active classifiers, Artificial Intelligence, v.139 n.2, p.137-174, August 2002
 
Tessa Lau , Steven A. Wolfman , Pedro Domingos , Daniel S. Weld, Programming by Demonstration Using Version Space Algebra, Machine Learning, v.53 n.1-2, p.111-156, October-November 2003
 
Enrique Vidal , Frank Thollard , Colin de la Higuera , Francisco Casacuberta , Rafael C. Carrasco, Probabilistic Finite-State Machines-Part II, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.7, p.1026-1039, July 2005
 
Adam R. Klivans , Ryan O'Donnell , Rocco A. Servedio, Learning intersections and thresholds of halfspaces, Journal of Computer and System Sciences, v.68 n.4, p.808-840, June 2004
 
Endre Boros , Takashi Horiyama , Toshihide Ibaraki , Kazuhisa Makino , Mutsunori Yagiura, Finding Essential Attributes from Binary Data, Annals of Mathematics and Artificial Intelligence, v.39 n.3, p.223-257, November 2003
 
Jose Hernandez-Orallo, Beyond the Turing Test, Journal of Logic, Language and Information, v.9 n.4, p.447-466, October 2000
 
Dan Roth , Ming-Hsuan Yang , Narendra Ahuja, Learning to recognize three-dimensional objects, Neural Computation, v.14 n.5, p.1071-1103, May 2002
 
Sébastien Gambs , Balázs Kégl , Esma Aïmeur, Privacy-preserving boosting, Data Mining and Knowledge Discovery, v.14 n.1, p.131-170, February 2007
 
Michael Collins , Terry Koo, Discriminative Reranking for Natural Language Parsing, Computational Linguistics, v.31 n.1, p.25-70, March 2005
 
Gabriela Alexe , Sorin Alexe , Tibérius O. Bonates , Alexander Kogan, Logical analysis of data --- the vision of Peter L. Hammer, Annals of Mathematics and Artificial Intelligence, v.49 n.1-4, p.265-312, April 2007
Leslie G. Valiant, Rationality, Proceedings of the eighth annual conference on Computational learning theory, p.3-14, July 05-08, 1995, Santa Cruz, California, United States
 
Raymond Kosala , Hendrik Blockeel , Maurice Bruynooghe , Jan Van den Bussche, Information extraction from structured documents using k-testable tree automaton inference, Data & Knowledge Engineering, v.58 n.2, p.129-158, August 2006
Jonathan E. Cook , Alexander L. Wolf, Discovering models of software processes from event-based data, ACM Transactions on Software Engineering and Methodology (TOSEM), v.7 n.3, p.215-249, July 1998
 
Artur S. d'Avila Garcez , Luís C. Lamb , Dov M. Gabbay, Connectionist computations of intuitionistic reasoning, Theoretical Computer Science, v.358 n.1, p.34-55, 31 July 2006
 
Huan Liu , Hiroshi Motoda, On Issues of Instance Selection, Data Mining and Knowledge Discovery, v.6 n.2, p.115-130, April 2002
Amos Beimel , Francesco Bergadano , Nader H. Bshouty , Eyal Kushilevitz , Stefano Varricchio, Learning functions represented as multiplicity automata, Journal of the ACM (JACM), v.47 n.3, p.506-530, May 2000
 
Aurélie Goulon-Sigwalt-Abram , Arthur Duprat , Gérard Dreyfus, From Hopfield nets to recursive networks to graph machines: numerical machine learning for structured data, Theoretical Computer Science, v.344 n.2-3, p.298-334, 17 November 2005
 
Henrik Jacobsson, The Crystallizing Substochastic Sequential Machine Extractor: CrySSMEx, Neural Computation, v.18 n.9, p.2211-2255, September 2006
Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Journal of the ACM (JACM), v.42 n.6, p.1146-1168, Nov. 1995
Oded Goldreich , Shari Goldwasser , Dana Ron, Property testing and its connection to learning and approximation, Journal of the ACM (JACM), v.45 n.4, p.653-750, July 1998
 
Yann Guermeur, VC Theory of Large Margin Multi-Category Classifiers, The Journal of Machine Learning Research, 8, p.2551-2594, 12/1/2007
Stephen Muggleton, Inductive logic programming: derivations, successes and shortcomings, ACM SIGART Bulletin, v.5 n.1, p.5-11, Jan. 1994
 
Martin E. Müller, Can user models be learned at all? Inherent problems in machine learning for user modelling, The Knowledge Engineering Review, v.19 n.1, p.61-88, March 2004
Anselm Blumer , A. Ehrenfeucht , David Haussler , Manfred K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Journal of the ACM (JACM), v.36 n.4, p.929-965, Oct. 1989
Moni Naor , Omer Reingold, Number-theoretic constructions of efficient pseudo-random functions, Journal of the ACM (JACM), v.51 n.2, p.231-262, March 2004
 
Wim Van Laer , Luc De Ra, How to upgrade propositional learners to first order logic: case study, Relational Data Mining, Springer-Verlag New York, Inc., New York, NY, 2001
 
J. Galindo , P. Tamayo, Credit Risk Assessment Using Statistical and MachineLearning: Basic Methodology and Risk Modeling Applications, Computational Economics, v.15 n.1-2, p.107-143, April 2000
 
Ricardo Vilalta , Youssef Drissi, A perspective view and survey of meta-learning, Artificial Intelligence Review, v.18 n.2, p.77-95, October 2002
 
Roni Khardon, Learning to Take Actions, Machine Learning, v.35 n.1, p.57-90, April 1999
 
José Hernández-Orallo , M. José Ramírez-Quintana, Predictive Software, Automated Software Engineering, v.8 n.2, p.139-166, April 2001
Bart Selman , Henry Kautz, Knowledge compilation and theory approximation, Journal of the ACM (JACM), v.43 n.2, p.193-224, March 1996
 
V. G. Kaburlassos , V. Petridis, Learning and decision-making in the framework of fuzzy lattices, New learning paradigms in soft computing, Physica-Verlag GmbH, Heidelberg, Germany, 2002
 
Steffen Lange , Thomas Zeugmann , Sandra Zilles, Learning indexed families of recursive languages from positive data: A survey, Theoretical Computer Science, v.397 n.1-3, p.194-232, May, 2008
 
Thomas Eiter , Kazuhisa Makino , Georg Gottlob, Computational aspects of monotone dualization: A brief survey, Discrete Applied Mathematics, v.156 n.11, p.2035-2049, June, 2008
 
Michael Schmitt, On the complexity of computing and learning with multiplicative neural networks, Neural Computation, v.14 n.2, p.241-301, February 2002
 
Stephan K. Chalup , Lukasz Wiklendt, Variations of the two-spiral task, Connection Science, v.19 n.2, p.183-199, June 2007
 
Vassilis G. Kaburlasos , Ioannis N. Athanasiadis , Pericles A. Mitkas, Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation, International Journal of Approximate Reasoning, v.45 n.1, p.152-188, May, 2007
Dana Angluin, Computational learning theory: survey and selected bibliography, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.351-369, May 04-06, 1992, Victoria, British Columbia, Canada
 
Dana Ron, Property Testing: A Learning Theory Perspective, Foundations and Trends® in Machine Learning, v.1 n.3, p.307-402, March 2008
 
Foster Provost , Venkateswarlu Kolluri, A Survey of Methods for Scaling Up Inductive Algorithms, Data Mining and Knowledge Discovery, v.3 n.2, p.131-169, June 1999
Hong Zhu , Patrick A. V. Hall , John H. R. May, Software unit test coverage and adequacy, ACM Computing Surveys (CSUR), v.29 n.4, p.366-427, Dec. 1997
 
David M. Dutton , Gerard V. Conroy, A review of machine learning, The Knowledge Engineering Review, v.12 n.4, p.341-367, December 1997
 
Ron Meir , Gunnar Rätsch, An introduction to boosting and leveraging, Advanced lectures on machine learning, Springer-Verlag New York, Inc., New York, NY, 2003
Rajiv Gupta , Scott A. Smolka , Shaji Bhaskar, On randomization in sequential and distributed algorithms, ACM Computing Surveys (CSUR), v.26 n.1, p.7-86, March 1994
 
Franz Baader , Diego Calvanese , Deborah L. McGuinness , Daniele Nardi , Peter F. Patel-Schneider, Bibliography, The description logic handbook: theory, implementation, and applications, Cambridge University Press, New York, NY, 2003

INDEX TERMS

Primary Classification:
  H. Information Systems
  H.1 MODELS AND PRINCIPLES

Additional Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.6 Learning
          Subjects: Knowledge acquisition


General Terms:
Design, Performance, Theory


Keywords:
inductive inference, probabilistic models of learning, propositional expressions

Collaborative Colleagues:
L. G. Valiant: colleagues

Peer to Peer - Readers of this Article have also read:

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player