UGC Approved Journal no 63975(19)

ISSN: 2349-5162 | ESTD Year : 2014
Call for Paper
Volume 11 | Issue 5 | May 2024

JETIREXPLORE- Search Thousands of research papers



WhatsApp Contact
Click Here

Published in:

Volume 6 Issue 6
June-2019
eISSN: 2349-5162

UGC and ISSN approved 7.95 impact factor UGC Approved Journal no 63975

7.95 impact factor calculated by Google scholar

Unique Identifier

Published Paper ID:
JETIR1906179


Registration ID:
212321

Page Number

225-232

Share This Article


Jetir RMS

Title

MANAGING PRODUCT-DISCOUNTS USING LOWER BOUND APPROXIMATION ALGORITHM

Abstract

Recently, online shopping marketplaces usually hold some price promotion campaigns to attract customers and increase their purchase intention. E-com web site provides best time consumption and efficient results. Considering the requirements of customers in this practical application scenario, we are concerned about product selection under price promotion. To make the machines to understand the data by using the semantic web, it is used in the connection of information as used to link the data from one source to another meanwhile it also makes the system to understand the data[10]. We formulate a Constrained Optimal Product Combination (COPC) problem. It aims to find out the Product discounts 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 we first reviewed a Two List Exact (TLE) algorithm. 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 the 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 .customers under price promotion, which is certified by a customer study. To process the COPC problem effectively.

Key Words

Semantic Web, Online marketing, Constrained Optimal Product Algorithm, Two List Exact algorithm, Incremental Greedy algorithm

Cite This Article

"MANAGING PRODUCT-DISCOUNTS USING LOWER BOUND APPROXIMATION ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.6, Issue 6, page no.225-232, June-2019, Available :http://www.jetir.org/papers/JETIR1906179.pdf

ISSN


2349-5162 | Impact Factor 7.95 Calculate by Google Scholar

An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 7.95 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator

Cite This Article

"MANAGING PRODUCT-DISCOUNTS USING LOWER BOUND APPROXIMATION ALGORITHM", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.6, Issue 6, page no. pp225-232, June-2019, Available at : http://www.jetir.org/papers/JETIR1906179.pdf

Publication Details

Published Paper ID: JETIR1906179
Registration ID: 212321
Published In: Volume 6 | Issue 6 | Year June-2019
DOI (Digital Object Identifier):
Page No: 225-232
Country: -, -, - .
Area: Engineering
ISSN Number: 2349-5162
Publisher: IJ Publication


Preview This Article


Downlaod

Click here for Article Preview

Download PDF

Downloads

0002843

Print This Page

Current Call For Paper

Jetir RMS