发布求助
文献互助 智能选刊 最新文献

17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)最新文献

筛选
英文 中文
A clustering approach to wireless network intrusion detection 一种无线网络入侵检测的聚类方法
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.5
Shi Zhong, T. Khoshgoftaar, S. Nath
{"title":"A clustering approach to wireless network intrusion detection","authors":"Shi Zhong, T. Khoshgoftaar, S. Nath","doi":"10.1109/ICTAI.2005.5","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.5","url":null,"abstract":"Intrusion detection in wireless networks has become an indispensable component of any useful wireless network security systems, and has recently gained attention in both research and industry communities due to widespread use of wireless local area networks (WLANs). This paper focuses on detecting intrusions or anomalous behaviors in WLANs with data clustering techniques. We first explore the security vulnerabilities of 802.11 or Wi-Fi networks and summarize the network traffic metrics that are important to model the security of wireless networks. Based on the metrics studied we propose a clustering-based intrusion detection approach and evaluate it on a real-world large wireless network traffic dataset. The evaluation results demonstrate the effectiveness of our proposed intrusion detection approach for wireless networks","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"171 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":"117296341","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}
引用次数: 59
Quantum-behaved particle swarm optimization with mutation operator 带突变算子的量子粒子群优化
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.104
Jing Liu, Wenbo Xu, Jun Sun
{"title":"Quantum-behaved particle swarm optimization with mutation operator","authors":"Jing Liu, Wenbo Xu, Jun Sun","doi":"10.1109/ICTAI.2005.104","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.104","url":null,"abstract":"The mutation mechanism is introduced into quantum-behaved particle swarm optimization to increase its global search ability and escape from local minima. Based on the characteristic of QPSO algorithm, the variable of gbest and mbest is mutated with Cauchy distribution respectively. The experimental results on test functions show that QPSO with gbest and mbest mutation both performs better than PSO and QPSO without mutation","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"49 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":"115379307","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}
引用次数: 107
The deception detection and restraint in multi-agent system 多智能体系统中的欺骗检测与约束
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.120
Shuliang Zhao, Guorui Jiang, Tiyun Huang, Xiaoyan Yang
{"title":"The deception detection and restraint in multi-agent system","authors":"Shuliang Zhao, Guorui Jiang, Tiyun Huang, Xiaoyan Yang","doi":"10.1109/ICTAI.2005.120","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.120","url":null,"abstract":"We give an approach on the detection and restraint of agent ability declaration deception in multi-agent system, and give a measure to detect and restrain the agent slandering and agent associated-cheat; we also give a method to recognize the agent impostor deception. Simulation test shows this method can fully detect the following impostor deception behaviors: an impostor falsely evaluates other agent; an impostor broadcasts rumor in other agent's relationship web; an impostor cooperates with other agents. It provides a solution to detect and restrain agent deceptions in multi-agent cooperation","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"14 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":"121339415","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
A new association rule-based text classifier algorithm 一种新的基于关联规则的文本分类算法
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.13
S. Buddeewong, W. Kreesuradej
{"title":"A new association rule-based text classifier algorithm","authors":"S. Buddeewong, W. Kreesuradej","doi":"10.1109/ICTAI.2005.13","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.13","url":null,"abstract":"This paper proposes a new association rule-based text classifier algorithm to improve the prediction accuracy of association rule-based classifier by categories (ARC-BC) algorithm. Unlike the previous algorithms, the proposed association rule generation algorithm constructs two types of frequent itemsets. The first frequent itemsets, i.e. Lk contain all term that have no an overlap with other categories. The second frequent itemsets, i.e. OLk contain all features that have an overlap with other categories. In addition, this paper also proposes a new join operation for the second frequent itemsets. The experimental results are shown a good performance of the proposed classifier","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"1 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":"130127180","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}
引用次数: 24
Algebraic temporal specifications with extended TUS. Hierarchical granular terms and their applications 具有扩展TUS的代数时间规范。分层粒度术语及其应用
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.30
M. Bouzid, A. Ligeza
{"title":"Algebraic temporal specifications with extended TUS. Hierarchical granular terms and their applications","authors":"M. Bouzid, A. Ligeza","doi":"10.1109/ICTAI.2005.30","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.30","url":null,"abstract":"Specification and efficient handling of temporal knowledge is an important issue in design and implementation of contemporary information systems, such as databases, knowledge-based systems or decision support systems. This paper re-explores TUS, the time unit system being an algebraic tool for constructing simple yet powerful temporal specifications. In particular, an extended version of TUS, to be called XTUS is introduced and its basic operations and properties are shown","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"40 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":"126928440","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
Practical application of support-based distributed search 基于支持的分布式搜索的实际应用
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.97
Peter Harvey, C. Chang, A. Ghose
{"title":"Practical application of support-based distributed search","authors":"Peter Harvey, C. Chang, A. Ghose","doi":"10.1109/ICTAI.2005.97","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.97","url":null,"abstract":"Algorithms for distributed constraint satisfaction problems have tended to mirror existing non-distributed global-search or local-search algorithms. Unfortunately, existing distributed global-search algorithms derive from classical backtracking search methods and require a total ordering over variables for completeness. Distributed variants of local-search algorithms (such as distributed breakout) inherit the incompleteness properties of their predecessors. A meeting scheduling problem translates to a DisCSP where a global ordering is difficult to maintain and creates undesirable behaviours. We present a practical demonstration of an algorithm in which a global ordering is not required, while avoiding the problems of local-search algorithms","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"108 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":"114476544","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
An integrated model of intrusion detection based on neural network and expert system 基于神经网络和专家系统的入侵检测集成模型
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.36
Zhisong Pan, Hong Lian, Guyu Hu, Guiqiang Ni
{"title":"An integrated model of intrusion detection based on neural network and expert system","authors":"Zhisong Pan, Hong Lian, Guyu Hu, Guiqiang Ni","doi":"10.1109/ICTAI.2005.36","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.36","url":null,"abstract":"Intrusion detection technology is an effective approach to dealing with the problems of network security. In this paper, it presents an intrusion detection model based on neural network and expert system. The key idea is to aim at taking advantage of classification abilities of neural network for unknown attacks and the expert-based system for the known attacks. We employ data from the third international knowledge discovery and data mining tools competition (KDDcup'99) to train and test the feasibility of our proposed neural network component. According to the results of our experiment, our model achieves 96.6 percent detection rate for DOS and probing intrusions, and less than 0.04 percent false alarm rate. Expert system can detect R2L and U2R intrusions more accurately than neural network. Therefore, hybrid model improves the performance to detect intrusions","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"120 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":"122890429","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}
引用次数: 27
Determining the optimal number of clusters using a new evolutionary algorithm 使用一种新的进化算法确定最优簇数
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.57
Wei Lu, Issa Traoré
{"title":"Determining the optimal number of clusters using a new evolutionary algorithm","authors":"Wei Lu, Issa Traoré","doi":"10.1109/ICTAI.2005.57","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.57","url":null,"abstract":"Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper preselection for the number of clusters might easily lead to bad clustering outcome. In this paper, we propose a new evolutionary algorithm to address this issue. Specifically, the proposed evolutionary algorithm defines a new entropy-based fitness function, and three new genetic operators for splitting, merging, and removing clusters. Empirical evaluations using the synthetic dataset and an existing benchmark show that the proposed evolutionary algorithm can exactly estimate the optimal number of clusters for a set of data","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"18 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":"123953181","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
Predicting program guides for video structuring 视频结构预测程序指南
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1109/ICTAI.2005.98
Jean-Philippe Poli
{"title":"Predicting program guides for video structuring","authors":"Jean-Philippe Poli","doi":"10.1109/ICTAI.2005.98","DOIUrl":"https://doi.org/10.1109/ICTAI.2005.98","url":null,"abstract":"The French National Audiovisual Institute is in charge of archiving continuously the video stream of every French channel. In order to be described, each program must be isolated in the stream. Our paper focuses on creating a system which can find programs' boundaries. We propose in this article a way to predict various programs' boundaries to obtain temporal windows in which our system is able to search","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"236 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":"124016059","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
Using a Lagrangian heuristic for a combinatorial auction problem 用拉格朗日启发式求解组合拍卖问题
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05) Pub Date : 2005-11-14 DOI: 10.1142/S0218213006002771
Yunsong Guo, A. Lim, B. Rodrigues, Jiqing Tang
{"title":"Using a Lagrangian heuristic for a combinatorial auction problem","authors":"Yunsong Guo, A. Lim, B. Rodrigues, Jiqing Tang","doi":"10.1142/S0218213006002771","DOIUrl":"https://doi.org/10.1142/S0218213006002771","url":null,"abstract":"In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experiments are conducted using benchmark CATS test sets and more complex test sets. The algorithm provides optimal solutions for most test sets and is always 1%from the optimal solutions for all CATS test sets. Comparisons with CPLEX 8.0 are also provided, which show that the algorithm provides good solutions","PeriodicalId":294694,"journal":{"name":"17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05)","volume":"43 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":"121278369","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}
引用次数: 31
首页 上一页 下一页 尾页
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学术官方微信