Web page recommendation system based on partially ordered sequential rules

2017 ◽  
Vol 32 (4) ◽  
pp. 3009-3015 ◽  
Author(s):  
Harpreet Singh ◽  
Manpreet Kaur ◽  
Parminder Kaur
2002 ◽  
Vol 13 (04) ◽  
pp. 521-530 ◽  
Author(s):  
WEN GAO ◽  
SHI WANG ◽  
BIN LIU

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.


2018 ◽  
Vol 29 (1) ◽  
pp. 583-595 ◽  
Author(s):  
V. Raju ◽  
N. Srinivasan

Abstract This paper explains about the web page recommendation system. This procedure encompasses consumers’ upcoming demand and web page recommendations. In the proposed web page recommendation system, potential and non-potential data can be categorized by use of the Levenberg–Marquardt firefly neural network algorithm, and forecast can be made by using the K-means clustering algorithm. Consequently, the projected representation demonstrates the infrequent contact format with the help of the representation that integrates the comparable consumer access model data that belong to the further consumer. Thereafter, the impending user data are specified to the clustering progression. The third phase of the projected process is collecting potential data with the aid of the improved fuzzy C-means clustering algorithm. The last step of our projected process is envisaging the upcoming demand for the subsequent consumer. The presentation of the projected procedure will be compared to the obtainable procedure.


Author(s):  
Dr. R.Rooba Et.al

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.


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.


The emerging web page development requires semantic applications with customized administrations. The proposed methodology presents a customized suggestion framework, which makes utilization of item representations and also client profiles created based on ontology. The domain ontology helps the recommender to improve the personalization: from one perspective, client’s interests are displayed in an increasingly powerful and precise route by applying an area based derivative technique; on the other side, the stemmer algorithm derived content- based filtering approach, gives an evaluation of resemblance among a thing and a client, upgraded by applying a semantic likeliness strategy. Recommender frameworks and web personalize were assumed by Web usage mining as a critical job. The proposed strategy is s successful framework dependent on ontology and web usage mining. Extricating highlights from web reports and building applicable ideas is the initial step of the methodology. At that point manufacture metaphysics for the site exploit the ideas and huge terms separated from reports. As per the semantic similitude of web archives to bunch them into various semantic topics, the distinctive subjects suggest diverse inclinations. The proposed methodology incorporates semantic information into Web Usage Mining and personalization process


2018 ◽  
Author(s):  
Ryan L. Boyd ◽  
James W. Pennebaker

Nearly 25% of incoming UT-Austin students are unable to get their first two choices for a college major. Historically, these students have been given an extensive list of all potential majors from which to choose. Many students simply lack awareness of the various majors and have no background knowledge that could be helpful in determining whether specific majors would suit their interests or skills.The purpose of this project was to rely on students’ admissions essays to provide a more coherent and tailored set of recommendations when students are selecting an alternative college major. The logic underlying this project is based on decades of empirical research demonstrating that psychological information can be extracted from the language of students’ admissions essays via automated computer analyses. The results of these analyses can then be used to inform the “college major options” webpage so that potential majors most closely aligned with their interests and skills will be displayed first in a recommendation system.


Sign in / Sign up

Export Citation Format

Share Document