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

筛选
英文 中文
Variables Interaction for Mining Negative and Positive Quantitative Association Rules 基于变量交互的正、负量化关联规则挖掘
L. N. Alachaher, S. Guillaume
{"title":"Variables Interaction for Mining Negative and Positive Quantitative Association Rules","authors":"L. N. Alachaher, S. Guillaume","doi":"10.1109/ICTAI.2006.119","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.119","url":null,"abstract":"This paper introduces an efficient method for mining both positive and negative quantitative association rules using a tabular pruning and regrouping strategy coordinated with an interestingness measure. This measure evaluates the impact of a new variable on the concerned association","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":"128877082","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}
引用次数: 4
Automated AI Planning and Code Pattern Based Code Synthesis 自动人工智能规划和基于代码模式的代码合成
Jicheng Fu, F. Bastani, I. Yen
{"title":"Automated AI Planning and Code Pattern Based Code Synthesis","authors":"Jicheng Fu, F. Bastani, I. Yen","doi":"10.1109/ICTAI.2006.37","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.37","url":null,"abstract":"The past decade has seen great progress in the development of embedded real-time systems, which are playing increasingly important roles in various application domains. However, the growing complexity of these systems has revealed the urgent need to develop advanced techniques to reduce the time-to-market as well as the overall system development cost. One method for achieving both of these goals is automated code synthesis combined with component based software development (CBSD). This enables the synthesizer to focus on generating the glue code needed to assemble an application from existing components. The main challenge is how to enable the synthesizer to recognize and generate complex conditional or loop statements. In this paper, a pattern-based code synthesis approach is enhanced to enable it to synthesize new loop statements. Specifically, we use an extended version of Graphplan to help the synthesizer to recognize and generate new loop statements. The paper proposes a planning domain model for code patterns and an automated code synthesis system, which integrates the enhanced AI planner with the code pattern integration system (CPIS) to fully automate the code synthesis process","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"25 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":"132471073","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}
引用次数: 9
Multi-Criterion Active Learning in Conditional Random Fields 条件随机场中的多准则主动学习
Christopher T. Symons, N. Samatova, R. Krishnamurthy, Byung-Hoon Park, Tarik Umar, David J. Buttler, T. Critchlow, D. Hysom
{"title":"Multi-Criterion Active Learning in Conditional Random Fields","authors":"Christopher T. Symons, N. Samatova, R. Krishnamurthy, Byung-Hoon Park, Tarik Umar, David J. Buttler, T. Critchlow, D. Hysom","doi":"10.1109/ICTAI.2006.90","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.90","url":null,"abstract":"Conditional random fields (CRFs), which are popular supervised learning models for many natural language processing (NLP) tasks, typically require a large collection of labeled data for training. In practice, however, manual annotation of text documents is quite costly. Furthermore, even large labeled training sets can have arbitrarily limited performance peaks if they are not chosen with care. This paper considers the use of multi-criterion active learning for identification of a small but sufficient set of text samples for training CRFs. Our empirical results demonstrate that our method is capable of reducing the manual annotation costs, while also limiting the retraining costs that are often associated with active learning. In addition, we show that the generalization performance of CRFs can be enhanced through judicious selection of training examples","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":"131903953","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}
引用次数: 23
Preserving Patterns in Bipartite Graph Partitioning 二部图划分中的模式保持
Tianming Hu, Chao Qu, C. Tan, S. Sung, Wenjun Zhou
{"title":"Preserving Patterns in Bipartite Graph Partitioning","authors":"Tianming Hu, Chao Qu, C. Tan, S. Sung, Wenjun Zhou","doi":"10.1109/ICTAI.2006.97","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.97","url":null,"abstract":"This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to be split into different clusters. Our approach for pattern preserving clustering consists of three steps: mine maximal hyperclique patterns, form the bipartite, and partition it. With hyperclique patterns of documents preserved, the topic of each cluster can be represented by both the top words from that cluster and the documents in the patterns, which are expected to be more compact and representative than those in the standard bipartite formulation. Experiments with real-world datasets show that, with hyperclique patterns as starting points, we can improve the clustering results in terms of various external clustering criteria. Also, the partitioned bipartite with preserved topical sets of documents naturally lends itself to different functions in search engines","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":"128769673","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
Toward Human-Level Machine Intelligence 迈向人类水平的机器智能
L. Zadeh
{"title":"Toward Human-Level Machine Intelligence","authors":"L. Zadeh","doi":"10.1109/ICTAI.2006.114","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.114","url":null,"abstract":"Can machines think? This question has been an object of discussion and debate for over half-a-century. My interest in the question goes back to the beginning of my academic career. Officially, AI was born in l956. At its birth there was widespread expectation that within a few years it will be possible to build machines that could think like humans. I did not share that belief. To the pioneers, symbolic logic was all that was needed. Anything that involved numerical computations was unwelcome. It took close to thirty years for probability theory to gain grudging acceptance. Clearly, adding probability theory to the armamentarium of AI is a step in the right direction. But is it sufficient? In my view, the answer is: No.","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"30 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":"133913525","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}
引用次数: 9
The Culebra Algorithm for Path Planning and Obstacle Avoidance in Kat-5 基于cullebra算法的Kat-5路径规划与避障
J. Nagel, P. G. Trepagnier, C. Koutsougeras, P. Kinney, M. Dooner
{"title":"The Culebra Algorithm for Path Planning and Obstacle Avoidance in Kat-5","authors":"J. Nagel, P. G. Trepagnier, C. Koutsougeras, P. Kinney, M. Dooner","doi":"10.1109/ICTAI.2006.110","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.110","url":null,"abstract":"Kat-5 was the fourth vehicle to successfully finish the DARPA 2005 Grand Challenge; the first time ever that autonomous vehicles were able to successfully complete such a task. In this paper, we describe the methods that were used to develop the vehicle's path planning and obstacle avoidance algorithms, which allowed Kat-5 to successfully navigate completely autonomously the 132 miles course over rough and previously unrehearsed and unknown terrain at relatively high speeds","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"111 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":"125201252","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}
引用次数: 7
Robust Controllability of Temporal Constraint Networks under Uncertainty 不确定条件下时间约束网络的鲁棒可控性
H. Lau, Jia Li, R. Yap
{"title":"Robust Controllability of Temporal Constraint Networks under Uncertainty","authors":"H. Lau, Jia Li, R. Yap","doi":"10.1109/ICTAI.2006.100","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.100","url":null,"abstract":"Temporal constraint networks are embedded in many planning and scheduling problems. In dynamic problems, a fundamental challenge is to decide whether such a network can be executed as uncertainty is revealed over time. Very little work in this domain has been done in the probabilistic context. In this paper, we propose a temporal constraint network (TCN) model where durations of uncertain activities are represented by random variables. We wish to know whether such a network is robust controllable, i.e. can be executed dynamically within a given failure probability, and if so, how one might find a feasible schedule as the uncertainty variables are revealed dynamically. We present a computationally tractable and efficient approach to solve this problem. Experimentally, we study how the failure probability is affected by various network properties of the underlying TCN, and the relationship of failure rates between robust and weak controllability","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"5 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":"130857441","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}
引用次数: 14
UNPCC: A Novel Unsupervised Classification Scheme for Network Intrusion Detection UNPCC:一种新的网络入侵检测无监督分类方案
Zongxing Xie, Thiago Quirino, M. Shyu, Shu‐Ching Chen, LiWu Chang
{"title":"UNPCC: A Novel Unsupervised Classification Scheme for Network Intrusion Detection","authors":"Zongxing Xie, Thiago Quirino, M. Shyu, Shu‐Ching Chen, LiWu Chang","doi":"10.1109/ICTAI.2006.115","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.115","url":null,"abstract":"The development of effective classification techniques, particularly unsupervised classification, is important for real-world applications since information about the training data before classification is relatively unknown. In this paper, a novel unsupervised classification algorithm is proposed to meet the increasing demand in the domain of network intrusion detection. Our proposed UNPCC (unsupervised principal component classifier) algorithm is a multiclass unsupervised classifier with absolutely no requirements for any a priori class related data information (e.g., the number of classes and the maximum number of instances belonging to each class), and an inherently natural supervised classification scheme, both which present high detection rates and several operational advantages (e.g., lower training time, lower classification time, lower processing power requirement, and lower memory requirement). Experiments have been conducted with the KDD Cup 99 data and network traffic data simulated from our private network testbed, and the promising results demonstrate that our UNPCC algorithm outperforms several well-known supervised and unsupervised classification algorithms","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"47 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":"114323893","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}
引用次数: 12
QoS Adaptive ISHM Systems QoS自适应ISHM系统
Yansheng Zhang, Jicheng Fu, I. Yen, F. Bastani, A. Tai, S. Chau, F. Vatan, A. Fijany
{"title":"QoS Adaptive ISHM Systems","authors":"Yansheng Zhang, Jicheng Fu, I. Yen, F. Bastani, A. Tai, S. Chau, F. Vatan, A. Fijany","doi":"10.1109/ICTAI.2006.99","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.99","url":null,"abstract":"Embedded systems are becoming highly complex and increasingly being used in critical applications. Integrated system health management (ISHM) techniques have therefore been developed to ensure the proper operation of these systems. However, some ISHM systems are relatively complex and may consume a significant amount of resources. In some situations, activating the full ISHM system may cause resource contention and prevents the target system from timely completing critical tasks. Thus, it is imperative to introduce the notion of adaptivity into ISHM systems. This paper systematically discusses the issues that need to be addressed in an adaptive ISHM system with a focus on adaptation in terms of QoS aspects. A novel model, adaptive diagnosis quality-oriented system model (ADQSM), is proposed to model the QoS specification and fault diagnosis quality measurement issues as well as the abstraction of the adaptation problem. We then present the method to evaluate various diagnosability attributes based on a modified fault signature matrix. We further map the ADQSM model to the particle swarm optimization (PSO) problem model and use PSO for rapid configuration decision making","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"15 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":"124608119","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
Sustained Emerging Spatio-Temporal Co-occurrence Pattern Mining: A Summary of Results 持续新兴时空共现模式挖掘:结果综述
Mete Celik, S. Shekhar, James P. Rogers, J. Shine
{"title":"Sustained Emerging Spatio-Temporal Co-occurrence Pattern Mining: A Summary of Results","authors":"Mete Celik, S. Shekhar, James P. Rogers, J. Shine","doi":"10.1109/ICTAI.2006.108","DOIUrl":"https://doi.org/10.1109/ICTAI.2006.108","url":null,"abstract":"Sustained emerging spatio-temporal co-occurrence patterns (SECOPs) represent subsets of object-types that are increasingly located together in space and time. Discovering SECOPs is important due to many applications, e.g., predicting emerging infectious diseases, predicting defensive and offensive intent from troop movement patterns, and novel predator-prey interactions. However, mining SECOPs is computationally very expensive because the interest measures are computationally complex, datasets are larger due to the archival history, and the set of candidate patterns is exponential in the number of object-types. We propose a monotonic interest measure for mining SECOPs and a novel SECOP mining algorithm. Analytical and experimental results show that the proposed algorithm is correct, complete, and computationally faster than related approaches. Results also show the proposed algorithm is computationally more efficient than naive alternatives","PeriodicalId":169424,"journal":{"name":"2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06)","volume":"27 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":"124933696","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}
引用次数: 30
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学术文献互助群
群 号:481959085
Book学术官方微信