skip to main content
10.1145/2187980.2187984acmotherconferencesArticle/Chapter ViewAbstractPublication PageswwwConference Proceedingsconference-collections
research-article

Optimizing user exploring experience in emerging e-commerce products

Published:16 April 2012Publication History

ABSTRACT

E-commerce has emerged as a popular channel for Web users to conduct transaction over Internet. In e-commerce services, users usually prefer to discover information via querying over category browsing, since the hierarchical structure supported by category browsing can provide them a more effective and efficient way to find their interested properties. However, in many emerging e-commerce services, well-defined hierarchical structures are not always available; moreover, in some other e-commerce services, the pre-defined hierarchical structures are too coarse and less intuitive to distinguish properties according to users interests. This will lead to very bad user experience. In this paper, to address these problems, we propose a hierarchical clustering method to build the query taxonomy based on users' exploration behavior automatically, and further propose an intuitive and light-weight approach to construct browsing list for each cluster to help users discover interested items. The advantage of our approach is four folded. First, we build a hierarchical taxonomy automatically, which saves tedious human effort. Second, we provide a fine-grained structure, which can help user reach their interested items efficiently. Third, our hierarchical structure is derived from users' interaction logs, and thus is intuitive to users. Fourth, given the hierarchical structures, for each cluster, we present both frequently clicked items and retrieved results of queries in the category, which provides more intuitive items to users. We evaluate our work by applying it to the exploration task of a real-world e-commerce service, i.e. online shop for smart mobile phone's apps. Experimental results show that our clustering algorithm is efficient and effective to assist users to discover their interested properties, and further comparisons illustrate that the hierarchical topic browsing performs much better than existing category browsing approach (i.e. Android Market mobile apps category) in terms of information exploration.

References

  1. R. Baeza-Yates, B. Ribeiro-Neto, et al. Modern information retrieval, volume 463. ACM press New York, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Beeferman and A. Berger. Agglomerative clustering of a search engine query log. In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, pages 407--416. ACM, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. H. Cao, D. Jiang, J. Pei, Q. He, Z. Liao, E. Chen, and H. Li. Context-aware query suggestion by mining click-through and session data. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 875--883. ACM, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. P. Chan, M. Schlag, and J. Zien. Spectral k-way ratio-cut partitioning and clustering. Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, 13(9):1088--1096, 1994.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. I. Dhillon, Y. Guan, and B. Kulis. Weighted graph cuts without eigenvectors: A multilevel approach. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 1944--1957, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Ester, H. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data mining, volume 1996, pages 226--231. Portland: AAAI Press, 1996.Google ScholarGoogle Scholar
  7. B. Fonseca, P. Golgher, E. De Moura, and N. Ziviani. Using association rules to discover search engines related queries. 2003.Google ScholarGoogle Scholar
  8. A. Ng, M. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems 14: Proceeding of the 2001 Conference, pages 849--856, 2001.Google ScholarGoogle Scholar
  9. J. Shi and J. Malik. Normalized cuts and image segmentation. Pattern Analysis and Machine Intelligence, IEEE Transactions on, 22(8):888--905, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. J. Wen, J. Nie, and H. Zhang. Clustering user queries of a search engine. In Proceedings of the 10th international conference on World Wide Web, pages 162--168. ACM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Xu and W. Croft. Improving the effectiveness of information retrieval with local context analysis. ACM Transactions on Information Systems (TOIS), 18(1):79--112, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. O. Zaäne and A. Strilets. Finding similar queries to satisfy searches based on query traces. Advances in Object-Oriented Information Systems, pages 349--359, 2002.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Optimizing user exploring experience in emerging e-commerce products

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Other conferences
      WWW '12 Companion: Proceedings of the 21st International Conference on World Wide Web
      April 2012
      1250 pages
      ISBN:9781450312301
      DOI:10.1145/2187980

      Copyright © 2012 ACM

      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]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 April 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      Overall Acceptance Rate1,899of8,196submissions,23%
    • Article Metrics

      • Downloads (Last 12 months)6
      • Downloads (Last 6 weeks)1

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader