Home > Archives > IJSRST184130 IJSRST-Library

A Review on Determining k-Most Demanding Products

Authors(6) :- Advait Pundlik, Vaibhav Hood, Pawan Satpute, Utkarsh Mandade, Ankita Tripathi, Prof. Kapil Hande

It is routinely indispensable for makers to pick what products to deliver with the objective that they can extend their market share in a relentlessly wild market. To pick which products to deliver, makers need to break down the consumers' necessities and how consumers settle on their purchase decisions so the new products will be forceful in the market. In this paper, an issue of generation courses of action, named k-most demanding products (k-MDP) finding, is framed. Given an arrangement of customers demanding a specific kind of products with different traits, an arrangement of existing products of the sort, an arrangement of competitor products that can be offered by an association, and a positive whole number k, we have to help the association to pick k products from the applicant products to such an extent that the typical number of the total customers for the k products is supported. We show the issue is NP-hard when the amount of qualities for a thing is at least 3. One covetous calculation is proposed to find estimated respond in due order regarding the issue. We likewise attempt to find the ideal course of action of the issue by assessing the upper bound of the typical number of the total clients for an arrangement of k applicant products for reducing the hunt space of the ideal game plan. A correct calculation is then given to find the ideal course of action of the issue by using this pruning technique. To deal with this issue, we likewise propose a powerful covetous based estimation calculation, called as 'Top k correct calculation' with a provable game plan guarantee. Using this calculation, we can find the most demanding products that can be given to the customers.
Advait Pundlik, Vaibhav Hood, Pawan Satpute, Utkarsh Mandade, Ankita Tripathi, Prof. Kapil Hande
K-MDP, Decision Support, Production Plan, Consumer Behaviour
  1. A. N. Paidi, "Data Mining: Future Trends and Applications", International Journal of Modern Engineering Research (IJMER), Vol.2, Issue.6, Nov-Dec. 2012 pp-4657-4663
  2. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag, "Reverse Top-k Queries," Proc. 26th Int’l Conf. Data Eng., pp. 365-376, 2010.
  3. C. Li, B.C. Ooi, A.K.H. Tung, and S. Wang, "DADA: A Data Cube for Dominant Relationship Analysis," Proc. 25th ACM SIGMOD Int. Conf. Management of Data, pp. 659-670, 2006.
  4. C. -Y. Lin, J. -L. Koh, And A. L. P. Chen, "Determining K-Most Demanding Products With Maximum Expected Number Of Total Customers", IEEE Transactions On Knowledge And Data Engineering, Vol. 25, No. 8, August 2016.
  5. E. Achtert, C. Bohm, P. Kroger, P. Kunath, A. Pryakhin, and M. Renz, "Efficient Reverse k-Nearest Neighbor Search in Arbitrary Metric Spaces," Proc. 25th ACM SIGMOD Int. Conf. Management of Data, pp. 515-526, 2006.
  6. E. Dellis and B. Seeger, "Efficient Computation of Reverse Skyline Queries," Proc. 33rd Int. Conf. Very Large Data Bases, pp. 291-302, 2007.
  7. F. Korn, S. Muthukrishnan, "Influence Sets Based on Reverse nearest Neighbor Queries", Proc. 19th ACM SIGMOD Int. Conf. Management of Data, pp. 201-212, 2000.
  8. J. Kleinberg, C. Papadimitriou, and P. Raghavan, "A Microeconomic View of Data Mining," Data Mining and Knowledge Discovery, vol. 2, no. 4, pp. 311-322, 1998.
  9. M. Miah, G. Das, V. Hristidis, and H. Mannila, "Determining Attributes to Maximize Visibility of Objects", IEEE Transactions on Knowledge and Data Engineering, v.21 n.7, p.959-973, July 2009.
  10. Q. Wan, R.C.-W. Wong, I.F. Ilyas, M.T. Ozsu, and Y. Peng, "Creating Competitive Products," Proc. 35th Int. Conf. Very Large Data Bases, pp. 898-909, 2009.
  11. T. Wu, D. Xin, Q. Mei, and J. Han, "Promotion Analysis in Multi-Dimensional Space", Proc. 35th Int. Conf. Very Large Data Bases, pp. 109-120, 2009.
  12. W. C. Wang, E. T. Wang, and A. L. P. Chen, "Dynamic Skylines Considering Range Queries", Proc. 16th Int. Conf. Database Systems for Advanced Applications, 2011.
  13. X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. 27th ACM SIGMOD Int. Conf. Management of Data, pp. 213-226, 2008.
  14. Z. Zhang, L.V.S. Lakshmanan, and A.K.H. Tung, "On Domination Game Analysis for Microeconomic Data Mining," ACM Trans. Knowledge Discovery from Data, vol. 2, no. 4, pp. 18-44, 2009.
  15. F. Korn and S. Muthukrishnan, "Influence Sets Based on Reverse nearest Neighbor Queries," Proc. 19th ACM SIGMOD Intl Conf. Management of Data, pp. 201-212, 2000.
  16. X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. 27th ACM SIGMOD Intl Conf. Management of Data, pp. 213-226, 2008.
  17. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag, "Reverse Top-k Queries," Proc. 26th Intl Conf. Data Eng., pp. 365-376, 2010.
  18. W. Wu, F. Yang, C.Y. Chan, and K.L. Tan, "FINCH: Evaluating Reverse k-Nearest-Neighbor Queries on Location Data," Proc. 34th Intl Conf. Very Large Data Bases, pp. 1056-1067, 2008.
  19. M. Miah, G. Das, V. Hristidis, and H. Mannila, "Standing Out in a Crowd: Selecting Attributes for Maximum Visibility," Proc. 24th Intl Conf. Data Eng., pp. 356-365, 2008.
  20. Y. Tao, D. Papadias, and X. Lian, "Reverse kNN Search in Arbitrary Dimensionality," Proc. 30th Intl Conf. Very Large Data Bases, pp. 744-755, 2004.
  21. S. Borzsonyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Intl Conf. Data Eng., pp. 421-430, 2001.
Publication Details
  Published in : Volume 4 | Issue 2 | January-February 2018
  Date of Publication : 2018-02-28
License:  This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 116-120
Manuscript Number : IJSRST184130
Publisher : Technoscience Academy
PRINT ISSN : 2395-6011
ONLINE ISSN : 2395-602X
Cite This Article :
Advait Pundlik, Vaibhav Hood, Pawan Satpute, Utkarsh Mandade, Ankita Tripathi, Prof. Kapil Hande, "A Review on Determining k-Most Demanding Products", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 4, Issue 2, pp.116-120, January-February-2018
URL : http://ijsrst.com/IJSRST184130