Value of information lattice: Exploiting probabilistic independence for effective feature subset acquisition

Journal of Artificial Intelligence Research

Volumn 41, Issue , 2011, Pages 69-95

  Bilgic, Mustafa ^a   Getoor, Lise ^b  

^a ILLINOIS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL INDEPENDENCES; COST-SENSITIVE; EMPIRICAL EVALUATIONS; FEATURE ACQUISITION; FEATURE SUBSET; GREEDY STRATEGIES; MEDICAL DATA SETS; MISCLASSIFICATION COSTS; MULTIPLE FEATURES; PROBABILISTIC INFERENCE; VALUE OF INFORMATION;

COSTS; SET THEORY;

MERGERS AND ACQUISITIONS;

EID: 80053415687     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3200     Document Type: Article

References (22)

1. Bayer-Zubek, V. (2004). Learning diagnostic policies from examples by systematic search. In Annual Conference on Uncertainty in Artificial Intelligence.
2. Bilgic, M., & Getoor, L. (2007). VOILA: Efficient feature-value acquisition for classification. In AAAI Conference on Artificial Intelligence, pp. 1225-1230. (Pubitemid 350149735)
3. Dittmer, S., & Jensen, F. (1997). Myopic value of information in inuence diagrams. In Annual Conference on Uncertainty in Artificial Intelligence, pp. 142-149.
4. Frank, A., & Asuncion, A. (2010). UCI machine learning repository..
5. Gaag, L., & Wessels, M. (1993). Selective evidence gathering for diagnostic belief networks. AISB Quarterly, pp. 23-34.
6. Grefenstette, J. (1986). Optimization of control parameters for genetic algorithms. IEEE Transactions on Systems, Man and Cybernetics, 16 (1), 122-128.
7. Greiner, R., Grove, A. J., & Roth, D. (2002). Learning cost-sensitive active classifiers. Artificial Intelligence, 139 (2), 137-174. (Pubitemid 34802160)
8. Heckerman, D., Horvitz, E., & Middleton, B. (1993). An approximate nonmyopic computation for value of information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15 (3), 292-298.
9. Howard, R.A., & Matheson, J.E. (1984). Readings on the Principles and Applications of Decision Analysis, chap. Inuence Diagrams. Strategic Decision Group.
10. Howard, R. A. (1966). Information value theory. IEEE Transactions on Systems Science and Cybernetics, 2 (1), 22-26.
11. Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NPComplete. Information Processing Letters, 5 (1), 15-17.
12. Lindley, D. V. (1956). On a measure of the information provided by an experiment. Annals of Mathematical Statistics, 27, 986-1005.
13. Núñez, M. (1991). The use of background knowledge in decision tree induction. Machine Learning, 6 (3), 231-250. (Pubitemid 21737707)
14. of Health, O. M. (1992). Schedule of benefits: Physician services under the health insurance act..
15. Pearl, J. (1988). Probabilistic Reasoning in Intelligent Systems. Morgan Kaufmann, San Francisco.
16. Quinlan, J.R. (1986). Induction of decision trees. Machine Learning, 1 (1), 81-106.
17. Quinlan, J. R. (1993). C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
18. Saar-Tsechansky, M., Melville, P., & Provost, F. (2009). Active feature-value acquisition. Management Science, 55 (4), 664-684.
19. Sent, D., & Gaag, L.C. (2007). Enhancing automated test selection in probabilistic networks. In Proceedings of the 11th conference on Artificial Intelligence in Medicine, pp. 331-335. (Pubitemid 47545215)
20. Tan, M. (1990). CSL: A cost-sensitive learning system for sensing and grasping objects. In IEEE International Conference on Robotics and Automation.
21. Turney, P. D. (1995). Cost-sensitive classification: Empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research, 2, 369-409.
22. Yang, Q., Ling, C., Chai, X., & Pan, R. (2006). Test-cost sensitive classification on data with missing values. IEEE Transactions on Knowledge and Data Engineering, 18 (5), 626-638.