Context-similarity based hotlinks assignment: Model, metrics and algorithm

Data and Knowledge Engineering

Volumn 69, Issue 4, 2010, Pages 357-370

  Antoniou, D ^a   Garofalakis, J ^a   Makris, C ^a   Panagis, Y ^a   Sakkopoulos, E ^a  

^a UNIVERSITY OF PATRAS   (Greece)

Author keywords

Customization and user profiles; Hotlink assignment; Inf. services on the web; Information Retrieval

Indexed keywords

CUSTOMIZATION AND USER PROFILES; HOTLINKS; INF. SERVICES ON THE WEB; RANDOMIZED ALGORITHMS; WEB BROWSING; WEB PAGE;

ALGORITHMS; INFORMATION RETRIEVAL; INFORMATION SERVICES;

WEBSITES;

EID: 76349120817     PISSN: 0169023X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.datak.2009.04.007     Document Type: Article

References (28)

1. Adomavicius G., and Tuzhilin A. Toward the next generation of recommender systems: a survey of the state-of-the-art and possible extensions. IEEE Transactions on Knowledge and Data Engineering 17 6 (2005) 734-749
2. Baeza-Yates R., and Ribeiro-Neto B. Modern Information Retrieval (1999), ACM Press, Addison-Wesley Longman, New York, Harlow (England)
3. P. Bose, E. Kranakis, D. Krizanc, M.V. Martin, J. Czyzowicz, A. Pelc, L. Gasieniec, Strategies for hotlink assignments, in: Proceedings of the 11th Annual International Symposium on Algorithms and Computation, LNCS, vol. 1969, 2000, pp. 23-34.
4. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms. second ed. (2001), MIT Press and McGraw-Hill. 0-262-03293-7 Section 24.1: The Bellman-Ford algorithm, pp. 588-592. Problem 24-1, pp. 614-615
5. Czumaj A., Kowaluk M., and Lingas A. Faster algorithms for finding lowest common ancestors in directed acyclic graphs. Theoretical Computer Science 380 1-2 (2007) 37-46
6. J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, M. Vargas Martin, Evaluation of hotlink assignment heuristics for improving web access, in: Proceedings of the Second International Conference on Internet Computing (IC'2001), June 25th-28th, 2001, Las Vegas, NV, USA, pp. 793-799.
7. K. Doui{dotless}̈eb, S. Langerman, Dynamic hotlinks, in: Proceedings of the Workshop on Algorithms and Data Structures (WADS 2005), LNCS, vol. 3608, 2005, pp. 271-280.
8. K. Doui{dotless}̈eb, S. Langerman, Near-entropy hotlink assignments, in: Proceedings of European Symposium on Algorithms (ESA06), LNCS, vol. 4618, 2006, pp. 292-303.
9. Gerstel O.O., Kutten S., Matichin R., and Peleg D. Hotlink enhancement algorithms for web directories: (extended abstract). In: Ibaraki T., Katoh N., and Ono H. (Eds). ISAAC. Lecture Notes in Computer Science vol. 2906 (2003), Springer 68-77
10. Han Y. Deterministic sorting in O(nloglogn) time and linear space. Journal of Algorithms 50 1 (2004) 96-105
11. T. Jacobs, An experimental study of recent hotlink assignment algorithms, in: Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments (ALENEX), 2008, pp. 142-151.
12. T. Jacobs, Constant factor approximations for the hotlink assignment problem, in: Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007), Halifax, Canada, 2007, pp. 188-200.
13. Klusch M. Information agent technology for the Internet: a survey. Data and Knowledge Engineering 36 3 (2001) 337-372
14. E. Kranakis, D. Krizanc, S. Shende, Approximate hotlink assignment, in: Proceedings of the 12th Annual International Symposium on Algorithms and Computation, LNCS, vol. 2223, 2001, pp. 756-767.
15. Levene M., and Loizou G. Computing the entropy of user navigation in the web. International Journal of Information Technology and Decision Making 2 3 (2003) 459-476
16. Mahdavi I., Cho N., Shirazi B., and Sahebjamnia N. Designing evolving user profile in e-CRM with dynamic clustering of Web documents'. Data and Knowledge Engineering 65 2 (2008) 355-372
17. Ch. Makris, Y. Panagis, Y. Plegas, E. Sakkopoulos, An integrated web system to facilitate personalized web searching algorithms, in: Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), Fortaleza, Ceara, Brazil, March 16-20, 2008, pp. 2397-2402.
18. Makris C., Panagis Y., Sakkopoulos E., and Tsakalidis A. Category ranking for personalized search. Data and Knowledge Engineering 60 1 (2007) 109-125
19. Matichin R., and Peleg D. Approximation algorithm for hotlink assignment in the greedy model. Theoretical Computer Science 383 1 (2007) 102-110
20. Ozsoyoglu G., Balkir N., Ozsoyoglu Z., and Cormode G. On automated lesson construction from electronic textbooks. IEEE Transactions on Knowledge and Data Engineering 16 3 (2004) 317-331
21. Perkowitz M., and Etzioni O. Towards adaptive web sites: conceptual framework and case study. Computer Networks 31 1116 (1999) 1245-1258
22. Pessoa A.A., Laber E.S., and de Souza C. Efficient algorithms for the hotlink assignment problem: the worst case search. In: Fleischer R., and Trippen G. (Eds). ISAAC. Lecture Notes in Computer Science vol. 3341 (2004), Springer 778-792
23. Pessoa A.A., Laber E.S., and de Souza C. Efficient implementation of hotlink assignment algorithm for web sites. In: Arge L., Italiano G.F., and Sedgewick R. (Eds). ALENEX/ANALC (2004), SIAM 79-87
24. M. Sahami, T.D. Heilman, A web-based kernel function for measuring the similarity of short text snippets, in: WWW'06: Proceedings of the 15th International Conference on World Wide Web, May 2006, pp. 377-386.
25. Sleator D.D., and Tarjan R.E. A data structure for dynamic trees. Journal of Computer and System Sciences 26 3 (1985) 362-381
26. LEDA is a C++ class library for efficient data types and algorithms. LEDA provides algorithmic in-depth knowledge in the field of graph- and network problems, geometric computations, combinatorial optimization and other. LEDA is implemented following the object-oriented approach. .
27. SEO Tools: Similar Page Checker. .
28. .