0% found this document useful (0 votes)
9 views

Prabu M - A16101PIT6294

Uploaded by

Hariharan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views

Prabu M - A16101PIT6294

Uploaded by

Hariharan
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 29

Predicting of Customer Behavior

and
Auto Suggest Recommendation in E-commerce
Application

A PROJECT REPORT

Prabu M - A16101PIT6294
Web Mining
• Web mining is one of the technique of data mining to extract useful information based
on users' needs, under web mining, web usage mining is one of the application of data
mining technology to extract information from weblog to analyze the user access to
websites.
• A general web personalization process follows the high level steps shown in the
following diagram:

Data Collection ---------to-------Pre Processing of Data-----to------


Data Analysis & Mining--------to--------Generating Recommendations

• Figure 1: High Level Steps of Web Personalization


Software Architecture of the Proposed System:

The software architecture of the proposed system is shown below:


Sample of the Web Pages Selected
The algorithm to generate synthetic web log is given as follows:
1.Create a tree of the web pages

•For every web page create a node

•Add its children node to the new node created

2.Get all paths and sub paths (minimum length of three paths) of the tree starting from the second level to avoid all paths starting
from the same root node

•Visit a node and get its children

•Recurse the above step for each of the child

•Once all paths have been found, for each path remove the last node and save the path as a new path

•Iterate above step until the size of path is three

3.Append random time slots to each web page of every transaction (web page browsing path)

4.Randomly duplicate the transactions to get a large transaction dataset

This large dataset was broken into a ratio of 8:2 where 80% of the transactions were used as training set to generate the frequent
itemsets for generating recommendations and the other 20% of the transactions were used as testing set to test the
recommendations.
The application comprises of five major modules as
follows:

1. Login and Registration Module


2 .IIS log process and present to web page Module
3. Dashboard, Weblog Report (data cleaning) Module
4. User Session and behavior Module
5. Recommendation (Search Engine,Keywords) Module
Algorithm Design
Algorithm is a step-by-step procedure, which defines a set of
instructions to be executed in a certain order to get the desired output.
Algorithms are generally created independent of underlying languages,
i.e. an algorithm can be implemented in more than one programming
language.

From the data structure point of view, following are some important
categories of algorithms −

Search − Algorithm to search an item in a data structure.

Sort − Algorithm to sort items in a certain order.


SORTING
Sorting refers to arranging data in a particular format. Sorting algorithm
specifies the way to arrange data in a particular order. Most common orders
are in numerical or lexicographical order.

Here, I’ve implemented the selection sort.

Selection Sort
In selection sort we start by finding the minimum value in a given list and
move it to a sorted list. Then we repeat the process for each of the remaining
elements in the unsorted list. The next element entering the sorted list is
compared with the existing elements and placed at its correct position.So, at
the end all the elements from the unsorted list are sorted.
Searching Algorithm

Searching is a very basic necessity when you store data in different data
structures. The simplest approach is to go across every element in the data
structure and match it with the value you are searching for.This is known as
Linear search. It is inefficient and rarely used, but creating a program for it gives
an idea about how we can implement some advanced search algorithms.

Linear Search

In this type of search, a sequential search is made over all items one by one.
Every item is checked and if a match is found then that particular item is
returned, otherwise the search continues till the end of the data structure.
DATABASE DESIGN
TABLE DESIGN

User Master IIS log field table


Search Engine Master Table
Table schema
DATA FLOW DIAGRAMS
Level 2: Complete details of every function performed by Admin user. Every step is
explained in detail.
Overall Diagram
Overall System Architecture
Implementation
Screenshots:
Forget password:
Login page:
IIS log file to Log view:
IIS log field details:

Click to add text


Dashboard:
Visitor IP and User behavior:
Resource Accessed:
Download details:
Image download details:
Search Engine and Search Key Information :
Technical Details (404,5XX) :
•Thank You

You might also like