Designing Web Menu for Configurable Goods

  • Takayuki Shiga
  • Mizuho Iwaihara
  • Yahiko Kambayashi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2738)


Configurable goods are becoming a popular style for e-commerce web shopping sites in which buyers can configure a product of their needs from menus listing components. In this paper, we propose a sophisticated system support for designing web menu for configurable goods. We discuss evaluating correlations between component classes of configurable goods. Such correlations can be used to design web menus which cause less trial errors and give an aggregated view of product constraints. Choosing a proper quantitative measure for correlation is an important issue here. We compare a number of statistical and mining methods by experiments and show that Cramer’s coefficient is most suitable for this problem. Then we show an algorithm which generates a tree structure for web menus such that closely correlated component classes are clustered, and hence users can easily select components.


Association Rule Selection Order Memory Type Component Classis Prefer Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Agrawal, R., Imielinski, T., Swami, A.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, ACM SIGMOD 1993, pp. 207–216 (1993)Google Scholar
  2. 2.
    Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: Proc. of the 20th VLDB Conference, pp. 487–499 (1994)Google Scholar
  3. 3.
    Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: Proc. of the ACM SIGMOD Int’l Conf. on Management of Data, ACM SIGMOD 1997, pp. 265–276 (1997)Google Scholar
  4. 4.
    Iwaihara, M.: Supporting Dynamic Constraints for Commerce Negotiations. In: 2nd Int. Workshop in Advanced Issues of E-Commerce and Web-Information Systems(WECWIS), pp. 12–20. IEEE Press, Los Alamitos (2000)CrossRefGoogle Scholar
  5. 5.
    Kozawa, M., Iwaihara, M., Kambayashi, Y.: Constraint Search for Comparing Multiple-Incentive Merchandises. In: Bauknecht, K., Tjoa, A.M., Quirchmayr, G. (eds.) EC-Web 2002. LNCS, vol. 2455, pp. 152–161. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  6. 6.
    Junker, U.: Preference Programming for Configuration. In: Proc. IJCAI 2001 – Configuration Workshop, Seattle (2001)Google Scholar
  7. 7.
    Lee, J., Wang, P., Lee, H.S.: A Visual One-Page Catalog Interface for Analytical Product Selection. In: Bauknecht, K., Madria, S.K., Pernul, G. (eds.) EC-Web 2001. LNCS, vol. 2115, pp. 240–249. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  8. 8.
    Morishita, S., Nakaya, A.: Parallel branch-and-bound graph search for correlated association rules. In: Zaki, M.J., Ho, C.-T. (eds.) KDD 1999. LNCS (LNAI), vol. 1759, pp. 265–276. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  9. 9.
    Sabin, D., Weigel, R.: Product Configuration Frameworks - A Survey. IEEE Intelligent Systems 13(4), 32–85 (1998)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Takayuki Shiga
    • 1
  • Mizuho Iwaihara
    • 1
  • Yahiko Kambayashi
    • 1
  1. 1.Department of Social InformaticsKyoto UniversitySakyo-Ku, KyotoJapan

Personalised recommendations