Skip to main content

Efficient Action Extraction with Many-to-Many Relationship between Actions and Features

  • Conference paper
Book cover Logic, Rationality, and Interaction (LORI 2011)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6953))

Included in the following conference series:

Motivation

Real-world problems often call for efficient methods to discovery actionable knowledge on which business can directly act [3]. Some works for discovering actionable knowledge [3,5] view actions as behaviors which render a state of an instance into a preferred state, where a state is represented by feature values of the instance and whether a state is preferred is determined by a classifier. Actions usually have many-to-many relations with features of an instance. That is, an action may affect multiple features of an instance, and vise versa, a feature may be influenced by multiple actions. This type of many-to-many relationships between actions and features is prevalent in real-world applications. However, most existing works [3,5] only deal with one-to-one relationship and ignore manyto- many relationship between actions and features. In these works, an action is treated as a behavior with a fixed execution cost. Restricting to a one-to-one relationship between actions and features may not yield an action set (i.e. a set of actions) with the minimal total execution cost. Moreover, one-to-one relationship is simply a special case of many-to-many relationship, and hence the latter will be applicable to more real-world problems. Therefore we aim to extract action sets from a classifier for which the total execution cost is minimal based on many-to-many relationship between actions and features.

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

Access this chapter

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

References

  1. Boehm, B.W.: Software risk management: Principles and practices. IEEE Software 8(1), 32–41 (1991)

    Article  Google Scholar 

  2. Breiman, L.: Random forests. Machine Learning 45(1), 5–32 (2001)

    Article  MATH  Google Scholar 

  3. Cao, L., Zhang, C., Yang, Q., Bell, D., Vlachos, M., Taneri, B., Keogh, E.J., Yu, P.S., Zhong, N., Ashrafi, M.Z., Taniar, D., Dubossarsky, E., Graco, W.: Domain-driven, actionable knowledge discovery. IEEE Intelligent Systems 22(4), 78–88 (2007)

    Article  Google Scholar 

  4. Manquinho, V.M., Roussel, O.: The first evaluation of pseudo-boolean solvers (pb’05). Journal on Satisfiability, Boolean Modeling and Computation 2(1-4), 103–143 (2006)

    MATH  Google Scholar 

  5. Yang, Q., Yin, J., Ling, C.X., Pan, R.: Extracting actionable knowledge from decision trees. IEEE Transactions on Knowledge and Data Engineering 19(1), 43–56 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Du, J., Hu, Y., Ling, C.X., Fan, M., Liu, M. (2011). Efficient Action Extraction with Many-to-Many Relationship between Actions and Features. In: van Ditmarsch, H., Lang, J., Ju, S. (eds) Logic, Rationality, and Interaction. LORI 2011. Lecture Notes in Computer Science(), vol 6953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24130-7_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24130-7_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24129-1

  • Online ISBN: 978-3-642-24130-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics