Posts: 4,190
Threads: 817
Joined: Feb 2012
Mining Web Graphs for Recommendations
[attachment=18290]
INTRODUCTION
With the diverse and explosive growth of Web information,
how to organize and utilize the information effectively and
efficiently has become more and more critical. This is especially
important for Web 2.0 related applications since usergenerated
information is more free-style and less structured,
which increases the difficulties in mining useful information
from these data sources. In order to satisfy the information
needs of Web users and improve the user experience in
many Web applications, Recommender Systems, have been
well studied in academia and widely deployed in industry.
Typically, recommender systems are based on Collaborative
Filtering [14], [22], [25], [41], [46], [49], which is a technique
that automatically predicts the interest of an active user
by collecting rating information from other similar users or
items. The underlying assumption of collaborative filtering
is that the active user will prefer those items which other
similar users prefer [38].
RELATED WORK
Recommendation on the Web is a general term representing
a specific type of information filtering technique that attempts
to present information items (queries, movies, images, books,
Web pages, etc.) that are likely of interest to the users. In this
section, we review several work related to recommendation,
including collaborative filtering, query suggestion techniques,
image recommendation methods, and clickthrough data analysis.
2.1 Collaborative Filtering
Two types of collaborative filtering approaches are widely
studied: neighborhood-based and model-based.
The neighborhood-based approaches are the most popular
prediction methods and are widely adopted in commercial
collaborative filtering systems [37], [47]. The most analyzed
examples of neighborhood-based collaborative filtering include
user-based approaches [7], [21] and item-based approaches
[15], [37], [50]. User-based approaches predict the
ratings of active users based on the ratings of their similar
users, and item-based approaches predict the ratings of active
users based on the computed information of items similar
to those chosen by the active user.
2.2 Query Suggestion
In order to recommend relevant queries to Web users, a
valuable technique, query suggestion, has been employed by
some prominent commercial search engines, such as Yahoo!3,
Live Search4, Ask5 and Google6. However, due to commercial
reasons, few public papers have been released to reveal the
methods they adopt.
The goal of query suggestion is similar to that of query
expansion [11], [13], [56], [61], query substitution [31] and
query refinement [35], [57], which all focus on understanding
users’ search intentions and improving the queries submitted
by users. Query suggestion is closely related to query expansion
or query substitution, which extends the original query
with new search terms to narrow down the scope of the search.
But different from query expansion, query suggestion aims
to suggest full queries that have been formulated by previous
users so that query integrity and coherence are preserved in the
suggested queries [18]. Query refinement is another closelyrelated
notion, since the objective of query refinement is
interactively recommending new queries related to a particular
query.
can u send source code for mining web graph for recommendations because i am doing that project
Posts: 7,939
Threads: 421
Joined: Jun 2012
to get information about the topic "Mining Web Graphs for Recommendations" related topic refer the page link bellow
http://studentbank.in/report-mining-web-...mendations
can u send me the documenatation of mining web graphs for recommendations project
Posts: 4,577
Threads: 25
Joined: Mar 2013
To get full information or details of Mining Web Graphs for Recommendations please have a look on the pages
http://studentbank.in/report-mining-web-...mendations
http://studentbank.in/report-mining-web-...ations-ppt
http://studentbank.in/report-mining-web-...e=threaded
if you again feel trouble on Mining Web Graphs for Recommendations please reply in that page and ask specific fields in Mining Web Graphs for Recommendations
Hi am Ramya i would like to get details on web mining graph for recommendations seminar report..my friend said web mining graphs for recommendations seminar reports will be available here and now am living at kasaragod and now am doing my b tech so now i need help on this seminar topic
so am requesting for this seminar report and ppt .
Posts: 14,118
Threads: 61
Joined: Oct 2014
INTRODUCTION
With the diverse and explosive growth of Web information,
how to organize and utilize the information effectively and
efficiently has become more and more critical. This is especially
important for Web 2.0 related applications since usergenerated
information is more free-style and less structured,
which increases the difficulties in mining useful information
from these data sources. In order to satisfy the information
needs of Web users and improve the user experience in
many Web applications, Recommender Systems, have been
well studied in academia and widely deployed in industry.
Typically, recommender systems are based on Collaborative
Filtering which is a technique
that automatically predicts the interest of an active user
by collecting rating information from other similar users or
items. The underlying assumption of collaborative filtering
is that the active user will prefer those items which other
similar users prefer .
RELATED WORK
Recommendation on the Web is a general term representing
a specific type of information filtering technique that attempts
to present information items (queries, movies, images, books,
Web pages, etc.) that are likely of interest to the users. In this
section, we review several work related to recommendation,
including collaborative filtering, query suggestion techniques,
image recommendation methods, and clickthrough data analysis.
Collaborative Filtering
Two types of collaborative filtering approaches are widely
studied: neighborhood-based and model-based.
The neighborhood-based approaches are the most popular
prediction methods and are widely adopted in commercial
collaborative filtering systems . The most analyzed
examples of neighborhood-based collaborative filtering include
user-based approaches and item-based approaches
. User-based approaches predict the
ratings of active users based on the ratings of their similar
users, and item-based approaches predict the ratings of active
users based on the computed information of items similar
to those chosen by the active user.
Query Suggestion
In order to recommend relevant queries to Web users, a
valuable technique, query suggestion, has been employed by
some prominent commercial search engines, such as Yahoo!3,
Live Search4, Ask5 and Google6. However, due to commercial
reasons, few public papers have been released to reveal the
methods they adopt.
The goal of query suggestion is similar to that of query
expansion , query substitution and
query refinement , which all focus on understanding
users’ search intentions and improving the queries submitted
by users. Query suggestion is closely related to query expansion
or query substitution, which extends the original query
with new search terms to narrow down the scope of the search.
But different from query expansion, query suggestion aims
to suggest full queries that have been formulated by previous
users so that query integrity and coherence are preserved in the
suggested queries . Query refinement is another closelyrelated
notion, since the objective of query refinement is
interactively recommending new queries related to a particular
query.