Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2020408.2020443acmconferencesArticle/Chapter ViewAbstractPublication PageskddConference Proceedingsconference-collections
research-article

Online active inference and learning

Published: 21 August 2011 Publication History

Abstract

We present a generalized framework for active inference, the selective acquisition of labels for cases at prediction time in lieu of using the estimated labels of a predictive model. We develop techniques within this framework for classifying in an online setting, for example, for classifying the stream of web pages where online advertisements are being served. Stream applications present novel complications because (i) at the time of label acquisition, we don't know the set of instances that we will eventually see, (ii) instances repeat based on some unknown (and possibly skewed) distribution. We combine ideas from decision theory, cost-sensitive learning, and online density estimation. We also introduce a method for on-line estimation of the utility distribution, which allows us to manage the budget over the stream. The resulting model tells which instances to label so that by the end of each budget period, the budget is best spent (in expectation). The main results show that: (1) our proposed approach to active inference on streams can indeed reduce error costs substantially over alternative approaches, (2) more sophisticated online estimations achieve larger reductions in error. We next discuss simultaneously conducting active inference and active learning. We show that our expected-utility active inference strategy also selects good examples for learning. We close by pointing out that our utility-distribution estimation strategy can also be applied to convert pool-based active learning techniques into budget-sensitive online active learning techniques.

References

[1]
J. Attenberg and F. Provost. Active inference and learning for classifying streams. In BL-ICML '10: Workshop on Budgeted Learning, 2010.
[2]
J. Attenberg and F. Provost. Inactive Learning? Difficulties Employing Active Learning in Practice. SIGKDD Explorations, 12(2):36--41, 2010.
[3]
J. Attenberg and F. Provost. Why label when you can search? Strategies for applying human resources to build classification models under extreme class imbalance. In KDD, 2010.
[4]
A. Beygelzimer, S. Dasgupta, and J. Langford. Importance weighted active learning. In Proc of the 26th Intl Conf on Machine Learning, ICML '09, 2009.
[5]
N. C. Bianchi, C. Gentile, and L. Zaniboni. Worst-case analysis of selective sampling for linear classification. In J. Mach. Learn. Res., volume 7, pages 1205--1230, 2006.
[6]
M. Bilgic and L. Getoor. Effective label acquisition for collective classification. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '08, pages 43--51. ACM, 2008.
[7]
M. Bilgic and L. Getoor. Reflect and correct: A misclassification prediction approach to active inference. ACM Trans. Knowl. Discov. Data, 3, December 2009.
[8]
M. Bilgic and L. Getoor. Active Inference for Collective Classification. In AAAI, 2010.
[9]
C. Chow. On optimum recognition error and reject tradeoff. IEEE Transactions on Information Theory, 16(1):41--46, January 1970.
[10]
C. K. Chow. An Optimum Character Recognition System Using Decision Functions. IEEE Transactions on Electronic Computers, (4):247--254, December 1957.
[11]
K. Church and W. Gale. A comparison of the enhanced Good-Turing and deleted estimation methods for estimating probabilities of English bigrams. Computer Speech & Language, 5(1):19--54, January 1991.
[12]
B. D. Davison. Topical locality in the web. In Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval, SIGIR '00, pages 272--279, New York, NY, USA, 2000. ACM.
[13]
P. Donmez, J. G. Carbonell, and J. Schneider. Efficiently learning the accuracy of labeling sources for selective sampling. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, KDD '09, pages 259--268, New York, NY, USA, 2009. ACM.
[14]
C. Elkan. The Foundations of Cost-Sensitive Learning. In IJCAI, pages 973--978, 2001.
[15]
T. Fawcett and F. Provost. Activity monitoring: Noticing interesting changes in behavior. In In Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 53--62, 1999.
[16]
W. A. Gale. Good-Turing smoothing without tears. Journal of Quantitative Linguistics, 2, 1995.
[17]
D. Golovin, M. Faulkner, and A. Krause. Online distributed sensor selection. In Information Processing in Sensor Networks, pages 220--231, 2010.
[18]
I. J. Good and G. H. Toulmin. The number of new species, and the increase in population coverage, when a sample is increased. Biometrika, 43(1--2):45--63, June 1956.
[19]
D. Helmbold and S. Panizza. Some label efficient learning results. In COLT '97: Proceedings of the tenth annual conference on Computational learning theory. ACM, 1997.
[20]
R. Herbei and M. H. Wegkamp. Classification with reject option. Can J Statistics, 34(4):709--721, 2006.
[21]
H. T. Nguyen and A. Smeulders. Active learning using pre-clustering. In ICML, 2004.
[22]
M. J. Rattigan, M. Maier, and D. Jensen. Exploiting Network Structure for Active Inference in Collective Classification. Technical Report 07--22, University of Massachusetts Amherst, 2007.
[23]
M. Saar-Tsechansky and F. Provost. Decision-Centric active learning of Binary-Outcome models. INFORMATION SYSTEMS RESEARCH, 18(1):4--22, Mar. 2007.
[24]
D. Sculley. Online active learning methods for fast label-efficient spam filtering. In Fourth Conf. on Email and AntiSpam, 2007.
[25]
B. Settles. Active learning literature survey. Computer Sciences Technical Report 1648, University of Wisconsin--Madison, 2009.
[26]
B. Settles and M. Craven. An analysis of active learning strategies for sequence labeling tasks. In Proceedings of the Conference on Empirical Methods in Natural Language Processing, EMNLP '08, pages 1070--1079, Stroudsburg, PA, USA, 2008. Association for Computational Linguistics.
[27]
V. S. Sheng, F. Provost, and P. G. Ipeirotis. Get another label? improving data quality and data mining using multiple, noisy labelers. In KDD '08, 2008.
[28]
K. Weinberger, A. Dasgupta, J. Attenberg, J. Langford, and A. Smola. Feature hashing for large scale multitask learning. In ICML '09, 2009.

Cited By

View all
  • (2023)Active Learning from the WebProceedings of the ACM Web Conference 202310.1145/3543507.3583346(1616-1625)Online publication date: 30-Apr-2023
  • (2023)CSAL: Cost sensitive active learning for multi-source drifting streamKnowledge-Based Systems10.1016/j.knosys.2023.110771277(110771)Online publication date: Oct-2023
  • (2023)Machine Learning in Online Advertising Research: A Systematic Mapping StudyIndustry 4.0: The Power of Data10.1007/978-3-031-29382-5_16(147-160)Online publication date: 8-Jul-2023
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
KDD '11: Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
August 2011
1446 pages
ISBN:9781450308137
DOI:10.1145/2020408
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 August 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. active inference
  2. active learning
  3. machine learning
  4. micro-outsourcing
  5. on-line advertising

Qualifiers

  • Research-article

Conference

KDD '11
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,133 of 8,635 submissions, 13%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)24
  • Downloads (Last 6 weeks)2
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2023)Active Learning from the WebProceedings of the ACM Web Conference 202310.1145/3543507.3583346(1616-1625)Online publication date: 30-Apr-2023
  • (2023)CSAL: Cost sensitive active learning for multi-source drifting streamKnowledge-Based Systems10.1016/j.knosys.2023.110771277(110771)Online publication date: Oct-2023
  • (2023)Machine Learning in Online Advertising Research: A Systematic Mapping StudyIndustry 4.0: The Power of Data10.1007/978-3-031-29382-5_16(147-160)Online publication date: 8-Jul-2023
  • (2022)Reinforcement Online Active Learning Ensemble for Drifting Imbalanced Data StreamsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2020.302619634:8(3971-3983)Online publication date: 1-Aug-2022
  • (2019)Online Active Learning Ensemble Framework for Drifted Data StreamsIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2018.284433230:2(486-498)Online publication date: Feb-2019
  • (2018)A Bi-Criteria Active Learning Algorithm for Dynamic Data StreamsIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2016.261439329:1(74-86)Online publication date: Jan-2018
  • (2018)Online Active Learning Paired Ensemble for Concept Drift and Class ImbalanceIEEE Access10.1109/ACCESS.2018.28828726(73815-73828)Online publication date: 2018
  • (2018)Selective harvesting over networksData Mining and Knowledge Discovery10.1007/s10618-017-0523-032:1(187-217)Online publication date: 1-Jan-2018
  • (2017)Exploring Representativeness and Informativeness for Active LearningIEEE Transactions on Cybernetics10.1109/TCYB.2015.249697447:1(14-26)Online publication date: Jan-2017
  • (2017)Online Active Learning with Drifted Data Streams Using Paired Ensemble FrameworkITM Web of Conferences10.1051/itmconf/2017120501612(05016)Online publication date: 5-Sep-2017
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media