Learning with attribute costs
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. Fast probabilistic algorithms for hamiltonian circuits and matchings , 1977, STOC '77.
[2] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[3] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] Michael Stonebraker,et al. Predicate migration: optimizing queries with expensive predicates , 1992, SIGMOD Conference.
[5] Michael Kharitonov,et al. Cryptographic hardness of distribution-specific learning , 1993, STOC.
[6] Mihir Bellare,et al. On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..
[7] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[8] Oren Etzioni,et al. Efficient information gathering on the Internet , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[9] Guy Kortsarz,et al. A Matched Approximation Bound for the Sum of a Greedy Coloring , 1999, Inf. Process. Lett..
[10] Venkatesan Guruswami,et al. Query strategies for priced information (extended abstract) , 2000, STOC '00.
[11] OREN ETZIONI,et al. Optimal Information Gathering on the Internet with Time and Cost Constraints , 2000, SIAM J. Comput..
[12] Russell Greiner,et al. Budgeted learning of nailve-bayes classifiers , 2002, UAI 2002.
[13] Venkatesan Guruswami,et al. Query strategies for priced information (extended abstract) , 2000, STOC '00.
[14] Edith Cohen,et al. Associative search in peer to peer networks: harnessing latent semantics , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[15] Russell Greiner,et al. Budgeted Learning of Naive-Bayes Classifiers , 2003, UAI.
[16] Santosh S. Vempala,et al. Efficient algorithms for online decision problems , 2005, J. Comput. Syst. Sci..
[17] Jennifer Widom,et al. Adaptive ordering of pipelined stream filters , 2004, SIGMOD '04.
[18] László Lovász,et al. Approximating Min Sum Set Cover , 2004, Algorithmica.
[19] Russell Greiner,et al. Active Model Selection , 2004, UAI.
[20] Jennifer Widom,et al. The Pipelined Set Cover Problem , 2005, ICDT.
[21] Moshe Tennenholtz,et al. Overcoming free riding in multi-party computations - The anonymous case , 2006, Games Econ. Behav..