CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

k-Most Demanding Products Discovery with Maximum Expected Customers

by Sofiya S. Mujawar, Santosh Biradar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 109 - Number 17
Year of Publication: 2015
Authors: Sofiya S. Mujawar, Santosh Biradar
10.5120/19417-0675

Sofiya S. Mujawar, Santosh Biradar . k-Most Demanding Products Discovery with Maximum Expected Customers. International Journal of Computer Applications. 109, 17 ( January 2015), 15-17. DOI=10.5120/19417-0675

@article{ 10.5120/19417-0675,
author = { Sofiya S. Mujawar, Santosh Biradar },
title = { k-Most Demanding Products Discovery with Maximum Expected Customers },
journal = { International Journal of Computer Applications },
issue_date = { January 2015 },
volume = { 109 },
number = { 17 },
month = { January },
year = { 2015 },
issn = { 0975-8887 },
pages = { 15-17 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume109/number17/19417-0675/ },
doi = { 10.5120/19417-0675 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:45:03.399519+05:30
%A Sofiya S. Mujawar
%A Santosh Biradar
%T k-Most Demanding Products Discovery with Maximum Expected Customers
%J International Journal of Computer Applications
%@ 0975-8887
%V 109
%N 17
%P 15-17
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Product planning is a basic stage, figuring variables affecting the conclusions needs to made to the center to see the coveted possibilities, we tended to an issue of production arrangements, named k-most demanding products (k-MDP) finding. Given a set of customers demanding a certain kind of products with different traits, a set of existing products of the sort, a set of candidate products that can be offered by a company, and a positive integer number k, we need to help the company to choose k products from the candidate products such that the normal number of the aggregate customers for the k products is boosted. We demonstrate the issue is NP hard when the quantity of characteristics for a product is 3 or more. One greedy algorithm is proposed to discover surmised answer for the issue. We additionally endeavor to discover the optimal arrangement of the issue by assessing the upper bound of the normal number of the aggregate customers for a set of k candidate products for lessening the hunt space of the optimal arrangement. A precise algorithm is then given to discover the optimal arrangement of the issue by utilizing this pruning method. The investigation results exhibit that both the productivity and memory prerequisite of the careful algorithm are similar to those for the voracious algorithm, and the insatiable algorithm is well versatile concerning k.

References
  1. A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag, "Reverse Top-k Queries," Proc. 26th Int'l Conf. Data Eng. , pp. 365-376, 2010.
  2. 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.
  3. 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.
  4. E. Dellis B. Seeger, "Efficient Computation of Reverse Skyline Queries", Proc. 33rd Int. Conf. Very Large Data Bases, pp. 291-302, 2007.
  5. 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.
  6. 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.
  7. 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.
  8. N. G. Mankiw, "Principles of Economics", 5th ed. South-Western College Pub, 2008.
  9. Q. Wan, R. C. -W. Wong, I. F. Ilyas, M. T. Ozsu, Y. Peng, "Creating Competitive Products," Proc. 35th Int. Conf. Very Large Data Bases, pp. 898-909, 2009.
  10. S. Borzsonyi, D. Kossmann, and K. Stocker, "The Skyline Operator," Proc. 17th Int. Conf. Data Eng. , pp. 421-430, 2001.
  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. 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.
  13. X. Lin, Y. Yuan, Q. Zhang, and Y. Zhang, "Selecting Stars: The k Most Representative Skyline Operator," Proc. 23rd Int. Conf. Data Eng. , pp. 86-95, 2007.
  14. Y. Tao, D. Papadias, and X. Lian, "Reverse kNN Search in Arbitrary Dimensionality", Proc. 30th Int. Conf. very Large Data Bases, pp. 744-755, 2004.
  15. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Algorithms for data and knowledge management decision support query processing k-MDP.

Powered by PhDFocusTM