Skip to main content

Combining Constrained CP-Nets and Quantitative Preferences for Online Shopping

  • Conference paper
  • First Online:
Current Approaches in Applied Artificial Intelligence (IEA/AIE 2015)

Abstract

Constraints and preferences coexist in a wide variety of real world applications. In a previous work we have proposed a preference-based online shopping system that handles both constraints as well as preferences where these latter can be in a qualitative or a quantitative form. Given online shoppers’ requirements and preferences, the proposed system provides a set of suggested products meeting the users’ needs and desires. This is an improvement to the current shopping websites where the clients are restricted to choose among a set of alternatives and not necessarily those meeting their needs and satisfaction.

For a better management of constraints and preferences, we extend in this paper the well known constrained CP-Net model to quantitative constraints and integrate it into our system. This extended constrained CP-Net takes a set of constraints and preferences expressing user’s requirements and desires, and returns a set of outcomes provided in the form of list of suggestions. This latter list is sorted according to user’s preferences. An experimental evaluation has been conducted in order to assess the time efficiency of the proposed model to return the list of suggestions to the user. The results show that the response time is acceptable when the number of attributes is of manageable size.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pu, P., Faltings, B.: Enriching buyers’ experiences: the smartclient approach. In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems, pp. 289–296. ACM (2000)

    Google Scholar 

  2. Stolze, M., Ströbel, M.: Recommending as personalized teaching: towards credible needs-based ecommerce recommender systems, designing personalized user experiences in ecommerce (2004)

    Google Scholar 

  3. Myers, K., Berry, P., Blythe, J., Conley, K., Gervasio, M., McGuinness, D.L., Morley, D., Pfeffer, A., Pollack, M., Tambe, M.: An intelligent personal assistant for task and time management. AI Magazine 28, 47 (2007)

    Google Scholar 

  4. Sadaoui, S., Shil, S.K.: Constraint and qualitative preference specification in multi-attribute reverse auctions. In: Ali, M., Pan, J.-S., Chen, S.-M., Horng, M.-F. (eds.) IEA/AIE 2014, Part II. LNCS, vol. 8482, pp. 497–506. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  5. Shil, S.K., Mouhoub, M., Sadaoui, S.: An approach to solve winner determination in combinatorial reverse auctions using genetic algorithms. In: Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, pp. 75–76. ACM (2013)

    Google Scholar 

  6. Alanazi, E., Mouhoub, M., Mohammed, B.: A preference-aware interactive system for online shopping. Computer and Information Science 5, 33–42 (2012)

    Article  Google Scholar 

  7. Mohammed, B., Mouhoub, M., Alanazi, E., Sadaoui, S.: Data mining techniques and preference learning in recommender systems. Computer and Information Science 6, 88–102 (2013)

    Article  Google Scholar 

  8. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with cp-nets. Computational Intelligence 20, 137–157 (2004)

    Article  MathSciNet  Google Scholar 

  9. Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Cp-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. (JAIR) 21, 135–191 (2004)

    MATH  MathSciNet  Google Scholar 

  10. Alanazi, E., Mouhoub, M.: Variable ordering and constraint propagation for constrained CP-nets. In: Ali, M., Pan, J.-S., Chen, S.-M., Horng, M.-F. (eds.) IEA/AIE 2014, Part II. LNCS, vol. 8482, pp. 22–31. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  11. Mouhoub, M., Jashmi, B.J.: Heuristic techniques for variable and value ordering in csps. In: Krasnogor, N., Lanzi, P.L. (eds.) GECCO, pp. 457–464. ACM (2011)

    Google Scholar 

  12. Mouhoub, M.: Arc consistency for dynamic CSPs. In: Palade, V., Howlett, R.J., Jain, L. (eds.) KES 2003. LNCS, vol. 2773, pp. 393–400. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

Download references

Acknowledgments

Bandar Ghalib Mohammed and Eisa Alanazi are sponsored by the Ministry of Higher Education, Saudi Arabia.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Malek Mouhoub .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mohammed, B., Mouhoub, M., Alanazi, E. (2015). Combining Constrained CP-Nets and Quantitative Preferences for Online Shopping. In: Ali, M., Kwon, Y., Lee, CH., Kim, J., Kim, Y. (eds) Current Approaches in Applied Artificial Intelligence. IEA/AIE 2015. Lecture Notes in Computer Science(), vol 9101. Springer, Cham. https://doi.org/10.1007/978-3-319-19066-2_68

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19066-2_68

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19065-5

  • Online ISBN: 978-3-319-19066-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics