samap: An user-oriented adaptive system for planning tourist visits
Expert Systems with ApplicationsPublished 23 December 2006
Luis Castillo, Eva Sanchez Armengol, Eva Onaindía, Laura Sebastiá, J GONZALEZBOTICARIO, A RODRIGUEZ
Citations124
SJR quartileQ1
SJR score1.85
SNIP2.55
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This tool integrates modules that dynamically capture user models, determine lists of activities that can provide more utility to a user given the past experience of the system with similar users, and generates plans that can be executed by the user.
Abstract
In this paper, we present samap, whose goal is to build a software tool to help different people visit different cities. This tool integrates modules that dynamically capture user models, determine lists of activities that can provide more utility to a user given the past experience of the system with similar users, and generates plans that can be executed by the user. This system is intended to work in portable devices (mobile phones, PDAs, etc.,) with internet connection. In this paper, we describe the architecture, the knowledge model that is shared among components using an ontology, and the three components of the tool: user module, case-based module and planning module. © 2007 Elsevier Ltd. All rights reserved.
Keywords
Computer Science
Journal of the Royal Statistical Society Series B (Statistical Methodology)Maximum Likelihood from Incomplete Data Via the <i>EM</i> Algorithm
49,657 Citations1977A. P. Dempster, N. M. Laird +1 more
C4.5: Programs for Machine Learning
23,665 Citations1992J. R. Quinlan
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Usability Engineering
9,352 Citations1993Jakob Nielsen
Programs for Machine Learning
5,794 Citations1994Steven L. Salzberg, Alberto M. Segre
In his new book, C4.5: Programs for Machine Learning, Quinlan has put together a definitive, much needed description of his complete system, including the latest developments, which will be a welcome addition to the library of many researchers and students.
Journal of Artificial Intelligence ResearchThe FF Planning System: Fast Plan Generation Through Heuristic Search
1,852 Citations2001J. Hoffmann, Bernhard Nebel
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space.
Journal of Artificial Intelligence ResearchPDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
1,734 Citations2003Maria Fox, Derek Long
The syntax of the language, PDDL2.1, is described, which has considerable modelling power -- exceeding the capabilities of current planning technology -- and presents a number of important challenges to the research community.
Journal of Artificial Intelligence ResearchSHOP2: An HTN Planning System
937 Citations2003Dana Nau, Tsz-Chiu Au +5 more
The features of SHOP2 which enabled it to excel in the competition are described, especially those aspects of SHop2 that deal with temporal and metric planning domains.
Max Planck Digital LibraryThe Metric‐FF Planning System: Translating "Ignoring Delete Lists" To Numeric State Variables
416 Citations2003Hoffmann, J.
NASA Technical Reports Server (NASA)Choosing objectives in over-subscription planning
179 Citations2004David E. Smith
These techniques use plan graph cost-estimation techniques to construct an orienteering problem, which is used to provide heuristic advice on the goals and goal order that should be considered by a planner.
Artificial Intelligence ReviewExplanation in Recommender Systems
177 Citations2005David McSherry
It is shown how the relevance of any question the user is asked can be explained in terms of its ability to discriminate between competing cases, thus giving users a unique insight into the recommendation process.
Relational instance-based learning
174 Citations1996Werner Emde, Dietrich Wettschereck
International Journal of Cooperative Information SystemsTHE ARIADNE APPROACH TO WEB-BASED INFORMATION INTEGRATION
164 Citations2001Craig A. Knoblock, Steven Minton +5 more
This work has developed methods for mapping web sources into a uniform representation that makes it simple and efficient to integrate multiple sources and makes it easy to maintain these agents and incorporate new sources as they become available.
Planning with resources and concurrency a forward chaining approach
89 Citations2001Fahiem Bacchus, Michael Ady
It is shown how the forward chaining approach to planning can be extended to allow it to solve planning problems with concurrently executable actions with varying durations, and metric quantities like resources, both essential for modeling real applications.
Symbolic pattern databases in heuristic search planning
82 Citations2002Stefan Edelkamp
This paper invents symbolic pattern databases (SPDB) to combine two influencing aspects for recent progress in domain-independent action planning, namely heuristic search and model checking and symbolic representation yields much larger and more accurate pattern databases than the ones generated with explicit methods.
DIETORECS: Travel Advisory for Multiple Decision Styles
80 Citations2003Daniel R. Fesenmaier, Francesco Ricci⋆ +3 more
Dietorecs supports decision styles by means of an adaptive behavior which is learned exploiting a case base of recommendation sessions that are stored by the systems.
Efficiently handling temporal knowledge in an HTN planner
79 Citations2006Luis Castillo, Juan Fernández-Olivares +2 more
New features include a sound partial order metric structure, deadlines, temporal landmarking or synchronization capabilities built on top of a Simple Temporal Network and an efficient constraint propagation engine boosted by exploiting the causal structure of plans.
Machine LearningRelational Instance-Based Learning with Lists and Terms
76 Citations2001Tamás Horváth, Stefan Wrobel +1 more
An improved similarity measure is presented for the first-order instance-based learner ribl that employs the concept of edit distances to efficiently compute distances between lists and terms.
Expert Systems with ApplicationsIntegrating planning and scheduling in workflow domains
72 Citations2006María D. R‐Moreno, Daniel Borrajo +2 more
This work proposes the use of one of such BPR languages to enter knowledge on the organisation processes to be used by planning tools, and presents results in a real workflow domain, the telephone installation (TI) domain.
Lecture notes in computer scienceCooperative Case-based Reasoning
60 Citations1997Enric Plaza, Josep Lluís Arcos +1 more
The extension of Noos, the knowledge modeling framework designed to integrate learning methods and based on the task/method decomposition principle, is presented and allows communication and cooperation among agents implemented in Noos by means of three basic constructs: alien references, foreign method evaluation, and mobile methods.
National Conference on Artificial IntelligenceGetting from here to there: interactive planning and agent execution for optimizing travel
59 Citations2002José Luis Ambite, Greg Barish +4 more
The technologies underlying Heracles and Theseus are presented and how they are applied to build a state-of-the-art travel system are presented.
Machine LearningBottom-Up Induction of Feature Terms
47 Citations2000Eva Armengol, Enric Plaza
The representation formalism based on feature terms and the corresponding notions of subsumption and anti-unification are introduced and the results of INDIE are shown, showing that it's able to find hypotheses at a level comparable to the original ones.
Strathprints: The University of Strathclyde institutional repository (University of Strathclyde)Hybrid STAN: Identifying and managing combinatorial optimisation sub-problems in planning
40 Citations2001Maria Fox, Derek Long
A hybrid planning system (STAN4) is developed which brings together alternative planning strategies and specialised algorithms and selects them according to the structure of the planning domain.
LCW-Based Agent Planning for the Semantic Web
36 Citations2002Jeff Heflin, Héctor Muñoz‐Avila
This paper demonstrates how two Semantic Web languages (DAML+OIL and SHOE) can be augmented with the ability to state LCW information and demonstrates how ordered task decomposition can be used withLCW information to efficiently plan in distributed information environments.
Artificial Intelligence ReviewRelational Case-based Reasoning for Carcinogenic Activity Prediction
28 Citations2003Eva Armengol, Enric Plaza
This paper presents Shaud, a similarity measure useful to estimate the similarity among relational cases represented using featureterms, and presents results of the application of Shaud forsolving classification tasks.
e-Archivo (Carlos III University of Madrid)A multi-agent architecture for intelligent gathering systems
24 Citations2005David Camacho, Ricardo Aler +2 more
The proposed architecture allows to integrate the different agents tasks with AI techniques like planning to build a MAS which is able to gather and integrate information retrieved from the WEB to solve problems.
Interacting with ComputersDesigning interactive interfaces: theoretical consideration of the complexity of standards and guidelines, and the difference between evolving and formalised systems
9 Citations2003Irma Alm
There are two reasons why it is impossible to predict future states of a complex system, and hence to design communicative interfaces in an intelligible way: the relationship between consciousness and the five omnipresent mental factors and the essential difference between evolving and formalised communication systems.
Maximizing availability: a commitment heuristic for oversubscribed scheduling problems
8 Citations2005Laurence A. Kramer, Stephen F. Smith
It is found that by applying a value selection heuristic, max-availability, to the choice of where to assign the retracted tasks, both solution quality and runtime performance of task swap can be improved greatly.
Using Symbolic Similarity to Explain Case-based Reasoning in Classification Tasks.
1 Citations2005Eva Armengol, Enric Plaza
This work uses the notion of anti-unification (least general generalization) to build symbolic similarity descriptions for CBR in classification tasks that focuses on explaining what is shared between the current problem and the retrieved cases that belong to different classes.