2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)最新文献

筛选
英文 中文
The Knowledge Puzzle: An Integrated Approach of Intelligent Tutoring Systems and Knowledge Management 知识难题:智能辅导系统与知识管理的集成方法
A. Zouaq, R. Nkambou, C. Frasson
{"title":"The Knowledge Puzzle: An Integrated Approach of Intelligent Tutoring Systems and Knowledge Management","authors":"A. Zouaq, R. Nkambou, C. Frasson","doi":"10.1109/ICTAI.2006.111","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.111","url":null,"abstract":"In this paper, we present The Knowledge Puzzle, an ontology-based platform designed to facilitate domain knowledge acquisition for knowledge-based systems and especially for intelligent tutoring systems. We present a new content model, the Knowledge Puzzle Content Model, that aims to create Learning Knowledge Objects (LKOs) from annotated content. Annotations are performed semi-automatically using natural language processing algorithms. These LKOs are then aggregated in an Organizational memory (OM) which serves as a knowledge base for an intelligent tutoring system (ITS)","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117244719","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}
引用次数: 10
Exponential Recurrent Associative Memories: Stability and Relative Capacity 指数循环联想记忆:稳定性和相对容量
M. Rajati, M. Menhaj, M. Korjani, A. Dehestani
{"title":"Exponential Recurrent Associative Memories: Stability and Relative Capacity","authors":"M. Rajati, M. Menhaj, M. Korjani, A. Dehestani","doi":"10.1109/ICTAI.2006.58","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.58","url":null,"abstract":"In this paper, relative capacity of a specific higher order Hopfield-type associative memory is considered. This model, which is known as exponential Hopfield neural network is suitable for hardware implementation and is not of a great computational cost. It is shown that, this modification of the Hopfield model significantly improves the storage capacity of the associative memory. We also classify the model via a stability measure, and study the effect of training the network with biased patterns on the stability","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126168394","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}
引用次数: 0
Computing the Equilibria of Bimatrix Games Using Dominance Heuristics 用优势启发式计算双矩阵对策的均衡
R. Aras, A. Dutech, F. Charpillet
{"title":"Computing the Equilibria of Bimatrix Games Using Dominance Heuristics","authors":"R. Aras, A. Dutech, F. Charpillet","doi":"10.1109/ICTAI.2006.44","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.44","url":null,"abstract":"We propose a formulation of a general-sum bimatrix game as a bipartite directed graph with the objective of establishing a correspondence between the set of the relevant structures of the graph (in particular elementary cycles) and the set of the Nash equilibria of the game. We show that finding the set of elementary cycles of the graph permits the computation of the set of equilibria. For games whose graphs have a sparse adjacency matrix, this serves as a good heuristic for computing the set of equilibria. The heuristic also allows the discarding of sections of the support space that do not yield any equilibrium, thus serving as a useful preprocessing step for algorithms that compute the equilibria through support enumeration","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122571570","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}
引用次数: 3
Minimum Spanning Tree Based Clustering Algorithms 最小生成树聚类算法
O. Grygorash, Yan Zhou, Zach Jorgensen
{"title":"Minimum Spanning Tree Based Clustering Algorithms","authors":"O. Grygorash, Yan Zhou, Zach Jorgensen","doi":"10.1109/ICTAI.2006.83","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.83","url":null,"abstract":"The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In this paper, we propose two minimum spanning tree based clustering algorithms. The first algorithm produces a k-partition of a set of points for any given k. The algorithm constructs a minimum spanning tree of the point set and removes edges that satisfy a predefined criterion. The process is repeated until k clusters are produced. The second algorithm partitions a point set into a group of clusters by maximizing the overall standard deviation reduction, without a given k value. We present our experimental results comparing our proposed algorithms to k-means and EM. We also apply our algorithms to image color clustering and compare our algorithms to the standard minimum spanning tree clustering algorithm","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130059847","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}
引用次数: 237
A Hybrid Approach to Cleansing Software Measurement Data 清洗软件测量数据的混合方法
T. Khoshgoftaar, J. V. Hulse, Chris Seiffert
{"title":"A Hybrid Approach to Cleansing Software Measurement Data","authors":"T. Khoshgoftaar, J. V. Hulse, Chris Seiffert","doi":"10.1109/ICTAI.2006.11","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.11","url":null,"abstract":"Data is extremely important in empirical software engineering. Techniques that provide insight into potential anomalies or inaccuracies in a dataset are becoming an increasingly important way for a data analyst to cope with flawed data. We present a novel hybrid procedure for quantitative outcome correction along with controlled experiments using a real-world software measurement dataset to demonstrate the usefulness of our technique. Instances that are deemed to be noisy relative to the dependent variable, which represents the number of faults recorded in the program module, are cleansed by replacing the original value with a more appropriate alternative value","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128942898","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}
引用次数: 6
Methodology for the Selection of Intelligence Analysis Tools 情报分析工具选择的方法论
H. Vafaie, Nichols F. Brown, Lap Truong
{"title":"Methodology for the Selection of Intelligence Analysis Tools","authors":"H. Vafaie, Nichols F. Brown, Lap Truong","doi":"10.1109/ICTAI.2006.81","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.81","url":null,"abstract":"The use of commercial-off-the-shelf (COTS) / government-off-the-shelf (GOTS) applications as components in software systems is increasingly prevalent. The critical step of tool selection for an integrated suite is usually based on identifying the tools that best match the functionality requirements needed. Other factors tangential to technical performance are playing a more important role in the tool selection process and making the mapping of customer needs to technical requirements less obvious. This paper suggests a shift from the traditional \"best tools\" selection approach, where tools are selected for their performance to a more holistic \"end-to-end\" approach, where customer concerns, business and cost benefits, and technical performance are weighed concurrently. The end-to-end methodology was applied to an integrated suite for the intelligence analysis process and was compared to a theoretical system employing a best tools approach. This showed that the end-to-end approach resulted in significant software related cost reductions","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131686179","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}
引用次数: 5
Condition Matrix Based Genetic Programming for Rule Learning 基于条件矩阵的规则学习遗传规划
Jin Feng Wang, Kin-Hong Lee, K. Leung
{"title":"Condition Matrix Based Genetic Programming for Rule Learning","authors":"Jin Feng Wang, Kin-Hong Lee, K. Leung","doi":"10.1109/ICTAI.2006.45","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.45","url":null,"abstract":"Most genetic programming paradigms are population-based and require huge amount of memory. In this paper, we review the instruction matrix based genetic programming which maintains all program components in a instruction matrix (IM) instead of manipulating a population of programs. A genetic program is extracted from the matrix just before it is being evaluated. After each evaluation, the fitness of the genetic program is propagated to its corresponding cells in the matrix. Then, we extend the instruction matrix to the condition matrix (CM) for generating rule base from datasets. CM keeps some of characteristics of IM and incorporates the information about rule learning. In the evolving process, we adopt an elitist idea to keep the better rules alive to the end. We consider that genetic selection maybe lead to the huge size of rule set, so the reduct theory borrowed from rough sets is used to cut the volume of rules and keep the same fitness as the original rule set. In experiments, we compare the performance of condition matrix for rule learning (CMRL) with other traditional algorithms. Results are presented in detail and the competitive advantage and drawbacks of CMRL are discussed","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115487004","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}
引用次数: 1
A Hybrid Recogniser for Handwritten Symbols Based on Fuzzy Logic and Self-Organizing Maps 基于模糊逻辑和自组织映射的手写体符号混合识别
A. Cronin, John A. Fitzgerald, Mohand Tahar Kechadi
{"title":"A Hybrid Recogniser for Handwritten Symbols Based on Fuzzy Logic and Self-Organizing Maps","authors":"A. Cronin, John A. Fitzgerald, Mohand Tahar Kechadi","doi":"10.1109/ICTAI.2006.13","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.13","url":null,"abstract":"In this paper we present a hybrid approach to handwritten symbol recognition based on two different methods and principles. A fuzzy rules based recogniser and a self-organizing map recogniser are combined to form our hybrid system. These two systems complement each other well, firstly because their feature extraction techniques differ greatly, and secondly because one is a model-based and the other is a discriminative classifier. Each system generates a ranked list of outputs with associated confidence values, and these outputs are combined to produce a single result. The approach has achieved high recognition rates in testing on digits and lowercase characters from the UNIPEN database","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243110","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}
引用次数: 3
Machine Learning in Value-Based Software Test Data Generation 基于价值的软件测试数据生成中的机器学习
Du Zhang
{"title":"Machine Learning in Value-Based Software Test Data Generation","authors":"Du Zhang","doi":"10.1109/ICTAI.2006.77","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.77","url":null,"abstract":"Software engineering research and practice thus far are primarily conducted in a value-neutral setting where each artifact in software development such as requirement, use case, test case, and defect, is treated as equally important during a software system development process. There are a number of shortcomings of such value-neutral software engineering. Value-based software engineering is to integrate value considerations into the full range of existing and emerging software engineering principles and practices. Machine learning has been playing an increasingly important role in helping develop and maintain large and complex software systems. However, machine learning applications to software engineering have been largely confined to the value-neutral software engineering setting. In this paper, we advocate a shift to applying machine learning methods to value-based software engineering. We propose a framework for value-based software test data generation. The proposed framework incorporates some general principles in value-based software testing and can help improve return on investment","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128724671","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}
引用次数: 18
Adaptive Service-Oriented Application Architecture and System Engineering 自适应面向服务的应用程序体系结构和系统工程
R. Paul
{"title":"Adaptive Service-Oriented Application Architecture and System Engineering","authors":"R. Paul","doi":"10.1109/ICTAI.2006.27","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.27","url":null,"abstract":"Service-oriented computing is making strides due to acceptance by government and major computer and software companies, however there are several issues that we need to address. SOA is related to a number of traditional professional areas such as business models, programming languages, model construction, verification, software architecture and design, software reusability, databases, ontology, autonomic computing, grid computing, and computer networks.","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128954434","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信