Welcome to the InfoSci Platform
Reference Hub1
An Efficient and Accurate Discovery of Frequent Patterns Using Improved WARM to Handle Large Web Log Data

An Efficient and Accurate Discovery of Frequent Patterns Using Improved WARM to Handle Large Web Log Data

Sahaaya Arul Mary, M. Malarvizhi
Copyright: © 2014 |Volume: 9 |Issue: 2 |Pages: 18
ISSN: 1554-1045|EISSN: 1554-1053|EISBN13: 9781466655300|DOI: 10.4018/ijitwe.2014040103
Cite Article Cite Article

MLA

Mary, Sahaaya Arul, and M. Malarvizhi. "An Efficient and Accurate Discovery of Frequent Patterns Using Improved WARM to Handle Large Web Log Data." IJITWE vol.9, no.2 2014: pp.47-64. http://doi.org/10.4018/ijitwe.2014040103

APA

Mary, S. A. & Malarvizhi, M. (2014). An Efficient and Accurate Discovery of Frequent Patterns Using Improved WARM to Handle Large Web Log Data. International Journal of Information Technology and Web Engineering (IJITWE), 9(2), 47-64. http://doi.org/10.4018/ijitwe.2014040103

Chicago

Mary, Sahaaya Arul, and M. Malarvizhi. "An Efficient and Accurate Discovery of Frequent Patterns Using Improved WARM to Handle Large Web Log Data," International Journal of Information Technology and Web Engineering (IJITWE) 9, no.2: 47-64. http://doi.org/10.4018/ijitwe.2014040103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In the booming era of Internet, web search is inevitable to everyone. In web search, mining frequent pattern is a challenging one, particularly when handling tera byte size databases. Finding solution for these issues have primarily started attracting the key researchers. Due to high the demand in finding the best search methods, it is very important and interesting to predict the user's next request. The number of frequent item sets and the database scanning time should be reduced for fast generating frequent pattern mining. It fulfills user's accurate need in a magic of time and offers a customized navigation. Association Rule mining plays key role in discovering associated web pages and many researchers are using Apriori algorithm with binary representation in this area. But it does not provide best solution for finding navigation order of web pages. To overcome this, weighted Apriori was introduced. But still, it is difficult to produce most favorable results especially in large databases. In the effort of finding best solution, the authors have proposed a novel approach which combines weighted Apriori and dynamic programming. The conducted experiments so far, shows' better tracking of maintaining navigation order and gives the confidence of making the best possible results. The proposed approach enriches the web site effectiveness, raises the knowledge in surfing, ensures prediction accuracies and achieves less complexity in computing with very large databases.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.