Introduction

This project is serving an e-shopping application that can be used by customers. I have Taken a particular category of product that is present in the database. Customers can efficiently select with help of our recommendation system, securely purchase an item using an encryption algorithm, and can get the picked product using an optimized shortest path algorithm at his/her doorstep.

Motivation

1. Recommendation System Motivation comes from the fact that conventional shopping is not much efficient because the shops have huge variety of products which have similar specifications or brands and as a result customer gets confused to choose the best fit product for him and as a result he may waste his money on a bad product.

2. Encryption-Decryption Motivation to make secured online transactions and conceal customer's financial information comes from the fact that during the payment process, if a hacker got successful in retrieving the OTP which is sent to the customer, then the customer will be in huge trouble because hacker can steal the customer’s money.

3. Time Efficient Shortest Path Algorithm Motivation to efficiently implement Dijkstra algorithm comes from the fact that for large number of nodes and edges, naive approaches are not efficient in terms of execution time and space.

Problem Statement

In this pandemic, people are forced to stay at home as it becomes risky to go outside and do shopping in crowded areas. Therefore, E-shopping becomes an easy and a safer alternative for shopping goods, which also makes the experience more helpful and fulfilling for a buyer than conventional shopping.

Objective

• Recommend the best and customized product for the customer on the basis of customer’s liking of brand of product, customer’s budget and reviews given by different customers who had just purchased that specific item.
• Secured online transactions and conceal buyer's financial information using encryption-decryption
• Suggest the delivery boy, the shortest possible path as soon as possible in the real road network by applying time efficient shortest path algorithms.

Methodology

For Recommendation System-

2 methods are being proposed:

• Collaborative Filtering
• Sentimental Analysis

For Encryption-Decryption -

2 methods are being proposed:

• Vi-genre Cipher (Less strong)
• RSA algorithm (More strong)

For solving Time Efficient Shortest Path-

4 solving optimization is being proposed:

• Brute-force method
• Fibonacci heap implementation
• Binary heap implementation
• Bi-directional Dijkstra algorithm (Giving Least execution time)

Use-Case Diagram

Algorithms

Algorithm of collaborative filtering(User Based)

Algorithm of Sentimental analysis(Naive Bayes)

Algorithm of Bi-directional Dijikstra

Results

Results for Collaborative filtering and sentimental analysis

Results for Encryption Algorithms

Result For Time Efficient Shortest Path Algorithms

Comparative Analysis of Various Approaches of Dijkstra Algorithm

Visualization using Time Series Method

Visualization using Bar Chart Method

THANK YOU !!!