scholarly journals WEB PAGES RECOMMENDATION SYSTEM BASED ON K-MEDOID CLUSTERING METHOD

2015 ◽  
Vol 2 (05) ◽  
Keyword(s):  
Recommendation System ◽  
Web Pages ◽  
Clustering Method

A DYNAMICS RECOMMENDATION SYSTEM BASED ON LOG MINING

2002 ◽  
Vol 13 (04) ◽  
pp. 521-530 ◽  
Author(s):  
WEN GAO ◽  
SHI WANG ◽  
BIN LIU
Keyword(s):  
Recommendation System ◽  
Predictive Accuracy ◽  
Web Pages ◽  
Web Log Mining ◽  
Web Page ◽  
Time Dynamic ◽  
Active User ◽  
Dynamic Web ◽  
Log Mining ◽  
A Current

This paper presents a new real-time, dynamic web page recommendation system based on web-log mining. The visit sequences of previous visitors are used to train a classifier for web page recommendation. The recommendation engine identifies a current active user, and submits its visit sequence as an input to the classifier. The output of the recommendation engine is a set of recommended web pages, whose links are attached to bottom of the requested page. Our experiments show that the proposed approach is effective: the predictive accuracy is quite high (over 90%), and the time for the recommendation is quite small.

Implementation K-Means Clustering Method in Job Recommendation System

2021 ◽  
Author(s):  
Betty Dewi Puspasari ◽  
Lany Lukita Damayanti ◽  
Andy Pramono ◽  
Aang Kisnu Darmawan
Keyword(s):  
Recommendation System ◽  
Clustering Method ◽  
Job Recommendation

Semantic Question Answering Using Wikipedia Categories Clustering

2014 ◽  
Vol 23 (04) ◽  
pp. 1460014 ◽  
Author(s):  
Georgios Stratogiannis ◽  
Georgios Siolas ◽  
Andreas Stafylopatis
Keyword(s):  
Information Retrieval ◽  
Linear Combination ◽  
Search Engine ◽  
Noun Phrase ◽  
Question Answering ◽  
Semantic Information ◽  
Web Pages ◽  
Clustering Method ◽  
Information Retrieval Methods ◽  
The Ideal

We describe a system that performs semantic Question Answering based on the combination of classic Information Retrieval methods with semantic ones. First, we use a search engine to gather web pages and then apply a noun phrase extractor to extract all the candidate answer entities from them. Candidate entities are ranked using a linear combination of two IR measures to pick the most relevant ones. For each one of the top ranked candidate entities we find the corresponding Wikipedia page. We then propose a novel way to exploit Semantic Information contained in the structure of Wikipedia. A vector is built for every entity from Wikipedia category names by splitting and lemmatizing the words that form them. These vectors maintain Semantic Information in the sense that we are given the ability to measure semantic closeness between the entities. Based on this, we apply an intelligent clustering method to the candidate entities and show that candidate entities in the biggest cluster are the most semantically related to the ideal answers to the query. Results on the topics of the TREC 2009 Related Entity Finding task dataset show promising performance.

BUILDING A KNOWLEDGE BASE FOR IMPLEMENTING A WEB-BASED COMPUTERIZED RECOMMENDATION SYSTEM

2007 ◽  
Vol 16 (05) ◽  
pp. 793-828 ◽  
Author(s):  
JUAN D. VELÁSQUEZ ◽  
VASILE PALADE
Keyword(s):  
Knowledge Base ◽  
Web Site ◽  
Web Mining ◽  
Recommendation System ◽  
The Internet ◽  
Web Pages ◽  
Web Based ◽  
Web Logs ◽  
Mining Tools ◽  
The Web

Understanding the web user browsing behaviour in order to adapt a web site to the needs of a particular user represents a key issue for many commercial companies that do their business over the Internet. This paper presents the implementation of a Knowledge Base (KB) for building web-based computerized recommender systems. The Knowledge Base consists of a Pattern Repository that contains patterns extracted from web logs and web pages, by applying various web mining tools, and a Rule Repository containing rules that describe the use of discovered patterns for building navigation or web site modification recommendations. The paper also focuses on testing the effectiveness of the proposed online and offline recommendations. An ample real-world experiment is carried out on a web site of a bank.

scholarly journals Webpage Recommendation System Based on the Social Media Semantic Details of the Website

2021 ◽  
Vol 12 (6) ◽  
pp. 237-243
Author(s):  
Dr. R.Rooba Et.al
Keyword(s):  
Recommendation System ◽  
Semantic Information ◽  
Markov Chain Model ◽  
Similarity Score ◽  
Web Pages ◽  
Chain Model ◽  
Web Page ◽  
The Social ◽  
Recommendation Accuracy ◽  
The Web

The web page recommendation is generated by using the navigational history from web server log files. Semantic Variable Length Markov Chain Model (SVLMC) is a web page recommendation system used to generate recommendation by combining a higher order Markov model with rich semantic data. The problem of state space complexity and time complexity in SVLMC was resolved by Semantic Variable Length confidence pruned Markov Chain Model (SVLCPMC) and Support vector machine based SVLCPMC (SSVLCPMC) meth-ods respectively. The recommendation accuracy was further improved by quickest change detection using Kullback-Leibler Divergence method. In this paper, socio semantic information is included with the similarity score which improves the recommendation accuracy. The social information from the social websites such as twitter is considered for web page recommendation. Initially number of web pages is collected and the similari-ty between web pages is computed by comparing their semantic information. The term frequency and inverse document frequency (tf-idf) is used to produce a composite weight, the most important terms in the web pages are extracted. Then the Pointwise Mutual Information (PMI) between the most important terms and the terms in the twitter dataset are calculated. The PMI metric measures the closeness between the twitter terms and the most important terms in the web pages. Then this measure is added with the similarity score matrix to provide the socio semantic search information for recommendation generation. The experimental results show that the pro-posed method has better performance in terms of prediction accuracy, precision, F1 measure, R measure and coverage.

Clustering Users According to Common Interest Based on User Search Behavior

2010 ◽  
Vol 143-144 ◽  
pp. 851-855 ◽  
Author(s):  
Pei Ying Zhang ◽  
Ya Jun Du ◽  
Chang Wang
Keyword(s):  
Recommendation System ◽  
Search Behavior ◽  
Common Interest ◽  
Web Pages ◽  
User Session ◽  
Novel Method ◽  
The Common ◽  
Syntactic Similarity ◽  
User Search Behavior ◽  
The Web

The paper presents a novel method to cluster users who share the common interest and discover their common interest domain by mining different users’ search behaviors in the user session, mainly the consecutive search behavior and the click sequence considering the click order and the syntactic similarity. The community is generated and this information will be used in the recommendation system in the future. Also the method is ‘content-ignorant’ to avoid the storage and manipulation of a large amount of data when clustering the web pages by content. The experiment proved it an available and effective way.

scholarly journals Cluster Centric Technique for Association Rule Mining(C-ARM) For High Precision and Coverage in Web Page Recommendation

2019 ◽  
Vol 8 (6) ◽  
pp. 1732-1735
Keyword(s):  
Association Rule ◽  
Association Rule Mining ◽  
Recommendation System ◽  
Computation Time ◽  
Web Pages ◽  
User Group ◽  
Web Page ◽  
Rule Mining ◽  
Modern Times ◽  
Over Time

Association Rule Mining (ARM) is known for its popularity and efficiency in the data mining domain. Over the recent years, the amount of data that gets accumulated in the internet is getting increased exponentially over time. The data available so are stored in online and are retrieved when a user requests for the same through key words with the help of a search engine. The important task of the search engines are to present the appropriate web pages that an user is expecting and in the modern times, The need of the hour is to recommend web pages to the users that he is interested in. This made the web page recommendation an important and vital task. Although many of the researchers are in the preliminary task of developing such systems, we in this research propose a recommendation model in which different users are interested upon a common item or domain by using the ARM concept. The data patterns that are in common are identified using the ARM and further these are clustered on a form of hierarchy .The clusters makes the recommendation system to easily identify the user group and based on the group, the pages are recommended, The experimental analysis are discussed and found to be efficient than the available methods in terms of computation time and reliability.

Sign in / Sign up

Export Citation Format

Share Document