V. Rus, Philip M. McCarthy, D. McNamara, A. Graesser
{"title":"A study on textual entailment","authors":"V. Rus, Philip M. McCarthy, D. McNamara, A. Graesser","doi":"10.1142/S0218213008004096","DOIUrl":"https://doi.org/10.1142/S0218213008004096","url":null,"abstract":"In this paper we study a graph-based approach to the task of textual entailment between a text and hypothesis. The approach takes into account the full lexico-syntactic context of both the text and hypothesis and relies heavily on the concept of subsumption. It starts with mapping the text and hypothesis into graph structures where nodes represent concepts and edges represent lexico-syntactic relations among concepts. Based on a subsumption score between the text-graph and hypothesis-graph an entailment decision is then made. The impact of synonymy on entailment is quantified and discussed. An important advantage of our solution is the ability to customize it so that high-confidence results are obtained","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115252686","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Robust temporal constraint network","authors":"H. Lau, Thomas Ou, Melvyn Sim","doi":"10.1109/ICTAI.2005.111","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.111","url":null,"abstract":"In this paper, we propose the robust temporal constraint network (RTCN) model for simple temporal constraint networks where activity durations are bounded by random variables. The problem is to determine whether such temporal network can be executed with failure probability less than a given 0 les epsi les 1 for each possible instantiation of the random variables, and if so, how one might find a feasible schedule with each given instantiation. The advantage of our model is that one can vary the value of epsi to control the level of conservativeness of the solution. We present a computationally tractable and efficient approach to solve these RTCN problems. We study the effects the density of temporal constraint networks have on its makespan under different confidence levels. We also apply RTCN to solve the stochastic project crashing problem","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114553966","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A MDP solution for mobile agents displacement","authors":"S. E. Falou, F. Bourdon","doi":"10.1109/ICTAI.2005.11","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.11","url":null,"abstract":"The majority of Internet applications requires interaction between various entities through the network, in order to exchange data and to distribute tasks. The client/server model where exchanges are given by distant interactions is the most used model. It has the disadvantage of increasing network traffic by exchanging intermediary information. In this paper we show that in some cases it is better to send the code to the server and to work locally. We study two models of communication (the client/server and the mobile agent) and propose a hybrid one, where agent uses the two models and chooses the best one according to the characteristic of the network. Interaction between different application entities is formulated by a probabilistic model. The Markov decision processes (MDPs) are used to calculate the optimal policy for agent displacement. This policy is applied by the agent in order to decrease network traffic","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126672742","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Study on least squares support vector machines algorithm and its application","authors":"Mingguang Zhang, Zhan-ming Li, Wen-hui Li","doi":"10.1109/ICTAI.2005.116","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.116","url":null,"abstract":"Support vector machines (SVM) is a novel machine learning method based on small-sample statistical learning theory (SLT), and is powerful for the problem with small sample, nonlinearity, high dimension, and local minima.SVM have been very successful in pattern recognition ,fault diagnoses and function estimation problems. Least squares support vector machines (LS-SVM) is an SVM version which involves equality instead of inequality constraints and works with a least squares cost function. This paper discusses least squares support vector machines (LS-SVM) estimation algorithm and introduces applications of the novel method for the nonlinear control systems. Then identification of MIMO models and soft-sensor modeling based on least squares support vector machines (LS-SVM) is proposed. The simulation results show that the proposed method provides a powerful tool for identification and soft-sensor modeling and has promising application in industrial process applications","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"820 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127296928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Atorn Nuntiyagul, K. Naruedomkul, N. Cercone, Damras Wongsawang
{"title":"PKIP: feature selection in text categorization for item banks","authors":"Atorn Nuntiyagul, K. Naruedomkul, N. Cercone, Damras Wongsawang","doi":"10.1109/ICTAI.2005.95","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.95","url":null,"abstract":"We propose an alternative approach to text categorization for item banks. An item bank is a collection of textual data in which each item consists of short sentences and has only a few relevant words for categorization; some items could be categorized into many categories. The traditional categorization techniques cannot provide sufficiently accurate results because of a \"lack of words\" problem. From this observation, items in the same category always have the same group of terms (or keywords) and the similar locations of these terms in phrases suggest that the items have a high probability to be in the same category. Our new methodology PKIP, patterned keywords in phrase, is proposed to improve categorization accuracy and recover from the \"lack of words \"problem. The k-highest weight order words are selected as the keywords from each category and their patterns are mapped for feature selection. The value of k affects the classification result. The item bank categorization process is based on a supervised machine learning technique. The sample of the item bank that is used in this research is the collection of Thai primary mathematics problems item bank and we use SVM in the Weka machine learning software package as our classifier. The result of the classification shows that our approach produces acceptable classification results and the highest classification result is given when k = 12","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"56 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123441574","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Dynamic adaptation and subdivision in 3D-SOM application to surface reconstruction","authors":"Farid Boudjemaï, P. B. Enberg, J. Postaire","doi":"10.1109/ICTAI.2005.61","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.61","url":null,"abstract":"Surface reconstruction and structure representation from unorganized sample points are key problem in many applications for whose neural networks are starting a slight breakthrough. In this framework, we propose an original neural network architecture inspired from Kohonen's self-organizing maps, based on an adaptive learning process applied to a generalized mesh structure that leads to a coherent topological definition of the surface, represented by a points cloud, given as input. This representation tool seems to be efficient in most cases but some weak adaptation drawbacks appear on certain examples. We propose local neighborhood propagation and subdivision process that solves those miss-adaptation problems","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121916618","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An autonomous sewer robots navigation based on stereo camera information","authors":"A. Ahrary, Li Tian, S. Kamata, M. Ishikawa","doi":"10.1109/ICTAI.2005.35","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.35","url":null,"abstract":"In this paper, we propose a method for autonomous sewer robots to navigate through a sewer pipe system based on stereo camera information. In this method, local features such as manholes and pipe joints are extracting as a feature pixels in the region of interest (ROI) of left image. Then, an accurate and fast stereo matching measure named linear computation is implemented in this ROI image to compute the distance between the robots and local features. Finally, the distance data can be used for navigation map in sewer pipe system. The experimental results show that our method can provide sufficient information for autonomous sewer robots navigation","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121997597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"WINP: a window-based incremental and parallel clustering algorithm for very large databases","authors":"Zhang Qiang, Zhao Zheng, S. Wei, E. Daley","doi":"10.1109/ICTAI.2005.129","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.129","url":null,"abstract":"We introduce a new clustering algorithm called WINP for very large databases. Two different sizes of handling objects were used in WINP to acquire high accuracy and efficiency. WINP creates a window to detect approximate locations of clusters before accurate clustering processing. Clustering on these locations will reduce a lot of computations and get a good performance. WINP is the first algorithm to realize both incremental clustering and distributed parallel clustering. The advantages of our new approach are: (1) it is very efficient; (2) it realizes distributed parallel processing and can be run on a number of workstations connected via local area network; (3) it introduces a novel incremental clustering method for new coming data in an already processed database; (4) it is effective in discovering clusters of arbitrary shape; (5) it is not sensitive to noise; and (6) it has some ability to deal with high dimensional points","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122084825","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Fuzzy Logic Approach to Search Results’ Personalization by Tracking User’s Web Navigation Pattern and Psychology","authors":"Sachin Agarwal, P. Agarwal","doi":"10.1109/ICTAI.2005.10","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.10","url":null,"abstract":"The paper intends to describe a method of personalizing the agglomerated search results from various search engines according to the user interests by making use of the Web browsing pattern of the user. The technique used classifies the results from the search engines into pre-defined categories (classes) and ranks the categories according to the user's interests. The results within a class can be ranked further by using the Web page look and feel characteristics that appeals to the user. The tracking of the user's interest from his Web navigation pattern and then deciding about his change in priorities is made by using sets of fuzzy rules proposed in the paper. These rules are made keeping in mind, user's psychology and Web page characteristics that appeal a user. The technique described is implemented on a system and the results of the system have been elucidated in the paper","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131918077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Toward a logical tool for generating new arguments in an argumentation based framework","authors":"Geoffroy Aubry, V. Risch","doi":"10.1109/ICTAI.2005.121","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.121","url":null,"abstract":"Following the framework proposed by Besnard and Hunter for argumentation, this paper aims to propose a logical tool for the generation of new arguments when two formal agents have to face their respective knowledge. The following notions are addressed: the behaviour of an agent facing an argument, the answer of an agent in front of a set of formulas, and relations among arguments. X-logics, a nonmonotonic extension of classical propositional logic proposed by Siegel and Forget, is used as the background formalism for representing the reasoning of the agents on arguments","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122238204","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}