Learning with attribute costs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 356-365

  Kaplan, Haim ^a   Kusnilevitz, Eyal ^b   Mansour, Yishay ^a  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Approximation Algorithms; Learning; Online

Indexed keywords

APPROXIMATION ALGORITHMS; LEARNING; ONLINE;

ALGORITHMS; APPROXIMATION THEORY; CLASSIFICATION (OF INFORMATION); FUNCTION EVALUATION; MATHEMATICAL MODELS; ONLINE SYSTEMS; SET THEORY;

LEARNING SYSTEMS;

EID: 33244464430     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060644     Document Type: Conference Paper

References (16)

1. D. Angluin and L. G. Valiant. Fast probabilistic algorithms for Hamiltonian circuits and matchings. JCSS, 18(2):155-193, April 1979.
2. S. Babu, R. Motwani, K. Munagala, I. Nishizawa, and J. Widom. Adaptive ordering of pipelined stream Biters. In SIGMOD, 2004.
3. A. Bar-Noy, M. Bellare, M. M. Halldórsson, H. Shachnai, and T. Tamir. On chromatic sums and distributed resource allocation. Inf. Comput., 140(2):183-202, 1998.
4. A. Bar-Noy, M. M. Halldórsson, and G. Kortsarz. A matched approximation bound for the sum of a greedy coloring. IPL, 71(3-4):135-140, 1999.
5. M. Charikar, R. Fagin, V. Guruswami, J. Kleinberg, P. Raghavan, and A. Sahai. Query strategies for priced information. In 32nd STOC, pages 582-591, 2000.
6. E. Cohen, A. Fiat, and H. Kaplan. Associative search in peer to peer networks: Harnessing latent semantics. In Proceedings IEEE INFOCOM, 2003.
7. O. Etzioni, S. Hanks, T. Jiang, R. M. Karp, O. Madani, and O. Waarts. Efficient information gathering on the internet. In FOCS, 234-243, 1996.
8. O. Etzioni, S. Hanks, T. Jiang, and O. Madani. Optimal information gathering on the internet with time and cost constraints. SIAM J. Comput., 29(5): 1596-1620, 2000.
9. U. Feige, L. Lovász, and P. Tetali. Approximating min-sum set cover. In APPROX, 94-107, 2002.
10. J. M. Hellerstein and M. Stonebraker. Predicate migration: optimizing queries with expensive predicates. In SIGMOD, 267-276. ACM Press, 1993.
11. A. T. Kalai and S. Vempala. Efficient algorithms for online decision problems. In COLT, 26-40, 2003.
12. N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
13. D. J. Lizotte, O. Madani, and R. Greiner. Budgeted learning of naive-bayes classifiers. In UAI, 378-385, 2003.
14. O. Madani, D. J. Lizotte, and R. Greiner. Active model selection. ICML, 2004.
15. K. Munagala, S. Babu, R. Motwani, and J. Widom. The pipelined set cover problem. ICDT, 2005.
16. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.