Decision-Centric Active Learning of Binary-Outcome Models

Published Online:https://doi.org/10.1287/isre.1070.0111

References

  • Baram Y., El Yaniv R., Luz K. Online choice of active learning algorithms. J. Machine Learn. Res. (2004) 5(March):255–291Google Scholar
  • Berry M. J., Linoff G. S.Data Mining Techniques (2004) (John Wiley & Sons, New York) Google Scholar
  • Blake C. L., Merz C. J. UCI Repository of Machine Learning Databases. (1998) . Department of Information and Computer Science, University of California, Irvine, CAGoogle Scholar
  • Cohn D., Atlas L., Ladner R. Improved generalization with active learning. Machine Learn. (1994) 15:201–221CrossrefGoogle Scholar
  • Cortes C., Jackel L. D., Solla S. A., Vapnik V., Denker J. S. Learning curves: Asymptotic values and rate of convergence. Adv. Neural Inform. Processing Systems (1994) 6:327–334Google Scholar
  • Domingos P. MetaCost: A general method for making classifiers cost-sensitive. Proc. 5th Internat. Conf. Knowledge Discovery Data Mining (KDD-99) (1999) (ACM)155–164CrossrefGoogle Scholar
  • Fedorov V.Theory of Optimal Experiments (1972) (Academic Press, New York) Google Scholar
  • Friedman J. H. On bias, variance, 0/1-loss, and the curse-of-dimensionality. Knowledge Discovery Data Mining (1997) 1:55–77CrossrefGoogle Scholar
  • Hastie T., Tibshirani R., Friedman J.The Elements of Statistical Learning (2001) (Springer-Verlag, New York) CrossrefGoogle Scholar
  • Heckman J. J. Sample selection bias as a specification error. Econometrica (1979) 47(1):153–161CrossrefGoogle Scholar
  • Hevner A., March S., Park J., Ram S. Design science in information systems research. MIS Quart. (2004) 28(1):75–105CrossrefGoogle Scholar
  • Kiefer J. Optimal experimental designs. J. Roy. Statist. Soc., Ser. B (1959) 21:272–304Google Scholar
  • Kornish L. J. Technology choice and timing with positive network effects. Eur. J. Oper. Res. (2006) 173(1):268–282CrossrefGoogle Scholar
  • Lewis D., Gale W. Training text classifiers by uncertainty sampling. Proc. Internat. ACM Conf. Res. Development Inform. Retrieval (SIGIR-94) (1994) (Springer-Verlag, New York) 3–12Google Scholar
  • McCardle K. Information acquisition and the adoption of new technology. Management Sci. (1985) 31(11):1372–1389LinkGoogle Scholar
  • Melville P., Saar-Tsechansky M., Provost F., Mooney R. J. An expected utility approach to active feature-value acquisition. Proc. 5th IEEE Internat. Conf. Data Mining (ICDM-2005) (2005) 483–486IEEE Computer Society, Houston, TXCrossrefGoogle Scholar
  • Mitchell T. M.Machine Learning (1997) (WCB/McGraw-Hill, New York) Google Scholar
  • Moe W., Fader P. S. Dynamic conversion behavior at e-commerce sites. Management Sci. (2004) 50(3):326–335LinkGoogle Scholar
  • Mookerjee V. S. Debiasing training data for inductive expert system construction. IEEE Trans. Knowledge Data Engrg. (2001) 13(3):497–512CrossrefGoogle Scholar
  • Pednault E., Abe N., Zadrozny B., Wang H., Fan W., Apte C. Sequential cost sensitive decision making with reinforcement learning. Proc. 8th ACM SIGKDD Internat. Conf. Knowledge Discovery Data Mining (2002) (ACM, New York) 204–213CrossrefGoogle Scholar
  • Perlich C., Provost F., Simonoff J. S. Tree induction vs. logistic regression: A learning-curve analysis. J. Machine Learn. Res. (2003) 4:211–255Google Scholar
  • Provost F., Domingos P. Tree induction for probability-based ranking. Machine Learn. (2003) 52(3):199–215CrossrefGoogle Scholar
  • Quinlan J. R.C4.5: Programs for Machine Learning (1993) (Morgan Kaufman, San Mateo, CA) Google Scholar
  • Robbins H. Some aspects of the sequential design of experiments. Bull. Amer. Math. Soc. (1952) 55:527–535CrossrefGoogle Scholar
  • Rosset S., Neumann E., Eick U., Vatnik N. Lifetime value models for decision support. Data Mining Knowledge Discovery (2003) 7:321–339CrossrefGoogle Scholar
  • Saar-Tsechansky M., Provost F. Active sampling for class probability estimation and ranking. Machine Learn. (2004) 54(2):153–178CrossrefGoogle Scholar
  • Saar-Tsechansky M., Provost F. Active learning for decision making. (2005) . Working Paper CeDER-04-06, Stern School of Business, New York University, New YorkGoogle Scholar
  • Seung H., Opper S., Smopolinsky H. Query by committee. Proc. 5th Annual ACM Workshop Comput. Learn. Theory (1992) (ACM, New York) 287–294CrossrefGoogle Scholar
  • Simon H. A., Lea G., Gregg L. W. Problem solving and rule induction: A unified view. Knowledge and Cognition (1974) (Erlbaum, Potomac, MD) . Ch. 5Google Scholar
  • Von Neumann J., Morgenstern O.Theory of Games and Economic Behavior (1944) (Princeton University Press, Princeton, NJ) Google Scholar
  • Wang K., Zhou S., Yang Q., Yeung J. M. S. Mining customer value: From association rules to direct marketing. Proc. IEEE Internat. Conf. Data Engrg. (2003) . IEE Computer SocietyCrossrefGoogle Scholar
  • West P. M., Brockett P. L., Golden L. L. A comparative analysis of neural networks and statistical methods for predicting consumer choice. Marketing Sci. (1997) 16(4):370–391LinkGoogle Scholar
  • Winston P. H., Winston P. H. Learning structural descriptions from examples. The Psychology of Computer Vision (1975) (McGraw-Hill, New York) Google Scholar
  • Zadrozny B., Elkan C. Learning and making decisions when costs and probabilities are both unknown. Proc. 7th Internat. ACM SIGKDD Conf. Knowledge Discovery Data Mining (2001) AugustSan Francisco, CA:204–212CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.