H.3. Artificial Intelligence
Amirhossein Khabbaz; Mansoor Fateh; Ali Pouyan; Mohsen Rezvani
Abstract
Autism spectrum disorder (ASD) is a collection of inconstant characteristics. Anomalies in reciprocal social communications and disabilities in perceiving communication patterns characterize These features. Also, exclusive repeated interests and actions identify ASD. Computer games have affirmative effects ...
Read More
Autism spectrum disorder (ASD) is a collection of inconstant characteristics. Anomalies in reciprocal social communications and disabilities in perceiving communication patterns characterize These features. Also, exclusive repeated interests and actions identify ASD. Computer games have affirmative effects on autistic children. Serious games have been widely used to elevate the ability to communicate with other individuals in these children. In this paper, we propose an adaptive serious game to rate the social skills of autistic children. The proposed serious game employs a reinforcement learning mechanism to learn such ratings adaptively for the players. It uses fuzzy logic to estimate the communication skills of autistic children. The game adapts itself to the level of the child with autism. For that matter, it uses an intelligent agent to tune the challenges through playtime. To dynamically evaluate the communication skills of these children, the game challenges may grow harder based on the development of a child's skills through playtime. We also employ fuzzy logic to estimate the playing abilities of the player periodically. Fifteen autistic children participated in experiments to evaluate the presented serious game. The experimental results show that the proposed method is effective in the communication skill of autistic children.
H. Khodadadi; V. Derhami
Abstract
A prominent weakness of dynamic programming methods is that they perform operations throughout the entire set of states in a Markov decision process in every updating phase. This paper proposes a novel chaos-based method to solve the problem. For this purpose, a chaotic system is first initialized, and ...
Read More
A prominent weakness of dynamic programming methods is that they perform operations throughout the entire set of states in a Markov decision process in every updating phase. This paper proposes a novel chaos-based method to solve the problem. For this purpose, a chaotic system is first initialized, and the resultant numbers are mapped onto the environment states through initial processing. In each traverse of the policy iteration method, policy evaluation is performed only once, and only a few states are updated. These states are proposed by the chaos system. In this method, the policy evaluation and improvement cycle lasts until an optimal policy is formulated in the environment. The same procedure is performed in the value iteration method, and only the values of a few states proposed by the chaos are updated in each traverse, whereas the values of other states are left unchanged. Unlike the conventional methods, an optimal solution can be obtained in the proposed method by only updating a limited number of states which are properly distributed all over the environment by chaos. The test results indicate the improved speed and efficiency of chaotic dynamic programming methods in obtaining the optimal solution in different grid environments.
A. Omondi; I. Lukandu; G. Wanyembi
Abstract
Variable environmental conditions and runtime phenomena require developers of complex business information systems to expose configuration parameters to system administrators. This allows system administrators to intervene by tuning the bottleneck configuration parameters in response to current changes ...
Read More
Variable environmental conditions and runtime phenomena require developers of complex business information systems to expose configuration parameters to system administrators. This allows system administrators to intervene by tuning the bottleneck configuration parameters in response to current changes or in anticipation of future changes in order to maintain the system’s performance at an optimum level. However, these manual performance tuning interventions are prone to error and lack of standards due to fatigue, varying levels of expertise and over-reliance on inaccurate predictions of future states of a business information system. As a result, the purpose of this research is to investigate on how the capacity of probabilistic reasoning to handle uncertainty can be combined with the capacity of Markov chains to map stochastic environmental phenomena to ideal self-optimization actions. This was done using a comparative experimental research design that involved quantitative data collection through simulations of different algorithm variants. This provided compelling results that indicate that applying the algorithm in a distributed database system improves performance of tuning decisions under uncertainty. The improvement was quantitatively measured by a response-time latency that was 27% lower than average and a transaction throughput that was 17% higher than average.
A. Omondi; I.A. Lukandu; G.W. Wanyembi
Abstract
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search ...
Read More
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of relevant features and the exploration of features that have the potential to be relevant. In doing so, the study evaluated how effective the manipulation of the search component in feature selection is on achieving high accuracy with reduced dimensions. A control group experimental design was used to observe factual evidence. The context of the experiment was the high dimensional data experienced in performance tuning of complex database systems. The Wilcoxon signed-rank test at .05 level of significance was used to compare repeated classification accuracy measurements on the independent experiment and control group samples. Encouraging results with a p-value < 0.05 were recorded and provided evidence to reject the null hypothesis in favour of the alternative hypothesis which states that meta-heuristic search approaches are effective in achieving high accuracy with reduced dimensions depending on the outcome variable under investigation.
G.4. Information Storage and Retrieval
V. Derhami; J. Paksima; H. Khajeh
Abstract
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking ...
Read More
Principal aim of a search engine is to provide the sorted results according to user’s requirements. To achieve this aim, it employs ranking methods to rank the web documents based on their significance and relevance to user query. The novelty of this paper is to provide user feedback-based ranking algorithm using reinforcement learning. The proposed algorithm is called RRLUFF, in which the ranking system is considered as the agent of the learning system and the selection of documents is displayed to the user as the agent's action. Reinforcement signal in this system is calculated based on user's click on the documents. Action-values in the RRLUFF algorithm are calculated for each feature of the document-query pair. In RRLUFF method, each feature is scored based on the number of the documents related to the query and their position in the ranked list of that feature. For learning, documents are sorted according to modified scores for the next query. Then, according to the position of a document in the ranking list, some documents are selected based on the random distribution of their scores to display to the user. OHSUMED and DOTIR benchmark datasets are used to evaluate the proposed method. The evaluation results indicate that the proposed method is more effective than the related methods in terms of P@n, NDCG@n, MAP, and NWN.
H.3.2.6. Games and infotainment
A.H. Khabbaz; A. Pouyan; M. Fateh; V. Abolghasemi
Abstract
This paper, presents an adapted serious game for rating social ability in children with autism spectrum disorder (ASD). The required measurements are obtained by challenges of the proposed serious game. The proposed serious game uses reinforcement learning concepts for being adaptive. It is based on ...
Read More
This paper, presents an adapted serious game for rating social ability in children with autism spectrum disorder (ASD). The required measurements are obtained by challenges of the proposed serious game. The proposed serious game uses reinforcement learning concepts for being adaptive. It is based on fuzzy logic to evaluate the social ability level of the children with ASD. The game adapts itself to the level of the autistic patient by reducing or increasing the challenges in the game via an intelligent agent during the play time. This task is accomplished by making more elements and reshaping them to a variety of real world shapes and redesigning their motions and speed. If autistic patient's communication level grows during the playtime, the challenges of game may become harder to make a dynamic procedure for evaluation. At each step or state, using fuzzy logic, the level of the player is estimated based on some attributes such as average of the distances between the fixed points gazed by the player, or number of the correct answers selected by the player divided by the number of the questioned objects. This paper offers the usage of dynamic AI difficulty system proposing a concept to enhance the conversation skills in autistic children. The proposed game is tested by participating of 3 autistic children. Each of them played the game in 5 turns. The results displays that the method is useful in the long-term.
G.4. Information Storage and Retrieval
V. Derhami; J. Paksima; H. Khajah
Abstract
The main challenge of a search engine is ranking web documents to provide the best response to a user`s query. Despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ...
Read More
The main challenge of a search engine is ranking web documents to provide the best response to a user`s query. Despite the huge number of the extracted results for user`s query, only a small number of the first results are examined by users; therefore, the insertion of the related results in the first ranks is of great importance. In this paper, a ranking algorithm based on the reinforcement learning and user`s feedback called RL3F are considered. In the proposed algorithm, the ranking system has been considered to be the agent of learning system and selecting documents to display to the user is as the agents’ action. The reinforcement signal in the system is calculated according to a user`s clicks on documents. Action-value values of the proposed algorithm are computed for each feature. In each learning cycle, the documents are sorted out for the next query, and according to the document in the ranked list, documents are selected at random to show the user. Learning process continues until the training is completed. LETOR3 benchmark is used to evaluate the proposed method. Evaluation results indicated that the proposed method is more effective than other methods mentioned for comparison in this paper. The superiority of the proposed algorithm is using several features of document and user`s feedback simultaneously.
