ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
Abstract:
Recommendation systems will profit of linguistics rea
-soning-capabilities to beat common limitations of cur
-rent systems and improve the recommendations’ quality. In this proposed System we are proposing two types of
search services they are Content based search and Seman
-tic based Search. In Content based search we are using
Stemming Algorithm. During this paper, gift a personal
-ized-recommendation system, a system that creates use of representations of things and user-profiles supported ontology so as to produce linguistics applications with
customized services. The recommender uses domain on
-tology to boost the personalization: on the one hand, us
-er’s interests square measure sculptured in a very simpler and correct means by applying a domain-based abstract
thought method; on the opposite hand, the stemmer for
-mula employed by our content-based filtering approach, that provides a live of the affinity between AN item and a user, is increased by applying a linguistics similarity methodology internet Usage Mining plays a vital role in
recommender systems and internet personalization. Dur
-ing this paper, we have a tendency to propose a good rec
-ommender system supported metaphysics and internet
Usage Mining. The primary step of the approach is ex
-tracting options from internet documents and construct
-ing relevant ideas. Then build metaphysics for the online website use the ideas and important terms extracted from documents. Consistent with the linguistics similarity of
internet documents to cluster them into completely dif
-ferent linguistics themes, the completely dif-ferent the various themes imply different preferences. The planned approach integrates linguistics data into internet Usage Mining and personalization processes.
Keywords:
Web usage mining, Web-page recommen-dation, domain ontology, semantic network, knowledge representation.
Yagnasri Ashwini
PG Schloar,Department of Computer Science and Information Technology,
Aurora College of Technological and Research Insti-tute, Hyderabad, Telangana, India.
K.Kavitha
Associate professor,Department of Computer Science and Information Technology,
Aurora College of Technological and Research Insti-tute, Hyderabad, Telangana, India.
Introduction:
The recommendations. Recent studies have advised that domain information of the online application within the kind of metaphysics will play a vital role in providing
smarter and additional comprehensive recommender
sys-tems. Hence Associate in nursing increasing effort is re
-quired in process the online pages and objects in terms of linguistics data within the kind of ontology’s. the mix of internet Usage Mining and linguistics internet has created a brand new and quick rising analysis space - linguistics internet Mining. The linguistics internet is predicated on a vision of Tim Berners-Lee, the creator of the web. The linguistics internet enriches the web by machine method ready data that supports the user in accomplishing his
tasks additional simply [6]. The vision of a linguistics in
-ternet has recently drawn significant attention each from
tutorial and industrial circles. the concept behind mistreat
-ment the linguistics internet for generating customized in
-ternet expertise is to boost the results of in-ternet mining
by exploiting the new linguistics structures [2]. As a con
-sequence of the higher than concerns there’s Associate in Nursing increasing effort in process websites and objects in terms of linguistics data by mistreatment metaphysics. This paper presents a completely unique methodology to produce higher internet page recommendation supported Web usage and domain information , that is supported by 3 new information illustration models and a group of Web-page recommendation methods. The primary model
is Associate in Nursing ontology-based model that repre
-sents the domain information of an internet site. the devel
-opment of this model is semi-automated in order that the
event efforts from developers will be reduced. The sec
-ond model may be a linguistics network that represents domain information, whose construction will be totally automatic. This model will be simply incorporated into a Web-page recommendation method owing to this totally automatic feature.
Recommendations on Web Page Using Domain Knowledge and
Web Usage Mining For Personalization
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
The third model may be a abstract prediction model, that may be a navigation network of domain terms supported the oftentimes viewed internet-pages and represents the
integrated Web usage and domain information for support
-ing Web-page prediction. The development of this model will be totally automatic. The advice methods build use of the domain information and also the prediction model through 2 of the 3 models to predict consecutive pages with possibilities for a given internet user supported his or her current Web-page navigation state. To a good extent,
this new methodology has automatic the content construc
-tion and mitigated the new-page drawback as men-tioned higher than. This methodology yields higher performance compared with the present internet usage primarily based Web-page recommendation systems. In applying sequence
learning models to Web-page recommendation, associa
-tion rules and probabilistic models have been normally used. Some models, like ordered modeling, have shown
their important effectiveness in recommendation genera
-tion [2]. So as to model the transi-tions between totally different internet-pages in Web sessions, Markov models and tree-based structures are robust candidates. Some
surveys , have shown that tree-based algorithms, nota
-bly Pre-Order coupled WAP-Tree Mining are outstand
-ing in support-ing Web-page recommendation, compared with alternative sequence mining algorithms. moreover, the mixing of PLWAPMine and the higher-order Markov model will significantly enhance mining performance
Existing system:
• Useful information discovery from internet usage knowledge and satisfactory information illustration for effective Web-page recommendations area unit crucial and difficult.
• Existing system give technique to with efficiency give higher internet-page recommendation through linguistics sweetening by desegregation the domain and Web usage information of an internet site. 2 new models area unit planned to represent the domain information.
• The 1st model uses metaphysics to represent the do
-main information. The second model uses one mechani
-cally generated linguistics network to represent domain terms, Web-pages and therefore the relations between them. Another new model, the abstract prediction model, is planned to mechanically generate a linguistics network of the linguistics internet usage information, that is that the integration of domain information and internet usage information.
• A range of queries are developed to question concern
-ing these information bases. Supported these queries, a
group of advice ways are planned to get Web-page can
-didates. The advice results are compared with the results
obtained from a complicated existing internet Usage Min
-ing (WUM) technique.
Disadvantages:
• Existing recommendation systems are: cold-start, sparse
-ly, overspecialization and domain-dependency.
• The performance of existing system depends on the siz
-es of coaching datasets. the larger the coaching dataset size is, foreseen pages square measure restricted inside the discovered net access sequences.
• The domain metaphysics will be created manually by specialists, or by mechanically learning models is ought to style and implement the training models which may solely be done by professionals at the start.
Proposed system:
In planned system gift a personalized-recommendation
»
system, a system that produces use of representations of
things and user-profiles supported ontology so as to pro
-duce linguistics applications with personalized services. In this proposed System we are proposing two types of
search services they are Content based search and Seman
-tic based Search.In Content based search we are using Stemming Algorithm.
The linguistics technique achieved by victimization 2
»
completely different strategies. A domain-based technique
makes inferences regarding user’s interests and a taxon
-omy-based similarity technique is employed to refine the
item-user matching algorithmic rule, rising overall re
-sults. The recommender planned is domain-independent, is enforced as an online service, and uses each specific and implicit feedback-collection strategies to get info on user’s interests.
Proposed recommender system supported metaphys
-»
ics and internet Usage Mining. the primary step of the approach is extracting options from internet documents and constructing relevant ideas. Then build metaphysics for the net website use the ideas and vital terms extracted
from documents. per the linguistics similarity of inter
-net documents to cluster them into completely different linguistics themes, the completely different the various themes imply different preferences.
Volume No: 2 (2015), Issue No: 12 (December)
December 2015
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
Advantages:
• Integrating domain data with internet usage data enhanc
-es the performance of recommender systems exploitation ontology-based internet mining techniques.
• The construction of this model is semi-automated so the event efforts from developers may be reduced.
• The user-profile learning algorithmic rule, answerable for increasing and maintaining up-to-date the long user’s interests, employs a domain-based reasoning technique together with alternative connexion feedback strategies to populate a lot of quickly the user profile and thus scale back the standard cold-start drawback.
• The filtering algorithmic rule, that follows a stemming approach, makes use of a linguistics similarity technique supported the data structure of the metaphysics to refine the item-user matching score calculation.
System design:
Literature survey:
Bringing Order to the Web: Automatically
Categorizing Search Results:
This model was then accustomed classify new websites came from search engines on-the-fly. This approach has the advantage of investing famous and consistent class
info to help the user in quickly focusing in on task-rel
-evant info. The interface permits users to browse and manipulate classes, and to look at documents within the context of the class structure.
Automatic Identification of User Goals in Web
Search:
In this paper we tend to study whether or not and the way we will automatize this goal-identification method. We tend to 1st gift our results from a personality’s subject
study that powerfully indicates the feasibleness of auto
-matic query-goal identification.
Query Recommendation using Query Logs in
Search Engines:
In this paper we tend to propose a way that, given a ques
-tion submitted to a computer program, suggests an in
-ventory of connected queries. The connected queries are based mostly in antecedently issued queries, and may be issued by the user to the computer program to tune or art the search method.
Varying Approaches to Topical Web Query
Classification:
We have evaluated 3 differing approaches to topical net
question classification. we discover that coaching express
-ly from classified queries outperforms bridging a docu
-ment taxonomy for coaching by the maximum amount as forty eighth in F1.
Context-Aware Query Suggestion by Mining
Click-Through and Session Data:
In this paper, we have a tendency to propose a unique context-aware question suggestion approach that is in 2 steps. within the o²ine model-learning step, to handle knowledge exiguity, queries square measure summarized into ideas by bunch a click-through bipartite.
Stemming Algorithm:
Stemming is reducing the word to the root form, where lemmatisation is concerned with linguistics I believe lemmatization is “go”, “gone”, “going”, “goes”, “been” and “went” where stemming a word would be reducing a word from “gone” to “go”, so it can be matched to other stemmed words such as “going”, as “going” stemmed would be “go” also, a better example. These four words
would not matchup. If they were tested for equality, how
-ever by stemming these words we can reduce them.
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
engineering --> engineer engineers --> engineer engineered --> engineer engineer --> engineer
now we have stemmed words they will match for equal
-ity, so now if i try searching using the word for engineer, documents on engineering, engineers and engineered
would be returned from a stemmed index/database. Stem
-ming usually means to cut off characters from the end of the word, e.g.walked -> walk, walking -> walk. However,
this does not necessarily produce a real word, e.g. a stem
-mer could also change house and houses to “hous”. Also, cutting of characters isn’t enough for irregular words, e.g. you cannot get from “went” to “go” by just cutting of characters. A lemmatizer solves these problems, i.e. it always produces real words, even for irregular forms. It usually needs a table of irregular forms for this. Reducing words to a rootform(stemming) - changing words into the basic form (lemmatization).
Proposed Methodology And Discussion:
a).Sequential Pattern Mining For Web
Us-age:
The goal of WUM is to capture, model, and analyse the behavioural patterns and profiles of users interacting with
a website (Liu, Mobasher & Nasraoui 2011). The discov
-ered patterns are usually a set of sequences of pages that are frequently accessed by groups of users with common
interests. Sequential pattern mining algorithms are appro
-priate for this purpose since they can take the Web access sequences (WAS) as the input and output the frequent web access pattern(FWAP).
b)Semantic Network Modeling For Webpage
Recommendation:
Traditional ontology construction is a labour-intensive
and time-consuming task and highly relies on human ex
-perts. Moreover, such constructed ontologies are often fixed to a specific domain of interest. This often leads to the difficulties of reusing existing ontologies. Therefore, it has become highly desirable to develop an efficient
method to automate knowledge acquisition, representa
-tion and applica-tion. A semantic network of Web-page is
a kind of knowledge map which refers to domain con
-cepts and the relations between these con-cepts as well as Web-pages and the links between the domain concepts and Webpages.
The automatic approach to the semantic network con
-struction of Web-pages aims at supporting automated knowledge discovery and knowledge representation in Web-page recommender systems.
Procedure of Automatically Constructing
a Semantic Network of Web-pages
(Term-NetWP) :
The purpose of the automated construction of semantic network of Web-pages to facilitate automated processes discovering and representing the semantic knowledge of
visited Web-pages of a website for supporting more ef
-fective Webpagerecommendations is fulfilled by a nov
-el method that take Web logs of a given website as the input and produce the semantic network of Webpages automatically. The flow diagram of implementing this method consists of four processes: (1) accessed Web-page
collection,(2) term extraction, (3) semantic network pop
-ulation of Web-pages, and (4) Implement an automatic construction of TermNetWP.
1. Collection of Accessed Web-pages:
This process firstly pre-processes Web logs to extract the URLs of Web-pages that have been visited by users at the given website, and then the URLs are crawled to fetch the metadata of Web-pages, i.e. the titles of Web-pages based on the TITLE tag on the HTML documents of Web-pages.
2. Extraction of Domain Terms:
This process extracts the domain terms from the titles of
Web-pages retrieved in the first process (1). A term ex
-traction algorithm is designed to extract terms from the Web-page titles. With this algorithm, tokens are firstly extracted, and then domain terms are generated based on these tokens. The results of this process are domain term sequences, each of which is a list of terms in the order as they appear in the titles.
3.Construction of a SemanticNetwork of
Web-Pages:
Based on the term sequences obtained from Process (2), a
semantic knowledge representation model is built accord
-ing to a collocation map (Park, Han & Choi 1995) and the Markov models (Borges & Levene 2005), in which
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
Advantages:
• Integrating domain data with internet usage data enhanc
-es the performance of recommender systems exploitation ontology-based internet mining techniques.
• The construction of this model is semi-automated so the event efforts from developers may be reduced.
• The user-profile learning algorithmic rule, answerable for increasing and maintaining up-to-date the long user’s interests, employs a domain-based reasoning technique together with alternative connexion feedback strategies to populate a lot of quickly the user profile and thus scale back the standard cold-start drawback.
• The filtering algorithmic rule, that follows a stemming approach, makes use of a linguistics similarity technique supported the data structure of the metaphysics to refine the item-user matching score calculation.
System design:
Literature survey:
Bringing Order to the Web: Automatically
Categorizing Search Results:
This model was then accustomed classify new websites came from search engines on-the-fly. This approach has the advantage of investing famous and consistent class
info to help the user in quickly focusing in on task-rel
-evant info. The interface permits users to browse and manipulate classes, and to look at documents within the context of the class structure.
Automatic Identification of User Goals in Web
Search:
In this paper we tend to study whether or not and the way we will automatize this goal-identification method. We tend to 1st gift our results from a personality’s subject
study that powerfully indicates the feasibleness of auto
-matic query-goal identification.
Query Recommendation using Query Logs in
Search Engines:
In this paper we tend to propose a way that, given a ques
-tion submitted to a computer program, suggests an in
-ventory of connected queries. The connected queries are based mostly in antecedently issued queries, and may be issued by the user to the computer program to tune or art the search method.
Varying Approaches to Topical Web Query
Classification:
We have evaluated 3 differing approaches to topical net
question classification. we discover that coaching express
-ly from classified queries outperforms bridging a docu
-ment taxonomy for coaching by the maximum amount as forty eighth in F1.
Context-Aware Query Suggestion by Mining
Click-Through and Session Data:
In this paper, we have a tendency to propose a unique context-aware question suggestion approach that is in 2 steps. within the o²ine model-learning step, to handle knowledge exiguity, queries square measure summarized into ideas by bunch a click-through bipartite.
Stemming Algorithm:
Stemming is reducing the word to the root form, where lemmatisation is concerned with linguistics I believe lemmatization is “go”, “gone”, “going”, “goes”, “been” and “went” where stemming a word would be reducing a word from “gone” to “go”, so it can be matched to other stemmed words such as “going”, as “going” stemmed would be “go” also, a better example. These four words
would not matchup. If they were tested for equality, how
-ever by stemming these words we can reduce them.
Volume No: 2 (2015), Issue No: 12 (December)
December 2015
www.ijmetmr.com
Page 288
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
engineering --> engineer engineers --> engineer engineered --> engineer engineer --> engineer
now we have stemmed words they will match for equal
-ity, so now if i try searching using the word for engineer, documents on engineering, engineers and engineered
would be returned from a stemmed index/database. Stem
-ming usually means to cut off characters from the end of the word, e.g.walked -> walk, walking -> walk. However,
this does not necessarily produce a real word, e.g. a stem
-mer could also change house and houses to “hous”. Also, cutting of characters isn’t enough for irregular words, e.g. you cannot get from “went” to “go” by just cutting of characters. A lemmatizer solves these problems, i.e. it always produces real words, even for irregular forms. It usually needs a table of irregular forms for this. Reducing words to a rootform(stemming) - changing words into the basic form (lemmatization).
Proposed Methodology And Discussion:
a).Sequential Pattern Mining For Web
Us-age:
The goal of WUM is to capture, model, and analyse the behavioural patterns and profiles of users interacting with
a website (Liu, Mobasher & Nasraoui 2011). The discov
-ered patterns are usually a set of sequences of pages that are frequently accessed by groups of users with common
interests. Sequential pattern mining algorithms are appro
-priate for this purpose since they can take the Web access sequences (WAS) as the input and output the frequent web access pattern(FWAP).
b)Semantic Network Modeling For Webpage
Recommendation:
Traditional ontology construction is a labour-intensive
and time-consuming task and highly relies on human ex
-perts. Moreover, such constructed ontologies are often fixed to a specific domain of interest. This often leads to the difficulties of reusing existing ontologies. Therefore, it has become highly desirable to develop an efficient
method to automate knowledge acquisition, representa
-tion and applica-tion. A semantic network of Web-page is
a kind of knowledge map which refers to domain con
-cepts and the relations between these con-cepts as well as Web-pages and the links between the domain concepts and Webpages.
The automatic approach to the semantic network con
-struction of Web-pages aims at supporting automated knowledge discovery and knowledge representation in Web-page recommender systems.
Procedure of Automatically Constructing
a Semantic Network of Web-pages
(Term-NetWP) :
The purpose of the automated construction of semantic network of Web-pages to facilitate automated processes discovering and representing the semantic knowledge of
visited Web-pages of a website for supporting more ef
-fective Webpagerecommendations is fulfilled by a nov
-el method that take Web logs of a given website as the input and produce the semantic network of Webpages automatically. The flow diagram of implementing this method consists of four processes: (1) accessed Web-page
collection,(2) term extraction, (3) semantic network pop
-ulation of Web-pages, and (4) Implement an automatic construction of TermNetWP.
1. Collection of Accessed Web-pages:
This process firstly pre-processes Web logs to extract the URLs of Web-pages that have been visited by users at the given website, and then the URLs are crawled to fetch the metadata of Web-pages, i.e. the titles of Web-pages based on the TITLE tag on the HTML documents of Web-pages.
2. Extraction of Domain Terms:
This process extracts the domain terms from the titles of
Web-pages retrieved in the first process (1). A term ex
-traction algorithm is designed to extract terms from the Web-page titles. With this algorithm, tokens are firstly extracted, and then domain terms are generated based on these tokens. The results of this process are domain term sequences, each of which is a list of terms in the order as they appear in the titles.
3.Construction of a SemanticNetwork of
Web-Pages:
Based on the term sequences obtained from Process (2), a
semantic knowledge representation model is built accord
-ing to a collocation map (Park, Han & Choi 1995) and the Markov models (Borges & Levene 2005), in which
Volume No: 2 (2015), Issue No: 12 (December)
December 2015
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
occurrence weights of terms and associations between terms are taken into account to assess the frequencies of terms and collocations in the domain.
The schema of this model is designed to represent the domain terms, Web-pages, and the relationships between
them which can
be populated to form a semantic network of Web-pages referred to as TermNetWP. This network is the domain knowledge base of this website.
4.Implement an automatic construction of
TermNetWP :
The TermNetWP is implemented in OWL to enable the domain term network to be reused and shared by other parts of a Web-page recommender system.
C) Concept Navigation Model Of Web Usage
Of A Website For Prediction:
In order to make better Web-page recommendations, we
need semantic Web usage knowledge which can be ob
-tained by integrating the domain knowledge model (Do
-mainOntoWP) or the semantic network (TermNetWP) with Web usage knowledge that can be discovered from Web log files using a Web usage mining technique. A concept navigation model is proposed to automatically generate a weighted network of concept navigation. This model employ an advanced Web usage mining technique,
namely PLWAPMine, to discover the Web usage knowl
-edge, which is in the form of frequent Web access patterns (FWAP), i.e patterns of frequently visited Web-pages. We integrate FWAP with DomainOntoWP or TermNetWP in order to 1result in a set of frequently viewed term patterns (FVTP),this is the semantic knowledge of Web usage.
Experimental Evaluation:
In order to evaluate the effectiveness of the proposed mod
-els of knowledge representation and the recommendation strategies, these models and strategies are implemented
to test their performance of the web page recommenda
-tions.
Definition(Web-page recommendation rules)
Let S = s1s2 …sk sk+1…sn be a WAS. For each prefix sequence S prefix= s1 s2 …sk (1 ≤k ≤n-1), a Web-page recommendation rule is defined as a set of recommended Web-pages which are generated by a Web-page
recommendation strategy, denoted as RR={r1, r2, …,rM}, where ri (i=[1..M]) is a recommended Web-page.
A Web-page recommendation rule is deemed as correct,
and/or satisfied, or empty based on the following condi
-tions:
- If sk+1€ RR, RR is correct.
- If si € RR(k+ 1 ≤i ≤n), RR is satisfied. - If M = 0, RR is empty.
Given a set of recommendation rules, R = {RR1, RR2… RRN}, where RRi (1 ≤i ≤N) is a recommendation rule, and |R| = N is the total number of recommendation rules in R including empty rules.
Performance Evaluation:
The performance of Web-page recommendation strategies is measured in terms of two major performance metrics: Precision and Satisfaction according to Zhou (2004).. The precision is useful to measure how probable a user will access one of the recommended Web-pages. Besides, we
also need to consider if a user accesses one of the recom
-mended Web-pages in the near future. Actually, the next page accessed by a user may not the target page that user
wants. In many cases, a user has to access a few inter
-mediate pages before reaching the target page. Hence, the satisfaction is necessary to give the precision that the recommended pages will be accessed in the near future. In order to calculate these two metrics, thissub-section first introduces a definition of Web-page recommendation rules
Conclusion:
In this paper, a unique approach has been projected to in
-fer user search goals for a question by bunch its feedback sessions depicted by pseudo-documents. First, we have a tendency to introduce feedback sessions to be analyzed to infer user search goals instead of search results or clicked URLs. Each the clicked URLs and therefore the unclicked ones before the last click are thought of as user implicit feedbacks and brought into consideration to construct feedback sessions. Therefore, feedback sessions will replicate user info wants a lot of expeditiously. Second, we have a tendency to map feedback sessions to pseudo documents to approximate goal texts in user minds. The
pseudo-documents will enrich the URLs with further mat
ISSN No: 2348-4845
International Journal & Magazine of Engineering,
Technology, Management and Research
A Peer Reviewed Open Access International Journal
Supported these pseudo-documents, user search goals will then be discovered and pictured with some keywords. Finally, a replacement criterion Stemming is developed to gauge the performance of user search goal abstract thought. Experimental results on user click-through logs from an ad program demonstrate the effectiveness of our projected strategies. The complexness of our approach is low and our approach will be utilized in reality simply.
for every question, the time period depends on the quan
-tity of feedback sessions. However, the dimension of Ffs in and isn’t terribly high. Therefore, the time period is typically short. In reality, our approach will discover user search goals for a few standard queries offline initially. Then, once users submit one in every of the queries, the program will come back the results that are categorized into completely different teams in step with user search goals on-line. Thus, users will realize what they require handily.
References:
[1] B. Liu, B. Mobasher, and O. Nasraoui, “Web Usage Mining,” in Web Data Mining: Exploring Hyperlinks, Contents, and Usage Data, B. Liu, Ed.: Springer-Verlag Berlin Heidelberg, 2011, pp. 527-603.
[2] B. Mobasher, “Data Mining for Web Personalization,”
in The Adaptive Web. vol. 4321, P. Brusilovsky, A. Ko
-bsa, and W. Nejdl, Eds.: Springer-Verlag Berlin, Heidel
-berg, 2007, pp. 90-135.
[3] G. Stumme, A. Hotho, and B. Berendt, “Usage Mining for and on the Semantic Web,” AAAI/MIT Press, 2004, pp. 461-480.
[4] H. Dai and B. Mobasher, “Integrating Semantic Knowledge with Web Usage Mining for Personalization,” in Web Mining: Applications and Techniques, A. Scime, Ed. Hershey, PA, USA: IGI Global, 2005, pp. 276 - 306.
[5] S. A. Rios and J. D. Velasquez, “Semantic Web Usage Mining by a Concept-Based Approach for Off-line Web Site Enhancements,” in Web Intelligence and Intelligent Agent Technology, 2008. WI-IAT ‘08. IEEE/WIC/ACM International Conference on, 2008, pp. 234-241.
[6] S. Salin and P. Senkul, “Using Semantic Information for Web Usage Mining based Recommendation,” in 24th International Symposium on Computer and Information Sciences, 2009., 2009,
pp. 236-241.
[7] A. Bose, K. Beemanapalli, J. Srivastava, and S. Sa
-har, “Incorporating Concept Hierarchies into Usage Min
-ing Based Recommendations,” in Proceed-ings of the 8th
Knowledge discovery on the web international confer
-ence on Advances in web mining and web usage analysis Philadelphia, PA, USA: Springer-Verlag, 2007, pp. 110-126.
[8] N. R. Mabroukeh and C. I. Ezeife, “Semantic-Rich
Markov Models for Web Prefetching,” in 2009 IEEE In
-ternational Conference on Data Mining Workshops Mi
-ami, Florida, USA, 2009, pp. 465-470.
[9] M. O’Mahony, N. Hurley, N. Kushmerick, and G. Silvestre, “Collaborative recommendation: A robustness analysis,” ACM Transactions on Internet Technology, vol. 4, pp. 344-377, 2004.
[10] G. Stumme, A. Hotho, and B. Berendt, “Semantic Web Mining: State of the art and future directions,” Web Semantics: Science, Services and Agents on the World Wide Web, vol. 4, pp. 124-143,
2006.
Volume No: 2 (2015), Issue No: 12 (December)
December 2015
