The week's pick
Reseach Article
Finding n-Most Demanding Products for Real-Estate Industry
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 93 - Number 12 |
| Year of Publication: 2014 |
| Authors: Aditya Chimbalkar, Swati Patil, Mridul Jain, Ganesh Kate, Priyank Dwivedi |
10.5120/16264-5983
|
Aditya Chimbalkar, Swati Patil, Mridul Jain, Ganesh Kate, Priyank Dwivedi . Finding n-Most Demanding Products for Real-Estate Industry. International Journal of Computer Applications. 93, 12 ( May 2014), 1-6. DOI=10.5120/16264-5983
Abstract
In this paper, real estate problem, n-most demanding products (n-MDP) discovering, is formulated. A set of customers demanding a real estate product with multiple features, there are existing products in market, preferred products set which is offered by the company, and a positive integer n, which will be found to help the company to select n products from preferred products such that expected number of the total customers for the n products is maximized. Here it is shown the problem is NP-hard when the number of features for a product is 3 or more. Bit Map Index (BMI) is developed on the customer requirements and products of real estates. The Output of the BMI is given as an input to the algorithm like Apriori. An Apriori algorithm proceeds by identifying the frequent individual items in the database and extending them to larger and larger item sets as long as those item sets appear sufficiently often in the database. An Apriori Algorithm is provided to find the optimal solution of the problem by using the pruning strategy. The n value is determined by the algorithm which will help the company to maximize the product.
References
- 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.
- International Journal of Modern Engineering Research (IJMER), Vol. 2, Issue. 6, Nov-Dec. 2012 pp-4657-4663 ISSN: 2249-6645 "Data Mining: Future Trends and Applications" by Annan Naidu Paidi Asst . Prof of CSE Centurion University, Odisha, India.
- "https://www. cgi. com/sites/default/files/white-papers/business-intelligence-white-paper. pdf
- E. Dellis and B. Seeger, "Efficient Computation of Reverse Skyline Queries," Proc. 33rd Int'l Conf. Very Large Data Bases, pp. 291-302, 2007.
- X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. 27th ACM SIGMOD Int'l Conf. Management of Data, pp. 213-226, 2008.
- A. Vlachou, C. Doulkeridis, Y. Kotidis, and K. Norvag, "Reverse Top-k Queries," Proc. 26th Int'l Conf. Data Eng. ,pp. 365-376,201
- X. Lian and L. Chen, "Monochromatic and Bichromatic Reverse Skyline Search over Uncertain Databases," Proc. 27th ACMSIGMOD Int'l Conf. Management of Data, pp. 213-226, 2008.
- Q. Wan, R. C. -W. Wong, I. F. Ilyas, M. T. Ozsu, and Y. Peng, "Creating Competitive Products," Proc. 35th Int'l Conf. Very Large Data Bases, pp. 898-909, 2009.
- 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.
- W. C. Wang, E. T. Wang, and A. L. P. Chen, "Dynamic Skylines Considering Range Queries," Proc. 16th Int'l Conf. Database Systems for Advanced Applications, 2011.
Index Terms
Keywords