Finding Optimal Skyline Product Combinations under Price Promotion

Abstract

Nowadays, with the development of e-commerce, a growing number of customers choose to go shopping online. To find out attractive products from online shopping marketplaces, the skyline query is a useful tool which offers more interesting and preferable choices for customers. The skyline query and its variants have been extensively investigated. However, to the best of our knowledge, they have not taken into account the requirements of customers in certain practical application scenarios. Recently, online shopping marketplaces usually hold some price promotion campaigns to attract customers and increase their purchase intention. Considering the requirements of customers in this practical application scenario, we are concerned about product selection under-price promotion. A constrained optimal product combination (COPC) problem was formulated. It aims to find out the skyline product combinations which both meet a customer’s willingness to pay and bring the maximum discount rate. The COPC problem is significant to offer powerful decision support for customers under price promotion, which is certified by a customer study. To process the COPC problem effectively, a two list exact (TLE) algorithm was proposed. The COPC problem is proven to be NP-hard, and the TLE algorithm is not scalable because it needs to process an exponential number of product combinations. Additionally, we design a lower bound approximate (LBA) algorithm that has guarantee about the accuracy of the results and an incremental greedy (IG) algorithm that has good performance. The experiment results demonstrate the efficiency and effectiveness of our proposed algorithms.

Existing System

Current skyline evaluation techniques are mainly to find the outstanding tuples from a large dataset. In this existing system, it generalize the concept of skyline query and introduce a novel type of query, the combinatorial skyline query, which is to find the outstanding combinations from all combinations of the given tuples. The past skyline query is a special case of the combinatorial skyline query. This generalized concept is semantically more abundant when used in decision making, market analysis, business planning, and quantitative economics research. In this existing system, the concept of the combinatorial skyline query (CSQ) was introduced and explain the difficulty in resolving this type of query. Then, two algorithms (naive algorithm and decomposition algorithm) are designed to solve the problem. The concept to f skyline query and proposed a new type of query, the combinatorial skyline query. The notion of combinatorial skyline query gracefully extends the past skyline query and introduces abundant semantic meaning to it. Two algorithms was proposed which can effectively avoid the need of constructing all combinations such that the performance of these two algorithms are both promising in processing a combinatorial skyline query.

Proposed System

Constrained Optimal Product Combination (COPC) problem aims to find skyline product combinations which meet a customer’s payment willingness and bring the maximum discount rate. It prove the COPC problem is NP-hard. It propose an exact algorithm, namely two list exact algorithm, for the COPC problem. Besides, a lower bound approximate algorithm, which has guarantee about the accuracy of the results was designed. To get better performance, the incremental greedy algorithm is developed for the COPC problem. The proposed approaches introduce how to handle the corresponding problem under other price promotions and discuss two variants of the COPC problem by taking into account different customer demands. A small customer study was conducted to verify the significant of our COPC problem and perform an extensive experimental study to clarify the effectiveness and efficiency of all the proposed algorithms. In this project, with the development of e-commerce, a growing number of customers choose to go shopping online because it saves time and effort. However, it always contraries to expectations of customers. This is because they may need to pick up one choice among thousands of products. To help customers identify attractive products, a skyline query is admittedly a common and effective methodology. According to the definition of the skyline query, a product which is not dominated by any other product is said to be a skyline product or it is in the skyline. The products in the skyline are the best possible trade-offs between all the factors that customers care about. The skyline query is useful in identifying attractive products.

Architecture

Architecture Diagram