Skip header Section
Skip Bibliometrics Section
Computational Complexity of Machine LearningOctober 1990
- Author:
- Michael J. Kearns
Abstract
No abstract available.
Cited By
Alani M Applications of machine learning in cryptography Proceedings of the 3rd International Conference on Cryptography, Security and Privacy, (23-27)- Onwuzurike L, Mariconti E, Andriotis P, Cristofaro E, Ross G and Stringhini G (2019). MaMaDroid, ACM Transactions on Privacy and Security, 22:2, (1-34), Online publication date: 10-Apr-2019.
- Zhou Y, Wang Y, Gao J, Luo N and Wang J (2018). An efficient local search for partial vertex cover problem, Neural Computing and Applications, 30:7, (2245-2256), Online publication date: 1-Oct-2018.
- Boustani A, Maiti A, Jazi S, Jadliwala M and Namboodiri V (2017). Seer Grid, IEEE Transactions on Parallel and Distributed Systems, 28:2, (546-557), Online publication date: 1-Feb-2017.
- Zhang Y, Ran Y and Zhang Z (2017). A simple approximation algorithm for minimum weight partial connected set cover, Journal of Combinatorial Optimization, 34:3, (956-963), Online publication date: 1-Oct-2017.
- Liang D, Zhang Z, Liu X, Wang W and Jiang Y (2016). Approximation algorithms for minimum weight partial connected set cover problem, Journal of Combinatorial Optimization, 31:2, (696-712), Online publication date: 1-Feb-2016.
- Khuller S, Purohit M and Sarpatwar K Analyzing the optimal neighborhood Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (1702-1713)
- Franco M, Krasnogor N and Bacardit J Analysing bioHEL using challenging boolean functions Proceedings of the 12th annual conference companion on Genetic and evolutionary computation, (1855-1862)
- Elomaa T and Kujala J Covering analysis of the greedy algorithm for partial cover Algorithms and Applications, (102-113)
- Chandola V, Banerjee A and Kumar V (2009). Anomaly detection, ACM Computing Surveys, 41:3, (1-58), Online publication date: 1-Jul-2009.
- Ju. Moshkov M, Piliszczu M and Zielosko B (2009). Greedy Algorithms withWeights for Construction of Partial Association Rules, Fundamenta Informaticae, 94:1, (101-120), Online publication date: 1-Jan-2009.
- Ju. Moshkov M, Piliszczu M and Zielosko B (2009). Greedy Algorithms withWeights for Construction of Partial Association Rules, Fundamenta Informaticae, 94:1, (101-120), Online publication date: 1-Jan-2009.
- Golab L, Karloff H, Korn F, Saha A and Srivastava D (2009). Sequential dependencies, Proceedings of the VLDB Endowment, 2:1, (574-585), Online publication date: 1-Aug-2009.
- Dasgupta A, Ghosh A, Kumar R, Olston C, Pandey S and Tomkins A The discoverability of the web Proceedings of the 16th international conference on World Wide Web, (421-430)
- Moshkov M, Piliszczuk M and Zielosko B On partial covers, reducts and decision rules with weights Transactions on rough sets VI, (211-246)
- Bar-Yehuda R, Flysher G, Mestre J and Rawitz D Approximation of partial capacitated vertex cover Proceedings of the 15th annual European conference on Algorithms, (335-346)
- Sümer Ö Partial covering of hypergraphs Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, (572-581)
- Müller M (2004). Can user models be learned at all? Inherent problems in machine learning for user modelling, The Knowledge Engineering Review, 19:1, (61-88), Online publication date: 1-Mar-2004.
- Bar-Yehuda R, Bendel K, Freund A and Rawitz D (2004). Local ratio, ACM Computing Surveys, 36:4, (422-463), Online publication date: 1-Dec-2004.
- Anthony M (2004). Some connections between learning and optimization, Discrete Applied Mathematics, 144:1-2, (17-26), Online publication date: 1-Nov-2004.
- Thornton C (1999). What do Constructive Learners Really Learn?, Artificial Intelligence Review, 13:4, (249-257), Online publication date: 1-Aug-1999.
- Bar-Yehuda R Using homogenous weights for approximating the partial cover problem Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, (71-75)
- Kearns M (1998). Efficient noise-tolerant learning from statistical queries, Journal of the ACM, 45:6, (983-1006), Online publication date: 1-Nov-1998.
- Bshouty N, Tamon C and Wilson D On learning width two branching programs (extended abstract) Proceedings of the ninth annual conference on Computational learning theory, (224-227)
- Bshouty N and Tamon C On the Fourier spectrum of monotone functions Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, (219-228)
- Vaidyanathan S and Lakshmivarahan S Analysis of upper bound in Valiant's model for learning bounded CNF expressions Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice, (754-761)
- Kannan S On the query complexity of learning Proceedings of the sixth annual conference on Computational learning theory, (58-66)
- Decatur S Statistical queries and faulty PAC oracles Proceedings of the sixth annual conference on Computational learning theory, (262-268)
- Kearns M Efficient noise-tolerant learning from statistical queries Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, (392-401)
- Kautz H and Selman B Forming concepts for fast inference Proceedings of the tenth national conference on Artificial intelligence, (786-793)
Recommendations
Computational complexity simplified
MATH'08: Proceedings of the American Conference on Applied MathematicsThere exists a variety of techniques for the computational complexity analysis of algorithms and functions. This analysis is imperative to the algorithmic and the functional performance. Besides the big-oh complexity, there are other complexity ...
An overview of computational complexity
An historical overview of computational complexity is presented. Emphasis is on the fundamental issues of defining the intrinsic computational complexity of a problem and proving upper and lower bounds on the complexity of problems. Probabilistic and ...