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

Authors:
D. Antoniou;J. Garofalakis;C. Makris;Y. Panagis;E. Sakkopoulos
Affiliations:
University of Patras, Computer Engineering and Informatics Dept., 26504 Patras, Greece;University of Patras, Computer Engineering and Informatics Dept., 26504 Patras, Greece;University of Patras, Computer Engineering and Informatics Dept., 26504 Patras, Greece;University of Patras, Computer Engineering and Informatics Dept., 26504 Patras, Greece;University of Patras, Computer Engineering and Informatics Dept., 26504 Patras, Greece
Venue:
Data & Knowledge Engineering
Year:
2010

Citing 19
Cited 1

A data structure for dynamic trees

Journal of Computer and System Sciences
Towards adaptive Web sites: conceptual framework and case study

WWW '99 Proceedings of the eighth international conference on World Wide Web
Information agent technology for the Internet: a survey

Data & Knowledge Engineering - Special issue on heterogeneous information resources need semantic access
Modern Information Retrieval

Modern Information Retrieval
Introduction to Algorithms

Introduction to Algorithms
On Automated Lesson Construction from Electronic Textbooks

IEEE Transactions on Knowledge and Data Engineering
Deterministic sorting in O(nlog logn) time and linear space

Journal of Algorithms
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
A web-based kernel function for measuring the similarity of short text snippets

Proceedings of the 15th international conference on World Wide Web
Category ranking for personalized search

Data & Knowledge Engineering
Faster algorithms for finding lowest common ancestors in directed acyclic graphs

Theoretical Computer Science
Near-entropy hotlink assignments

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximation algorithm for hotlink assignment in the greedy model

Theoretical Computer Science
Designing evolving user profile in e-CRM with dynamic clustering of Web documents

Data & Knowledge Engineering
An integrated web system to facilitate personalized web searching algorithms

Proceedings of the 2008 ACM symposium on Applied computing
Approximate Hotlink Assignment

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Dynamic hotlinks

WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient algorithms for the hotlink assignment problem: the worst case search

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Constant factor approximations for the hotlink assignment problem

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

Recommendation-based editor for business process modeling

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Enhancing web browsing experience is an open issue frequently dealt using hotlinks assignment between webpages, shortcuts from one node to another. Our aim is to provide a novel, more efficient approach to minimize the expected number of steps needed to reach expected pages when browsing a website. We present a randomized algorithm, which combines the popularity of the webpages, the website structure, and for the first time to the best authors' knowledge, the similarity of context between pages in order to suggest the placement of suitable hotlinks. We verify experimentally that users need less page transitions to reach expected information pages when browsing a website, enhanced using the proposed algorithm.