skip to main content
10.1145/2618243.2618250acmotherconferencesArticle/Chapter ViewAbstractPublication PagesssdbmConference Proceedingsconference-collections
research-article

A provable algorithmic approach to product selection problems for market entry and sustainability

Authors Info & Claims
Published:30 June 2014Publication History

ABSTRACT

Given the globalized economy, how to process the heterogeneous web data so to extract customers' purchase behavior is crucial to manufacturers who want to enter or sustain in a competitive market. To maximize the sales, manufacturers not only need to decide what products to produce so to meet diverse customers' requirements, but at the same time, compete with competitors' products. In this paper, we present a general framework for the following product selection problems: (1) k-BSP problem, which is for a manufacturer to enter a competitive market, and (2) k-BBP problem, which is for a manufacturer to sustain in a competitive market. We propose several product adoption models to describe the complex purchase behavior of customers, and formally show that these problems are NP-hard in general. To tackle these problems, we propose computationally efficient greedy-based approximation algorithms. Based on the submodularity analysis, we prove that our algorithms can guarantee a (1--1/e)-approximation ratio as compared to the optimal solutions. We perform large scale data analysis to show the efficiency and accuracy of our framework. In our experiments, we observe 1,300 to 250,000 times speedup as compared to the exhaustive algorithms, and our solutions can achieve on average 96% of solution quality as compared to the optimal solutions. Finally, we apply our algorithms on web dataset to show the impact of customers' different purchase behavior on the results of product selection.

References

  1. E. Achtert, C. Böhm, P. Kröger, P. Kunath, A. Pryakhin, and M. Renz. Efficient reverse k-nearest neighbor search in arbitrary metric spaces. In SIGMOD, pages 515--526, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. Arvanitis, A. Deligiannakis, and Y. Vassiliou. Efficient influence-based processing of market research queries. In CIKM, pages 1193--1202, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. S. Borzsony, D. Kossmann, and K. Stocker. The skyline operator. In ICDE, pages 421--430, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Y.-J. Chiu, H.-C. Chen, G.-H. Tzeng, and J. Z. Shyu. Marketing strategy based on customer behaviour for the LCD-TV. In IJMDM, pages 143--165, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  5. S. X. et.al. Market entry and sustainability: A provable algorithmic approach to product selection. http://appsrv.cse.cuhk.edu.hk/~slxu/tr-ps.pdf.Google ScholarGoogle Scholar
  6. D. Kempe, J. Kleinberg, and É. Tardos. Maximizing the spread of influence through a social network. In KDD, pages 137--146, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Kleinberg, C. Papadimitriou, and P. Raghavan. A microeconomic view of data mining. Data mining and knowledge discovery, pages 311--324, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Li, B. C. Ooi, A. K. Tung, and S. Wang. Dada: a data cube for dominant relationship analysis. In SIGMOD, pages 659--670, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. C. Li, A. K. Tung, W. Jin, and M. Ester. On dominating your neighborhood profitably. In VLDB, pages 818--829, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C.-Y. Lin, J.-L. Koh, and A. L. Chen. Determining k-most demanding products with maximum expected number of total customers. In TKDE, pages 1732--1747, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Miah, G. Das, V. Hristidis, and H. Mannila. Standing out in a crowd: Selecting attributes for maximum visibility. In ICDE, pages 356--365, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. G. Nemhauser, L. Wolsey, and M. Fisher. An analysis of approximations for maximizing submodular set functions - I. Mathematical Programming, pages 265--294, 1978.Google ScholarGoogle Scholar
  13. Y. Peng, R. C.-W. Wong, and Q. Wan. Finding top-k preferable products. In TKDE, pages 1774--1788, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Q. Wan, R. Wong, and Y. Peng. Finding top-k profitable products. In ICDE, pages 1055--1066, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Q. Wan, R. C.-W. Wong, I. F. Ilyas, M. T. Özsu, and Y. Peng. Creating competitive products. In VLDB, pages 898--909, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T. Wu, D. Xin, Q. Mei, and J. Han. Promotion analysis in multi-dimensional space. In VLDB, pages 109--120, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. W. Wu, F. Yang, C.-Y. Chan, and K.-L. Tan. Finch: Evaluating reverse k-nearest-neighbor queries on location data. In VLDB, pages 1056--1067, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Z. Zhang, L. V. S. Lakshmanan, and A. K. H. Tung. On domination game analysis for microeconomic data mining. In TKDD, pages 18:1--18:27, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A provable algorithmic approach to product selection problems for market entry and sustainability

    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
      SSDBM '14: Proceedings of the 26th International Conference on Scientific and Statistical Database Management
      June 2014
      417 pages
      ISBN:9781450327220
      DOI:10.1145/2618243

      Copyright © 2014 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: 30 June 2014

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • research-article

      Acceptance Rates

      SSDBM '14 Paper Acceptance Rate26of71submissions,37%Overall Acceptance Rate56of146submissions,38%

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader