Loading [MathJax]/extensions/MathMenu.js
A Semantic Web Personalizing Technique: The Case of Bursts in Web Visits | IEEE Conference Publication | IEEE Xplore

A Semantic Web Personalizing Technique: The Case of Bursts in Web Visits


Abstract:

The explosive growth in the size and use of the World Wide Web continuously creates new great challenges and needs. The need for predicting the users' preferences in orde...Show More

Abstract:

The explosive growth in the size and use of the World Wide Web continuously creates new great challenges and needs. The need for predicting the users' preferences in order to expedite and improve the browsing though a site can be achieved through personalizing of the websites. A personalization mechanism is based on explicit preference declarations by the user and on an iterative process of monitoring the user navigation, collecting its requests of ontological objects and storing them in its profile in order to deliver personalized content. The problem that we address is the case where few web pages become very popular for short periods of time and are accessed very frequently in a limited temporal space. Our aim is to deal with these bursts of visits and suggest these highly accessed pages to the future users that have common interests. Hence, in this paper, we propose a new web personalization technique, based on advanced data structures. The data structures that are used are the Splay tree (1) and Binary heaps (2). We describe the architecture of the technique, analyze the time and space complexity and prove its performance. In addition, we compare both theoretically and experimentally the proposed technique to another approach to verify its efficiency. Our solution achieves O(P2) space complexity and runs in k·logP time, where k is the number of pages and P the number of ontologies of Web pages.
Date of Conference: 22-24 September 2010
Date Added to IEEE Xplore: 11 November 2010
ISBN Information:
Conference Location: Pittsburgh, PA, USA
References is not available for this document.

I. Introduction

The Semantic Web leverages the knowledge integration on the Web to new levels. Despite the efforts put into the technical and research issues, there are few applications actually deploying and evaluating semantic web with real users. Semantic web can only deliver if it is driven by user needs, context or profiles to seamlessly integrate the knowledge on the web to really provide desirable content.

Select All
1.
Y. Cho, J. Kim and S. Kim, "A personalized recommender system based on web usage mining and 20th Computer Science Seminar SF2-T2–4 decision tree induction", Expert Systems with Applications, vol. 23, pp. 329-342, 2002.
2.
U. Dayal, E. Hanson and J. Widom, "Active Database Systems" in Modern Database Systems: The Object Model Interoperability and Beyond, Reading, MA:Addison-Wesley, 1994.
3.
J. Fong, J. Hughes and J. Zhu, Online Web Mining Transactions Association Rules using Frame Metadata Model. IEEE., pp. 121-129, 2000.
4.
I. Garrigós, J. Gómez and C. Cachero, "Modelling Dynamic Personalization in Web Applications", ICWE 2003, pp. 472-475, 2003.
5.
S. Hu, Helping Online Customers Decide through Web Personalization. IEEE, vol. 17, pp. 34-43, 2002.
6.
H. Kiyomitsu, A. Takeuchi and K. Tanaka, "Web Reconfiguration by Spatio-Temporal Page Personalization Rules Based on Access Histories", Proceedings of the Symposium on Applications and the Internet (SAINT 2001), pp. 75-82, 2001.
7.
D. VanderMeer, K. Dutta and A. Datta, "Enabling Scalable Online Personalization on the Web", Proceedings of EC00, pp. 185-196, 2000.
8.
D. Wu, I. Im, M. Tremaine, K. Instone and M. Turoff, "A Framework for Classifying Personalization Scheme Used on e-Commerce Websites", IEEE Proceedings of the 36th Hawaii International Conference on System Sciences (HICSS03), 2002.
9.
P. Yu, "Data Mining and Personalization Technologies", Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA99), 1999.
10.
B. Zhou, S.C. Hui and K. Chang, "An Intelligent Recommender System Using Sequential Web Access Patterns", IEEE Conference on Cybernetics and Intelligent Systems, pp. 393-398, 2004.
11.
F. Ergün, S. Mittra, S. Cenk Sahinalp, J. Sharp and R.K. Sinha, "A Dynamic Lookup Scheme for Bursty Access Patterns", INFOCOM, pp. 1444-1453, 2001.
12.
S. Lin and N. McKeown, "A simulation study of IP switching", Proc. ACM SIGCOMM, 1997.
13.
Chaker Jebari and Habib Ounelli, "Genre Categorization of Web Pages", Data Mining Workshops International Conference on, pp. 455-464, 2007.
14.
D.D. Sleator and R.E. Tarjan, "Self-adjusting binary search trees", Journal of the ACM, vol. 32, pp. 652-686, 1985.
15.
Eirinaki Magdalini and Vazirgiannis Michalis, "Web site personalization based on link analysis and navigational patterns", ACM Trans. Internet Techn., vol. 7, no. 4, 2007.
16.
Eirinaki Magdalini and Vazirgiannis Michalis, "Web mining for web personalization", ACM Trans. Internet Techn., vol. 3, no. 1, pp. 1-27, 2003.
17.
Picariello Antonio and Sansone Carlo, "A web usage mining algorithm for web personalization", Source Intelligent Decision Technologies archive, vol. 2, no. 4, pp. 219-230, October 2008.
18.
Baraglia Ranieri and Silvestri Fabrizio, "Dynamic personalization of web sites without user intervention", Commun. ACM, vol. 50, no. 2, pp. 63-67, 2007.
19.
G. Castellano, A.M. Fanelli and M. A. Torsello, "Computational Intelligence Techniques for Web personalization" in Web Intelligence and Agent Systems: an International Journal, Amsterdam, The Netherlands:IOS Press, vol. 6, no. 3, pp. 253-272, 2008.
20.
D.E. Knuth, "Sorting and Searching" in The Art of Computer Programming, Addison-Wesley, vol. 111, 1973.
21.
M.D. Atkinson, J.-R. Sack, N. Santoro and T. Strothotte, "Min-max heaps and generalized priority queues", Programming techniques and Data structures, vol. 29, no. 10, pp. 996-1000, October 1986.
22.
S. Lin and N. McKeown, "A simulation study of IP switching", Proc. ACM SIGCOMM 1997.
23.
B. Zhou, S.C. Hui and K. Chang, "An Intelligent Recommender System Using Sequential Web Access Patterns", IEEE, pp. 393-398, 2004.
24.
F. Ergün, S. Mittra, S. Cenk Sahinalp, J. Sharp and R.K. Sinha, "A Dynamic Lookup Scheme for Bursty Access Patterns", INFOCOM, pp. 1444-1453, 2001.
25.
Jiang Wei, Ding Chen and Cheng Roland, "Memory access analysis and optimization approaches on splay trees LCR 04", Proceedings of the 7th workshop on Workshop on languages compilers and run-time support for scalable systems.
26.
T. Srinivasan, M. Nivedita and V. Mahadevan, "Efficient Packet Classification using Splay Tree Models", IJCSNS, vol. 6, no. 5B, May 2005.
27.
Zhang Xin and Shasha Dennis, "Better Burst Detection", Proceedings of the 22nd International Conference on Data Engineering, pp. 146, April 03–07, 2006.
28.
Deane Jason and Pathak Praveen, "Ontological analysis of web surf history to maximize the click-through probability of web advertisements", Decision Support Systems, vol. 47, no. 4, pp. 364-373, November 2009.
29.
Jingjun Xu David, Shaoyi Liao Stephen and Li Qiudan, "Combining empirical experimentation and modeling techniques: A design research approach for personalized mobile advertising applications", Decision Support Systems, vol. 44, no. 3, pp. 710-724, February 2008.
30.
Li Nan and Dash Wu Desheng, "Using text mining and sentiment analysis for online forums hotspot detection and forecast", Decision Support Systems, vol. 48, no. 2, pp. 354-368, January 2010.
Contact IEEE to Subscribe

References

References is not available for this document.