Skip to main content
SpringerLink
Log in

Cost-Sensitive Classification with Unconstrained Influence Diagrams

  • Conference paper
SOFSEM 2012: Theory and Practice of Computer Science (SOFSEM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7147))

  • 2191 Accesses

Abstract

In this paper, we deal with an enhanced problem of cost-sensitive classification, where not only the cost of misclassification needs to be minimized, but also the total cost of tests and their requirements. To solve this problem, we propose a novel method CS-UID based on the theory of Unconstrained Influence Diagrams (UIDs). We empirically evaluate and compare CS-UID with an existing algorithm for test-cost sensitive classification (TCSNB) on multiple real-world public referential datasets. We show that CS-UID outperforms TCSNB.

This work was supported by the grant “Res Informatica” of the Grant Agency of the Czech Republic under Grant-No. 201/09/H057 and by SVV project No. 263 314.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ahlmann-Ohlsen, K.S., Jensen, F.V., Nielsen, T.D., Pedersen, O., Vomlelová, M.: A Comparison of two Approaches for Solving Unconstrained Influence Diagrams. Int. J. of Approximate Reasoning 50(1), 153–173 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chai, X., Deng, L., Yang, Q., Ling, C.X.: Test-Cost Sensitive Naive Bayes Classification. In: IEEE Int. Conf. on Data Mining, pp. 51–58 (2004)

    Google Scholar 

  3. Domingos, P.: MetaCost: A General Method for Making Classifiers Cost-Sensitive. In: Proc. 5th Int. Conf. on Knowledge Discovery and Data Mining, pp. 155–164 (1999)

    Google Scholar 

  4. Elkan, C.: The Foundations of Cost-Sensitive Learning. In: Proc. 17th Int. Joint Conf. on Artificial Intelligence, pp. 973–978 (2001)

    Google Scholar 

  5. Frank, A., Asuncion, A.: UCI machine learning repository (2010), http://archive.ics.uci.edu/ml

  6. Fried, V.: Approximate solution of Unconstrained influence diagrams. Master’s thesis, Fac. of Math. and Phys., Charles Univ., Prague, Czech Republic (2006)

    Google Scholar 

  7. Greiner, R., Grove, A.J., Roth, D.: Learning Cost-sensitive Active Classifiers. Artificial Intelligence 139(2), 137–174 (2002)

    Article  MathSciNet  Google Scholar 

  8. Iša, J., Lisý, V., Reitermanová, Z., Sýkora, O.: Unconstrained Influence Diagram Solver: Guido. In: Proc. 19th IEEE Int. Conf. on Tools with Artificial Intelligence, vol. 1, pp. 24–27. IEEE Computer Society, Washington, DC, USA (2007)

    Google Scholar 

  9. Iša, J., Reitermanová, Z., Sýkora, O.: On the Complexity of General Solution DAGs. In: Proc. 8th IEEE Int. Conf. on Machine Learning and Applications, pp. 673–678 (2009)

    Google Scholar 

  10. Jensen, F., Vomlelová, M.: Unconstrained Influence Diagrams. In: Proc. 18th Annu. Conf. on Uncertainty in Artificial Intelligence, pp. 234–241. Morgan Kaufmann, Edmonton (2002)

    Google Scholar 

  11. Jensen, F.V., Graven-Nielsen, T.: Bayesian Networks and Decision Graphs. Information Science and Statistics. Springer, New York (2007)

    Book  Google Scholar 

  12. Ling, C.X., Sheng, V.S., Yang, Q.: Test Strategies for Cost-Sensitive Decision Trees. IEEE Trans. on Knowledge Data Engineering 18(8), 1055–1067 (2006)

    Article  Google Scholar 

  13. Ling, C.X., Yang, Q., Wang, J., Zhang, S.: Decision Trees with Minimal Costs. In: Proc. 21st Int. Conf. on Machine Learning, pp. 4–8. Morgan Kaufmann (2004)

    Google Scholar 

  14. Luque, M., Nielsen, T.D., Jensen, F.V.: An Anytime Algorithm for Evaluating Unconstrained Influence Diagrams. In: Proc. 4th European Workshop on Probabilistic Graphical Models, Hirtshals, Denmark, pp. 177–184 (2008)

    Google Scholar 

  15. Núñez, M.: The Use of Background Knowledge in Decision Tree Induction. Machine Learning 6, 231–250 (1991)

    Google Scholar 

  16. Sheng, V.S., Ling, C.X., Ni, A., Zhang, S.: Cost-Sensitive Test Strategies. In: Proc. 21st Nat. Conf. on Artificial Intelligence, pp. 482–487. AAAI Press (2006)

    Google Scholar 

  17. Tan, M.: Cost-Sensitive Learning of Classification Knowledge and Its Applications in Robotics. Machine Learning 13, 7–33 (1993)

    Google Scholar 

  18. Ting, K.M.: Inducing Cost-Sensitive Trees via Instance Weighting. In: Proc. 2nd European Symposium Principles of Data Mining and Knowledge Discovery, pp. 139–147 (1998)

    Google Scholar 

  19. Ting, K.M.: An Instance-Weighting Method to Induce Cost-Sensitive Trees. IEEE Trans. on Knowledge Data Engineering 14(3), 659–665 (2002)

    Article  Google Scholar 

  20. Turney, P.D.: Cost-Sensitive Classification: Empirical Evaluation of a Hybrid Genetic Decision Tree Induction Algorithm. Journal of Artificial Intelligence Research, 369–409 (1995)

    Google Scholar 

  21. Zubek, V.B., Dietterich, T.G.: Integrating learning from examples into the search for diagnostic policies. Journal of Artificial Intelligence Research 24, 263–303 (2005)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Computer Science Faculty of Mathematics and Physics, Charles University in Prague, Malostranské náměstí 25, 118 00, Prague, Czech Republic

    Jiří Iša, Zuzana Reitermanová & Ondřej Sýkora

Authors
  1. Jiří Iša
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zuzana Reitermanová
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ondřej Sýkora
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics and Information Technologies, Institute of Informatics and Software Engineering, Slovak University of Technology in Bratislava, Ilkovičova 3, 842 16, Bratislava 4, Slovakia

    Mária Bieliková

  2. Dept. of Intelligent Systems and Business Informatics, Alpen-Adria-Universität Klagenfurt, Universitätsstr. 65-57, 9020, Klagenfurt, Austria

    Gerhard Friedrich

  3. Department of Computer Science, University of Oxford, UK

    Georg Gottlob

  4. Security Engineering Group, Technische Universität Darmstadt, Hochschulstr. 10, 64289, Darmstadt, Germany

    Stefan Katzenbeisser

  5. University of Illinois at Chicago, Dept. of Math., Stat. and Comp. Sci, 851 S. Morgan Street, Chicago, IL 60607-7045, USA; and University of Szeged, Research Group on Artificial Intelligence of the Hungarian Academy of Sciences, 6701 Szeged, Postafiók, Hungary

    György Turán

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Iša, J., Reitermanová, Z., Sýkora, O. (2012). Cost-Sensitive Classification with Unconstrained Influence Diagrams. In: Bieliková, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Turán, G. (eds) SOFSEM 2012: Theory and Practice of Computer Science. SOFSEM 2012. Lecture Notes in Computer Science, vol 7147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27660-6_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27660-6_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27659-0

  • Online ISBN: 978-3-642-27660-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation