FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS

Thomas Ambrosi; Sascha Kaufmann

Research.Publish.Connect.

*Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

*Please fill out at least one Field.

Name:
Country:
Subject:

Advanced Search Affiliations Search

If you're looking for an exact phrase use quotation marks on text fields.

Proceedings

Proceedings Search *Please fill out at least one Field. *Value must be an number!

Title:
ISBN:
Year:
Acronym:
Subject:

Advanced Search Proceedings Search

If you're looking for an exact phrase use quotation marks on text fields.

Papers

Papers Search *Please fill out at least one Field.

Title:
Author:
Affiliation:
Subject:

Advanced Search Papers Search

If you're looking for an exact phrase use quotation marks on text fields.

Authors

Authors Search *Please fill out at least one Field.

Name:
Affiliation:
Country:
Conference:
Subject:

Advanced Search Authors Search

If you're looking for an exact phrase use quotation marks on text fields.

Advanced Search

Paper

FINDING NON-OBVIOUS PROFILES BY USING ANT-ALGORITHMS

Topics: Learning User Profiles; User Modeling; Web Site Navigation Support Systems

In Proceedings of the Fifth International Conference on Web Information Systems and Technologies WEBIST - Volume 1, 674-679, 2009 , Lisbon, Portugal

Authors: Thomas Ambrosi ¹ and Sascha Kaufmann ²

Affiliations: ¹ Nortel GmbH, Germany ; ² University of Luxembourg, Luxembourg

Keyword(s): User interest profiles, Recommendations, Ant-algorithms.

Related Ontology Subjects/Areas/Topics: User Modeling ; Web Information Systems and Technologies ; Web Interfaces and Applications

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.

CC BY-NC-ND 4.0

Guest: Register as new SciTePress user now for free.

SciTePress user: please login.

My Papers

You are not signed in, therefore limits apply to your IP address 3.17.155.142

In the current month:

Recent papers: 100 available of 100 total

2⁺ years older papers: 200 available of 200 total

Paper citation in several formats:

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 - WEBIST; ISBN 978-989-8111-81-4; ISSN 2184-3252, SciTePress, pages 674-679. DOI: 10.5220/0001842806740679

@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 - WEBIST},
year={2009},
pages={674-679},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001842806740679},
isbn={978-989-8111-81-4},
issn={2184-3252},
}

TY - CONF

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