0% found this document useful (0 votes)
30 views9 pages

Final Report Kmean 3

Uploaded by

ajeetgkp115
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
30 views9 pages

Final Report Kmean 3

Uploaded by

ajeetgkp115
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

CERTIFICATE

Certified that Ajeet Vishwakarma (Roll no: 2214670010002) has carried out the report entitled
“RECOMMENDATION SYSTEM USING K-MEAN CLUSTERING” for the award of
Bachelor of Technology from Institute of Engineering and Technology, Deen Dayal
Upadhyaya Gorakhpur University, Gorakhpur under my supervision. The report embodies
results of original work, and studies are carried out by the student himself and the contents of the
report do not form the basis for the award of any other degree to the candidate or to anybody else
from this or any other University/Institution.

(Signature)
Dr. Suryabhan Pratap Singh
Faculty of Information Technology
I.E. T., D. D. U. Gorakhpur University
Gorakhpur

ii
lOMoAR cPSD| 49289078

DECLARATION

I hereby declare that the work presented in this report entitled “K-Mean Clustering”, was carried
out by me. I have not submitted the matter embodied in this report for the award of any other
degree or diploma of any other University or Institute. I have given due credit to the original
authors/sources for all the words, ideas, diagrams, graphics, computer programs, experiments,
results, that are not my original contribution. I affirm that no portion of my work is plagiarized,
and the experiments and results reported in the report are not manipulated. In the event of a
complaint of plagiarism and the manipulation of the experiments and results, I shall be fully
responsible and answerable.

Name : Ajeet Vishwakarma


[Link]: 2214670010002
Branch : Information Technology

(Candidate’s signature)

iii
lOMoAR cPSD| 49289078

ABSTRACT

Recommender engines have become an integral component in today’s e- commerce


systems. From recommending books in Amazon1 to finding friends in social networks
such as Facebook , they have become omnipresent. Generally, recommender systems can
be classified into two main categories: content based and collaborative filtering based
models. Both these models build relationships between users and items to provide
recommendations. Content based systems achieve this task by utilizing features extracted
from the context available, whereas collaborative systems use shared interests between
user-item subsets. There is another relatively unexplored approach for providing
recommendations that utilizes a stochastic process named random walks. This study is a
survey exploring use cases of random walks in recommender systems and an attempt at
classifying them.

iv
lOMoAR cPSD| 49289078

ACKNOWLEDGEMENT

I extend my sincere gratitude and appreciation to all those who have contributed to the successful
completion of this report on the K-Mean Clustering. The collaboration, support, and expertise
provided by various individuals have been instrumental in compiling a comprehensive and
insightful overview of continuous casting operations. I would like to express my deepest thanks
to Deen Dayal Gorakhpur University for their administrative support. Furthermore, I extend my
appreciation to the professionals and experts who generously shared their experiences and
knowledge during interviews and discussions. Their inputs have added practical insights and
real-world perspectives to the report. This report stands as a collective effort, and their support
has been crucial to its success.

Sincerely,

…………………..
Ajeet Vishwakarma
Roll No.:2214670010002
[Link].(Information Technology)

v
lOMoAR cPSD| 49289078

TABLE OF CONTENTS

TITLE PAGE NO

CERTIFICATE ii
DECLARATION iii
ACKNOWLEDGEMENT iv
ABSTRACT V
LIST OF FIGURES vi

CHAPTER 1: INTRODUCTION 1

1.1 BRIEF OVERVIEW OF RECOMMENDATION SYSTEM


1
1.2 CONVENTIONAL METHODS OF RECOMMENDATION
SYSTEM 3
1.3 SHORTCOMING OF CONVENTIONAL
METHODS 5
1.4 IMPORTANCE OF RECOMMENDATION SYSTEM
IN OTHER DOMAINS 6
1.5 EVOLUTION OF PPROPOSED APPROCH 7

CHAPTER 2: OVERVIEW OF PROPOSED A P P R O A C H 8

2.1 K NEIGHBOURING METHOD 8


2.2 RANDOM WALK ALGORITHM 12

CHAPTER 3: THE PROPOSED APPROACH 13

3.1 K MEAN CLUSTERING 15

vi
lOMoAR cPSD| 49289078

3.2 RANDOM WALK APPROACH 16


3.3 MARKOVS CHAIN 19

CHAPTER 4: COMPREHENSIVE EVALUATION 20

4.1 DATA SET 20


4.2 EVALUATION METRICES 20

CHAPTER 5: PROPOSED METHOD OVER


21
TRADITIONAL METHOD

CHAPTER 6: DISCUSSION AND CONCLUSION 22

REFERENCE 23

vii
LIST OF FIGURES

FIG NO PAGE NO

1.1 COLABORATIVE FILLTERING 4

1.2 CONTENT BASED FILTERING 4

1.3 HYBRID RECOMMENDATION 4

3.1 K MEAN CLUSTERING 9

3.2 VISUALIZATION OF CLUSTERED 13


DATA

viii
lOMoAR cPSD| 49289078

ABBREVIATION

RSs Recommender Systems


CF Collaborative Filtering
KNN k-Nearest Neighbors
SVD Singular Value Decomposition
PCA Principal Component Analysis
TF-IDF Term Frequency-Inverse Document Frequency
BSS Between-cluster Sum of Squares
WSS Within-cluster Sum of Squares
MAE Mean Absolute Error
RMSE Root Mean Squared Error

ix
lOMoAR cPSD| 49289078

ix

You might also like