Figure 35 – uploaded by Ashwin Ram

See full PDF downloadDownload figure

Fig. 2. Example of a DBPedia resource with descriptions of the different vocabularies
used for the properties — Figure 2 Example of a DBPedia resource with descriptions of the different vocabularies used for the properties

Related Figures (74)

Welcoming you, from left to right, are Isabelle Bichindaritz, Cindy Marling,
and Stefania Montani. Photo by Peter Funk — Welcoming you, from left to right, are Isabelle Bichindaritz, Cindy Marling, and Stefania Montani. Photo by Peter Funk

Fig. 1. The proposed behavior modification architecture.

Fig. 2. The figure shows the FSM corresponding to the failure pattern VCRGLfail.
STRT, END represent the status of the behavior. PARAMInappr. represents the rou-
tine that checks whether the location where peasant is gathering resources is at a
location that is too close to the enemy compared to other resource gathering locations. — Fig. 2. The figure shows the FSM corresponding to the failure pattern VCRGLfail. STRT, END represent the status of the behavior. PARAMInappr. represents the rou- tine that checks whether the location where peasant is gathering resources is at a location that is too close to the enemy compared to other resource gathering locations.

Table 1. Some example failure patterns and their associated behavior modificatior
operators in WARGUS — Table 1. Some example failure patterns and their associated behavior modificatior operators in WARGUS

Fig. 3. The figure shows the average results from experiments turning the behavior
adaptation on and off — Fig. 3. The figure shows the average results from experiments turning the behavior adaptation on and off

Fig. 4. The figure shows the overall percentage improvement using the behavior adap-
tation approach — Fig. 4. The figure shows the overall percentage improvement using the behavior adap- tation approach

Fig. 1. A case in D2 consisting of a plan, goal and game state. The snippet contains two
actions and the game state representation is not fully included due to space limitations. — Fig. 1. A case in D2 consisting of a plan, goal and game state. The snippet contains two actions and the game state representation is not fully included due to space limitations.

Fig. 2. Our goal ontology for actions in StarCraft

Inputs: observations, conditionFeatures, decisionFeatures, maxPR
Outputs: coreFeatures

As for CBR performance, we do not expect statistically significant differences,
or important differences otherwise. The same hypothesis holds for the number
of selected features. — Inputs: observations, conditionFeatures, decisionFeatures, maxPR Outputs: coreFeatures As for CBR performance, we do not expect statistically significant differences, or important differences otherwise. The same hypothesis holds for the number of selected features.

Feature Selection Performance: Execution times are in minutes.

The next two tables show the averaged metrics for CBR performance and Feature
Selection performance, as well as the result of the ANOVA performed for the
effect of the feature selection algorithm on the collected metrics. — Feature Selection Performance: Execution times are in minutes. The next two tables show the averaged metrics for CBR performance and Feature Selection performance, as well as the result of the ANOVA performed for the effect of the feature selection algorithm on the collected metrics.

Figure 1. System Architecture and Overview

Qur micro-level decision CBR project implementation is an extension of the work
performed by Aamodt and Szczepanski's micro-level CBR system but is unique in
that it integrates Reinforcement Learning (RL) techniques and a fully automated case
generation framework meaning case adaptation and creation can occur online during a
live game with an opponent. RL is a form of machine learning that can be used in
games to allow agents to learn a policy/action to select during every state of the game.
Our use of spatial temporal reasoning is fundamentally different from Aha et al.’s im-
plementation (much like Sharma et al.) as our revision steps do not require pre-
computed state lattices [1]. Sharma et al.’s implementation is also largely different
from ours as they focus on the transference of generalized case learning between mul-
tiple layers of a hierarchical implementation which offers delayed online results [7].
The goal of RL in our system is to arrive at an optimal action for each state by max-
imizing the reward received through a process of both real-time and intermittent trial
and error exploration feedback [5]. Using CBR coupled with RL eliminates the need
for human feedback loop to learn effective strategies in the game. Additionally, our
project integrates concepts from the fully integrated agent manager framework of Ma-
teas and Weber [6]. However, our unit managers are implemented on a smaller scale
due to the requirements of small scale combat. Instead of utilizing a large network of
managers, our implementation only requires the use of a scout and group manager to
perform the basic micro-level tactical behaviors of individual units [6].
3 System Design — Qur micro-level decision CBR project implementation is an extension of the work performed by Aamodt and Szczepanski's micro-level CBR system but is unique in that it integrates Reinforcement Learning (RL) techniques and a fully automated case generation framework meaning case adaptation and creation can occur online during a live game with an opponent. RL is a form of machine learning that can be used in games to allow agents to learn a policy/action to select during every state of the game. Our use of spatial temporal reasoning is fundamentally different from Aha et al.’s im- plementation (much like Sharma et al.) as our revision steps do not require pre- computed state lattices [1]. Sharma et al.’s implementation is also largely different from ours as they focus on the transference of generalized case learning between mul- tiple layers of a hierarchical implementation which offers delayed online results [7]. The goal of RL in our system is to arrive at an optimal action for each state by max- imizing the reward received through a process of both real-time and intermittent trial and error exploration feedback [5]. Using CBR coupled with RL eliminates the need for human feedback loop to learn effective strategies in the game. Additionally, our project integrates concepts from the fully integrated agent manager framework of Ma- teas and Weber [6]. However, our unit managers are implemented on a smaller scale due to the requirements of small scale combat. Instead of utilizing a large network of managers, our implementation only requires the use of a scout and group manager to perform the basic micro-level tactical behaviors of individual units [6]. 3 System Design

Figure 3. Average Number of Cases Generated per Rush Test Set
and only attacking when the opponent comes in range. As the case generation thre-
shold increases (meaning cases become more generic) we can see that the win percen-
tage increases against all strategies with exception of the random strategy opponent
Our highest win percentage comes from the games against the AI opponent that uti-
lized the rush strategy, however, our implementation was only able to win 45% of the
games. The crucial piece of information to take away from this table is that as the case
generation thresholds increase our AI walked away with more wins (we will elaborate
on possible correlations in the following sections). After playing against the opposi-
tion for roughly 8-12 games our AI would learn that it was best to draw a game end-
ing in a stalemate rather than to keep assaulting the heavily defended positions of the
enemy. Additionally, as the case generation thresholds reach 3000 our AI becomes
aware of this fact much sooner than with lower thresholds. — Figure 3. Average Number of Cases Generated per Rush Test Set and only attacking when the opponent comes in range. As the case generation thre- shold increases (meaning cases become more generic) we can see that the win percen- tage increases against all strategies with exception of the random strategy opponent Our highest win percentage comes from the games against the AI opponent that uti- lized the rush strategy, however, our implementation was only able to win 45% of the games. The crucial piece of information to take away from this table is that as the case generation thresholds increase our AI walked away with more wins (we will elaborate on possible correlations in the following sections). After playing against the opposi- tion for roughly 8-12 games our AI would learn that it was best to draw a game end- ing in a stalemate rather than to keep assaulting the heavily defended positions of the enemy. Additionally, as the case generation thresholds reach 3000 our AI becomes aware of this fact much sooner than with lower thresholds.

In looking at the number of cases that were generated during each test run we can
see in table 2 the number of cases created decreases as the case generation threshold
increases. This is to be expected because as cases become more generic they are more
likely to be reused over a larger set of problem situation instances.
In figure 3 we can see the total number of cases generated and we observe this case
generation process over a period of time. Looking at the cases generated in the 1000
threshold we notice that cases never stop being generated nor do they show any sign — In looking at the number of cases that were generated during each test run we can see in table 2 the number of cases created decreases as the case generation threshold increases. This is to be expected because as cases become more generic they are more likely to be reused over a larger set of problem situation instances. In figure 3 we can see the total number of cases generated and we observe this case generation process over a period of time. Looking at the cases generated in the 1000 threshold we notice that cases never stop being generated nor do they show any sign

Figure 5. Average Efficiency vs. Learning Comparison in Rush test sets
eae aaa, > a aaa <> elena

If we now focus on the efficiency values for each case generation threshold in our
best performing test runs against the rush opponent strategy we find that in fig. 4 the
case 1000 generation threshold level produces an always decreasing efficiency trend
line which further makes it less viable for a challenging game opponent. Looking at
the 2000 threshold level we notice that the line is always increasing suggesting that
further tests should be performed on this threshold level to see the inevitable peak ef-
ficiency value. At the 3000 threshold it becomes clear that our AI was actually over
trained and that further learning should have been withheld somewhere around the
10th or 11th game as its efficiency peaked very quickly. — Figure 5. Average Efficiency vs. Learning Comparison in Rush test sets eae aaa, > a aaa <> elena If we now focus on the efficiency values for each case generation threshold in our best performing test runs against the rush opponent strategy we find that in fig. 4 the case 1000 generation threshold level produces an always decreasing efficiency trend line which further makes it less viable for a challenging game opponent. Looking at the 2000 threshold level we notice that the line is always increasing suggesting that further tests should be performed on this threshold level to see the inevitable peak ef- ficiency value. At the 3000 threshold it becomes clear that our AI was actually over trained and that further learning should have been withheld somewhere around the 10th or 11th game as its efficiency peaked very quickly.

Fig. 1: General Make Me Play Me architecture

Fig. 1. Passive observation of an expert interacting with the environment
Using such an approach, cases can be generated in an automated manner
through passive observation. Using a passive approach, the expert, as shown
in Figure 1, interacts with the environment and may not be aware it is being
observed. The observer is able to view, and record, both the state of the envi-
ronment and the actions performed by the expert so that they can later be used
to construct cases. — Fig. 1. Passive observation of an expert interacting with the environment Using such an approach, cases can be generated in an automated manner through passive observation. Using a passive approach, the expert, as shown in Figure 1, interacts with the environment and may not be aware it is being observed. The observer is able to view, and record, both the state of the envi- ronment and the actions performed by the expert so that they can later be used to construct cases.

Fig. 1. Trace-Based System: a general architecture. User produces traces stored in the
TBMS by interracting with an observed application. The trace-based application uses
traces to solve problems and may ask the TBMS to apply transformations. The solution
is proposed to the user and this process is also recorded on the trace. — Fig. 1. Trace-Based System: a general architecture. User produces traces stored in the TBMS by interracting with an observed application. The trace-based application uses traces to solve problems and may ask the TBMS to apply transformations. The solution is proposed to the user and this process is also recorded on the trace.

puter recording of these activities. From a computer science point of view, this
project aims at discovering knowledge from traces of activity. The ABSTRACT
application starts by observing the activity by various means (i.e. various kinds
of sensors) and collects a primary trace. The set of data collected is also at-
tached to a moment of the activity identified by a “time-code”. The trace can
then be manipulated and enriched with more abstract symbols through several
transformations. Figure 2 and figure 3 illustrate the way traces are manipulated
in ABSTRACT. Figure 2 shows three abstraction levels of the primary trace from
a generic point of view. Figure 3 illustrates the same principle, but applied to a
specific application domain: driver behavior analysis.
Fig. 3. Abstract: an example of the user interface. The primary trace has been trans-
formed to produce traces ” understandable” by users (e.g. analysts). — puter recording of these activities. From a computer science point of view, this project aims at discovering knowledge from traces of activity. The ABSTRACT application starts by observing the activity by various means (i.e. various kinds of sensors) and collects a primary trace. The set of data collected is also at- tached to a moment of the activity identified by a “time-code”. The trace can then be manipulated and enriched with more abstract symbols through several transformations. Figure 2 and figure 3 illustrate the way traces are manipulated in ABSTRACT. Figure 2 shows three abstraction levels of the primary trace from a generic point of view. Figure 3 illustrates the same principle, but applied to a specific application domain: driver behavior analysis. Fig. 3. Abstract: an example of the user interface. The primary trace has been trans- formed to produce traces ” understandable” by users (e.g. analysts).

Fig. 4. Copy/paste example. The trace of the mouse-based copy/paste (above) is com-
pared to the trace of the keyboard-based copy/paste (below). At the highest abstraction
level, both traces are identical. However they represent two different ways of performing
the same task. Note that in both cases, the bottom traces are not primary traces, they
are already transformed from other traces (for example ” Right Click + Copy Selection”
has been transformed in ” Mouse-Based Copy”).
level of abstraction is found, the second step consists of adapting the way of
performing the action (” Copy”) by taking into account the user preferences (e.g.
"only with the keyboard”). This example suggests an interesting observation:
while most users use the mouse to perform a Copy/Paste, blind users may pre-
fer less common solutions. Hence, provenance information may help a user to find
the best available episodes for him, or at least to give him relevant adaptation
knowledge (how to present “paste”: with mouse or with keyboard?). We think
this issue should open new paths especially in adaptive systems and assistive
technologies. — Fig. 4. Copy/paste example. The trace of the mouse-based copy/paste (above) is com- pared to the trace of the keyboard-based copy/paste (below). At the highest abstraction level, both traces are identical. However they represent two different ways of performing the same task. Note that in both cases, the bottom traces are not primary traces, they are already transformed from other traces (for example ” Right Click + Copy Selection” has been transformed in ” Mouse-Based Copy”). level of abstraction is found, the second step consists of adapting the way of performing the action (” Copy”) by taking into account the user preferences (e.g. "only with the keyboard”). This example suggests an interesting observation: while most users use the mouse to perform a Copy/Paste, blind users may pre- fer less common solutions. Hence, provenance information may help a user to find the best available episodes for him, or at least to give him relevant adaptation knowledge (how to present “paste”: with mouse or with keyboard?). We think this issue should open new paths especially in adaptive systems and assistive technologies.

Table 1. Condition and response
Let us assume that the system now gets equipped with a barometer, which
to some degree can be used to predict the weather. The new Bayesian network.
including the barometer is depicted in Fig. 2. Using this new device the network
is able to predict that cloudy weather in some situations will improve and become
sunny. Thus, the system will sometimes suggest the user to go to the beach even
when it is cloudy, for example when the barometer shows a trend towards higher — Table 1. Condition and response Let us assume that the system now gets equipped with a barometer, which to some degree can be used to predict the weather. The new Bayesian network. including the barometer is depicted in Fig. 2. Using this new device the network is able to predict that cloudy weather in some situations will improve and become sunny. Thus, the system will sometimes suggest the user to go to the beach even when it is cloudy, for example when the barometer shows a trend towards higher

Fig. 1. Bayesian network
To exemplify the need for provenance of changes in a Bayesian network we wil
use a very simple example. A simple Bayesian network, as depicted in Fig. 1, car
be used to tell a user whether to go to the beach or not. Real world application
would probably be much more complicated and even make recommendation
without being explicitly asked to do so. However, for pedagogical reasons we
will stick with simplicity. — Fig. 1. Bayesian network To exemplify the need for provenance of changes in a Bayesian network we wil use a very simple example. A simple Bayesian network, as depicted in Fig. 1, car be used to tell a user whether to go to the beach or not. Real world application would probably be much more complicated and even make recommendation without being explicitly asked to do so. However, for pedagogical reasons we will stick with simplicity.

Fig. 2. Modified Bayesian network
pressure. This new observed behaviour is shown in the column marked ’New
recommendation’ in Table 1. — Fig. 2. Modified Bayesian network pressure. This new observed behaviour is shown in the column marked ’New recommendation’ in Table 1.

Fig. 1. Example of provenance from the OPM specification, based on [18, p. 8
To illustrate OPM, Figure 1 shows an adaptation of a diagram of a prove-
nance sample included in the OPM specification.! It represents a portion of the
provenance trace for an image generated by a workflow used in the first prove-
nance challenge, a competition testing the capabilities of systems to record and
exploit provenance information [18]. Edges in this graph represent relationships
between provenance entities, which are represented by various shapes. Ovals in
this graph represent “artifacts,” specifically data, in this case. The rectangle rep-
resents a “process” which both consumes and produces data. Finally, the pointed
oval represents an “agent,” in this case a user who executed the workflow. Ad-
ditionally, the process has been annotated with an execution time. — Fig. 1. Example of provenance from the OPM specification, based on [18, p. 8 To illustrate OPM, Figure 1 shows an adaptation of a diagram of a prove- nance sample included in the OPM specification.! It represents a portion of the provenance trace for an image generated by a workflow used in the first prove- nance challenge, a competition testing the capabilities of systems to record and exploit provenance information [18]. Edges in this graph represent relationships between provenance entities, which are represented by various shapes. Ovals in this graph represent “artifacts,” specifically data, in this case. The rectangle rep- resents a “process” which both consumes and produces data. Finally, the pointed oval represents an “agent,” in this case a user who executed the workflow. Ad- ditionally, the process has been annotated with an execution time.

Fig. 2. Example of internal provenance in CBR

Fig. 3. Solving the same target problem (P) in Lazier CBR after feedback on case C3 has been
received. The shortest adaptation path from a confirmed case to the target problem is now C;
>C,> P.
Learning From Feedback. Fig. 3 illustrates the use of Lazier CBR to solve the same
target problem (P) as in our previous example but in a slightly different context. The
case base is the same as in Fig. 2 except that feedback on case C3 has been received
from a reliable source, with the result that its status has changed from unconfirmed to
confirmed. The shortest adaptation path from a confirmed case to the target problem,
and therefore the one that will be used to solve the problem in Lazier CBR, is now C3
— C, > P. Note that the solution provided by Lazier CBR in this example takes ac-
count of feedback on a case that would not be considered in a traditional CBR ap-
proach to solving the target problem. It is also worth noting that problem-solving
efficiency benefits from the feedback on case C3, not only in terms of search effort
but also in terms of adaptation effort. — Fig. 3. Solving the same target problem (P) in Lazier CBR after feedback on case C3 has been received. The shortest adaptation path from a confirmed case to the target problem is now C; >C,> P. Learning From Feedback. Fig. 3 illustrates the use of Lazier CBR to solve the same target problem (P) as in our previous example but in a slightly different context. The case base is the same as in Fig. 2 except that feedback on case C3 has been received from a reliable source, with the result that its status has changed from unconfirmed to confirmed. The shortest adaptation path from a confirmed case to the target problem, and therefore the one that will be used to solve the problem in Lazier CBR, is now C3 — C, > P. Note that the solution provided by Lazier CBR in this example takes ac- count of feedback on a case that would not be considered in a traditional CBR ap- proach to solving the target problem. It is also worth noting that problem-solving efficiency benefits from the feedback on case C3, not only in terms of search effort but also in terms of adaptation effort.

Fig. 2. Solving a target problem (P) in Lazier CBR before any feedback is received. The short-
est adaptation path from a confirmed case to the target problem is Cg > Cg > Cy > P. — Fig. 2. Solving a target problem (P) in Lazier CBR before any feedback is received. The short- est adaptation path from a confirmed case to the target problem is Cg > Cg > Cy > P.

Fig. 1. Knowledge Extraction Process Model for CBR Systems

Fig. 2. Screenshot of the Knowledge Extraction Workbench
One the left hand side the knowledge engineer can browse forum posts and se-
lect the analysis method. The right hand side displays the extracted taxonomies
and allows the knowledge engineer to load and save different taxonomies as well
as manipulate similarity measures. Further, the knowledge engineer can edit the
taxonomy and recalculate the similarity assignments for any node within the
taxonomy. A more detailed explanation of the workbench can be found in [18]. — Fig. 2. Screenshot of the Knowledge Extraction Workbench One the left hand side the knowledge engineer can browse forum posts and se- lect the analysis method. The right hand side displays the extracted taxonomies and allows the knowledge engineer to load and save different taxonomies as well as manipulate similarity measures. Further, the knowledge engineer can edit the taxonomy and recalculate the similarity assignments for any node within the taxonomy. A more detailed explanation of the workbench can be found in [18].

Fig. 1. A screenshot from Ghost Writer-2.0

Fig. 2. The number of suggestions that users directly incorporated into reviews

Fig. 3. Noun phrases in reviews written with GW-2.0

Fig. 4. “The system helped me to write a comprehensive review”

Fig. 5. “I found the suggestions helpful”

Fig. 6. “The number of times I was inspired by suggestions but I didn’t click on them”

Fig. 1. Overview of Linking Open Data sources as of July 2009 with source types shown

Fig. 3. The CBR vocabulary and a case base with experiential data for user profiling.
Properties from the CBR vocabulary are displayed with solid lines, all other properties
are displayed in dashed lines. — Fig. 3. The CBR vocabulary and a case base with experiential data for user profiling. Properties from the CBR vocabulary are displayed with solid lines, all other properties are displayed in dashed lines.

Fig. 1. WebAdapt’s adaptation process and knowledge sources, from [8].

Table 1. Query method, hierarchy nodes, and leaves for each source

Table 2. Performance improvements. All times measured in seconds.
Fig. 2. Average mining time per problem for all configurations — Table 2. Performance improvements. All times measured in seconds. Fig. 2. Average mining time per problem for all configurations

Fig. 3. Case base growth
Results for Question 2: Figure 3 shows the growth rates of the case base fot
each method. When adding cases with unique features, the case base growth
rate is nearly linear. Each knowledge source is capable of presenting dozens 01
hundreds of candidate substitutions for each adaptation, potentially leading tc
extremely large case bases. The growth of the second method is nearly linear fo1
the first fifty-five adaptations, after which it starts to level off as constraints are
re-encountered. The case base continues to grow slowly because some knowledge
sources, such as OpenCyc and Wikipedia, are described by constraints which
form a compact vocabulary. The constraint space method generated a total ot
397 cases compared to 625 for the candidate substitution method. Both methods
had the same coverage. — Fig. 3. Case base growth Results for Question 2: Figure 3 shows the growth rates of the case base fot each method. When adding cases with unique features, the case base growth rate is nearly linear. Each knowledge source is capable of presenting dozens 01 hundreds of candidate substitutions for each adaptation, potentially leading tc extremely large case bases. The growth of the second method is nearly linear fo1 the first fifty-five adaptations, after which it starts to level off as constraints are re-encountered. The case base continues to grow slowly because some knowledge sources, such as OpenCyc and Wikipedia, are described by constraints which form a compact vocabulary. The constraint space method generated a total ot 397 cases compared to 625 for the candidate substitution method. Both methods had the same coverage.

Fig. 1. Blocking and affordance assignment approach in WebCBR
The use of Case Based Reasoning (CBR) in web context has attracted researchers
for a while. For example, Limthan et al. [6] applied CBR in order to compose a
complex web service from heterogeneous web services residing in different parts of
the web, and [2] in order to search and select web services. Ha [4] investigated how
the web usage data can be used to discover navigation patterns which, in tum, can be
used to predict the user behavior. In this work, a web document has a corresponding
case representation capturing information that bridges queries to documents through
affordances. Query experiences are used to adjust the affordances of documents. This
provides search-useful and re-usable information for future web searches. The key
rationale of the proposed approach is based on two assumptions: (i) a web document
embraces a number of text blocks each of which can be connected to one or several
affordances, (ii) the web can be searched CBR-wise and relevance of a document can
be judged on the basis of its affordance alignment with the current query case. Figure. 1
illustrates the proposed approach in comparison with the web search. — Fig. 1. Blocking and affordance assignment approach in WebCBR The use of Case Based Reasoning (CBR) in web context has attracted researchers for a while. For example, Limthan et al. [6] applied CBR in order to compose a complex web service from heterogeneous web services residing in different parts of the web, and [2] in order to search and select web services. Ha [4] investigated how the web usage data can be used to discover navigation patterns which, in tum, can be used to predict the user behavior. In this work, a web document has a corresponding case representation capturing information that bridges queries to documents through affordances. Query experiences are used to adjust the affordances of documents. This provides search-useful and re-usable information for future web searches. The key rationale of the proposed approach is based on two assumptions: (i) a web document embraces a number of text blocks each of which can be connected to one or several affordances, (ii) the web can be searched CBR-wise and relevance of a document can be judged on the basis of its affordance alignment with the current query case. Figure. 1 illustrates the proposed approach in comparison with the web search.

Solution: The extracted text, say text;, of the block b; is processed to identify its
affordance with the help of the resource terms (topics and # terms considered in each
topic, are presented in the table 1). For each topic, the matching terms are identified,
the affordance with respect to this topic is computed and the affordance vector of the
block is updated (see ComputeBlockA ffordance in the Algorithm 2) accordingly. The
AV of the document, in turn, is computed by ComputeDocA ffordance, as described
in the ‘solution part’ of the Algorithm 1. A case is generated by coupling the problem
description and the solution parts and is added to the case base. — Solution: The extracted text, say text;, of the block b; is processed to identify its affordance with the help of the resource terms (topics and # terms considered in each topic, are presented in the table 1). For each topic, the matching terms are identified, the affordance with respect to this topic is computed and the affordance vector of the block is updated (see ComputeBlockA ffordance in the Algorithm 2) accordingly. The AV of the document, in turn, is computed by ComputeDocA ffordance, as described in the ‘solution part’ of the Algorithm 1. A case is generated by coupling the problem description and the solution parts and is added to the case base.

unwanted, restricted contents, adult contents, etc), were selected for our experiments.
We have manually crafted the list of 18 affordances related to tourism domain including
the affordance miscellaneous. — unwanted, restricted contents, adult contents, etc), were selected for our experiments. We have manually crafted the list of 18 affordances related to tourism domain including the affordance miscellaneous.

Fig. 2. Effect of rank aggregation of lucene retrieval vs the proposed approach
During the estimation of case affordance vectors, the values of the elements in the
vector increase with the number of matching terms between the solution part and the
new case. In such situations, we could apply affordance vector length normalization. To
length normalize the elements of the affordance vector AV., for the case c having m
affordances: {A;,,A;,,--- ,Az,, }, to the unit vector, we do the following: AV. :=
AV./|AV.| where denominator denotes the Euclidean length of the vector of the
affordance ¢; in c. In the mean time, we will take care of the effect of normalization
factor in decreasing the chances of retrieval of the document. — Fig. 2. Effect of rank aggregation of lucene retrieval vs the proposed approach During the estimation of case affordance vectors, the values of the elements in the vector increase with the number of matching terms between the solution part and the new case. In such situations, we could apply affordance vector length normalization. To length normalize the elements of the affordance vector AV., for the case c having m affordances: {A;,,A;,,--- ,Az,, }, to the unit vector, we do the following: AV. := AV./|AV.| where denominator denotes the Euclidean length of the vector of the affordance ¢; in c. In the mean time, we will take care of the effect of normalization factor in decreasing the chances of retrieval of the document.

Fig. 3. Effect of the proposed approach on a few selected queries

Figure 1 gives a high level architecture of the Conversational Interaction framework.
The framework is built around constructs to support memory update and access, cat-
egorization and learning in the system. The framework allows for the ability to start
conversations, get connected to people and get relevant information for the information
need in context.
While developing the Conversational Interaction framework, we are adhering to
some requirements and guidelines which are as follows: — Figure 1 gives a high level architecture of the Conversational Interaction framework. The framework is built around constructs to support memory update and access, cat- egorization and learning in the system. The framework allows for the ability to start conversations, get connected to people and get relevant information for the information need in context. While developing the Conversational Interaction framework, we are adhering to some requirements and guidelines which are as follows:

Text Analysis and Processing Engine(TAPE) processes conversations, pushing i
hrough the various steps of analysis, processing and storage within the system. The
Surrent system is being designed and developed for health domain and engages in it the
ise of medical ontologies coupled with natural language processing components. TAPE
Figure 2) produces and maintains the knowledge representation by processing infor
mation from agent’s working memory of conversation, user models and knowledge
pases. The agent’s task is to use the sub-modules for extracting meaningful querie:
from conversations, classifying messages into relevant categories, and calling the righ
combination of algorithms for retrieving candidate recommendations. — Text Analysis and Processing Engine(TAPE) processes conversations, pushing i hrough the various steps of analysis, processing and storage within the system. The Surrent system is being designed and developed for health domain and engages in it the ise of medical ontologies coupled with natural language processing components. TAPE Figure 2) produces and maintains the knowledge representation by processing infor mation from agent’s working memory of conversation, user models and knowledge pases. The agent’s task is to use the sub-modules for extracting meaningful querie: from conversations, classifying messages into relevant categories, and calling the righ combination of algorithms for retrieving candidate recommendations.

The purpose of Episodic Memory is to capture the user’s short-term interactions and interests. Based on user’s frequency of interactions and diversity in topics, this memory empirically varies in the range of a few days for different users. The Semantic Memory captures the user’s long-term profile. These are the topics that interest the user in general and for a prolonged time. These interests change less frequently and represent general criteria of recommendation to the user. Many times, users might be interested in some temporary information need. Such information need not be incorporated in the long term user memory. The episodic memory captures such short-term interests. The episodic memory forms a sort of staging area and the concepts from this memory are selectively and periodically moved to the semantic memory in a crossover process. interchangeably use the terms Cobot and the Conversational Interaction framework) leverages these interactions to maintain users’ episodic and long term semantic models, agent’s per conversation working memory of topics, users and messages (Figure 3). The agent analyzes these memory structures to bring in external recommendations into the system by matching with the contextual information need(Categorization). The social feedback on the recommendations are registered in the indices for the algorithms to generate their contextual relevance. Paper [13] also describes the architecture of Cobot System in more detail.

Figure 35 – uploaded by Ashwin Ram

Related Figures (74)

Connect with 287M+ leading minds in your field