FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS

Thomas Ambrosi, Sascha Kaufmann

2009

Abstract

Visitors on a website are usually on their own when they are moving around. First time visitors are especially guessing where to find the information they are looking for. In this paper we will show a way to combine the concepts of non-obvious profiles and ant-algorithms to come up with a set of paths, which tries to cover the user’s interests in a proper way. These paths can be used to give recommendations to visitors. While the profiles help to get a better understanding of the users’ interests, the concept of ant-algorithms is employed to determine recently and frequently used paths to lead the user to the desired information. We explain the basic idea of our approach, the current state of the prototype realized and some first results.

Paper Citation

in Harvard Style

Ambrosi T. and Kaufmann S. (2009). FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS . In Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST, ISBN 978-989-8111-81-4, pages 674-679. DOI: 10.5220/0001842806740679

in Bibtex Style

@conference{webist09,
author={Thomas Ambrosi and Sascha Kaufmann},
title={FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS},
booktitle={Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,},
year={2009},
pages={674-679},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001842806740679},
isbn={978-989-8111-81-4},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Fifth International Conference on Web Information Systems and Technologies - Volume 1: WEBIST,
TI - FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS
SN - 978-989-8111-81-4
AU - Ambrosi T.
AU - Kaufmann S.
PY - 2009
SP - 674
EP - 679
DO - 10.5220/0001842806740679