Prabu M - A16101PIT6294
Prabu M - A16101PIT6294
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:
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
•Once all paths have been found, for each path remove the last node and save the path as a new path
3.Append random time slots to each web page of every transaction (web page browsing path)
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:
From the data structure point of view, following are some important
categories of algorithms −
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