CFP last date
20 May 2024
Reseach Article

Using Dynamic Constraints Find Top Products

by Nihalahmad R.shikalgar, Dhanaji Jadhav
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 115 - Number 1
Year of Publication: 2015
Authors: Nihalahmad R.shikalgar, Dhanaji Jadhav

Nihalahmad R.shikalgar, Dhanaji Jadhav . Using Dynamic Constraints Find Top Products. International Journal of Computer Applications. 115, 1 ( April 2015), 44-47. DOI=10.5120/20119-2179

@article{ 10.5120/20119-2179,
author = { Nihalahmad R.shikalgar, Dhanaji Jadhav },
title = { Using Dynamic Constraints Find Top Products },
journal = { International Journal of Computer Applications },
issue_date = { April 2015 },
volume = { 115 },
number = { 1 },
month = { April },
year = { 2015 },
issn = { 0975-8887 },
pages = { 44-47 },
numpages = {9},
url = { },
doi = { 10.5120/20119-2179 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
%0 Journal Article
%1 2024-02-06T22:53:31.076685+05:30
%A Nihalahmad R.shikalgar
%A Dhanaji Jadhav
%T Using Dynamic Constraints Find Top Products
%J International Journal of Computer Applications
%@ 0975-8887
%V 115
%N 1
%P 44-47
%D 2015
%I Foundation of Computer Science (FCS), NY, USA

The growing popularity of online product review forums invites people to express opinions and purchase their products. In variety of different item set, it is very difficult to analysis skyline product from the set of different product. A consumer electronics world, product should consisting of varieties in color, functionality, applicability, reasonability, there look and all. It is unpredictable to select a product from pool of given product. In multi-criteria decision making application, most previous studies focus on how to help customers find a set of best possible , profitable products from a pool of given products. In this paper, we identify an interesting problem, using dynamic constraint find top k product, which has not been studied before. Given a set of products in the existing market, we want to find a set of "best" possible products such that these new products are not dominated by the products in the existing market. A straightforward solution is to enumerate all possible subsets of size k and find the subset which gives the greatest profit. However, there are an exponential number of possible subsets. In this paper, we propose solutions to find the top-k products efficiently by considering. An extensive performance study using both synthetic and real datasets is reported to verify its effectiveness and efficiency.

  1. Q. Wan, R. C. W. Wong, and Y. Peng, "Creating top-k profitable products", http://www. cse. ust. hk/ raywong/ paper /createTopKProfitableProducttechnical. pdf.
  2. Q. Wan, R. C. -W. Wong, and Y. Peng, "Finding Top-K Profitable Products", Proc. Int'l Conf. Data Eng. (ICDE), 2011.
  3. N. Archak, A. Ghose, and P. G. Ipeirotis, "Show Me the Money: Deriving the Pricing Power of Product Features by Mining Consumer Reviews", Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining (KDD '07), pp. 56-65, 2007.
  4. Q. Wan, R. C. W. Wong, I. F. Ilyas, M. T. Ozsu, and Y. Peng, "Creating competitive products", In VLDB 2009.
  5. O. B. N. et al, "On the distribution of the number of admissible points in a vector random sample", In Theory of Probability and its Application, 11(2), 1966.
  6. B. Jiang, J. Pei, X. Lin, Cheung, and J. Han, "Mining preferences from superior and inferior examples", In SIGKDD, 2008.
  7. D. Kossmann, F. Ramsak, and S. Rost, "Shooting stars in the sky: An online algorithm for skyline queries", In VLDB, 2002.
  8. X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, "Selecting stars: the k most representative skyline operator", In ICDE, 2007.
  9. D. Papadias, Y. Tao, G. Fu, and B. Seeger, "Progressive skyline computation in database systems", In ACM Transactions on Database Systems, Vol. 30, No. 1, 2005.
Index Terms

Computer Science
Information Sciences


Text mining.