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

2014 IEEE 26th International Conference on Tools with Artificial Intelligence最新文献

筛选
英文 中文
A Support System for the Capitalization and the Exploitation of Expert Knowledge 专家知识资本化与利用的支持系统
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.40
Emilien Bondu, N. Chaignaud, Jean-Philippe Kotowicz, H. Abdulrab
{"title":"A Support System for the Capitalization and the Exploitation of Expert Knowledge","authors":"Emilien Bondu, N. Chaignaud, Jean-Philippe Kotowicz, H. Abdulrab","doi":"10.1109/ICTAI.2014.40","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.40","url":null,"abstract":"This article describes some tools to improve the foresight process and help the watchers to identify interesting information, in order to detect early warnings on threats or opportunities in open sources. A formal model of scenario is proposed to represent the expert knowledge about the potential situations in the environment and their links. The ontology Scenari Onto allows the scenario exploitation to collect interesting documents on the Web and presents them to the watchers for a manual analysis. A Graphic User Interface (GUI) component has been developed to build scenarios graphically. To exploit the capitalized knowledge, WebLab services have been developed. Finally, an experimentation has been set up to evaluate the system, showing encouraging results.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132039257","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
Synthesis of Cognitive Maps and Applications 认知地图的合成及其应用
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.51
Aymeric Le Dorze, Laurent Garcia, David Genest, S. Loiseau
{"title":"Synthesis of Cognitive Maps and Applications","authors":"Aymeric Le Dorze, Laurent Garcia, David Genest, S. Loiseau","doi":"10.1109/ICTAI.2014.51","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.51","url":null,"abstract":"Cognitive maps are a knowledge representation model that describes influences between concepts. Their building is usually done by many people. This is a difficult task for them since they have to agree on every aspect of the map. This article proposes a new method to allow these people to be the designers of their own cognitive maps. A process, called synthesis, builds then a single cognitive map from this set of maps. The divergences in the maps due to the different points of view have to be solved. To do so, preferences on the designers are defined, they are used to favor the knowledge brought by some designer over the other ones.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"22 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942544","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
Efficient Relaxations of Over-constrained CSPs 过约束csp的有效松弛
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.113
Carlos Mencía, Joao Marques-Silva
{"title":"Efficient Relaxations of Over-constrained CSPs","authors":"Carlos Mencía, Joao Marques-Silva","doi":"10.1109/ICTAI.2014.113","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.113","url":null,"abstract":"Constraint Programming is becoming the preferred solving technology in a variety of application domains. It is not unusual that a CSP modeling some real-life problem is found to be unfeasible or over-constrained. In this scenario, users may be interested in identifying the causes responsible for inconsistency, or in getting some advice so that they can reformulate their problem to render it feasible. This paper is concerned with the latter issue, which plays a very important role in the analysis of over-constrained problems. Concretely, we study the problem of computing a minimal exclusion set of constraints (MESC) from unfeasible CSPs. A MESC is a set-wise minimal set of constraints whose removal makes the original problem feasible. We provide an overview of existing techniques for MESC extraction and consider additional alternatives and optimizations. Our main contribution is the adaptation of one of the best-performing algorithms for SAT to work in CSP. We also integrate a technique that improves its efficiency. The results from an experimental study indicate considerable improvements over the state-of-the-art.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115962924","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
Robust Plan Execution in Multi-agent Environments 多代理环境下的稳健计划执行
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.65
Cesar Guzman, Pablo Castejón, E. Onaindía, J. Frank
{"title":"Robust Plan Execution in Multi-agent Environments","authors":"Cesar Guzman, Pablo Castejón, E. Onaindía, J. Frank","doi":"10.1109/ICTAI.2014.65","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.65","url":null,"abstract":"This paper presents a novel multi-agent reactive execution model that keeps track of the execution of an agent to recover from incoming failures. It is a domain-independent execution model, which can be exploited in any planning control application, embedded into a more general multi-agent planning framework. The multi-agent reactive execution model provides a mechanism allowing an agent to respond to failures that prevent completion of a task when another agent is not able to repair the failure by itself. The model exploits the reactive planning capabilities of agents to come up with a solution at runtime, thus preventing agents from having to resort to replanning. We show the application of the proposed model for the control of multiple autonomous space vehicles.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117326209","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
Graph-Based Hierarchical Video Summarization Using Global Descriptors 使用全局描述符的基于图的分层视频摘要
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.127
Luciana dos Santos Belo, C. Caetano, Zenilton K. G. Patrocínio, S. Guimarães
{"title":"Graph-Based Hierarchical Video Summarization Using Global Descriptors","authors":"Luciana dos Santos Belo, C. Caetano, Zenilton K. G. Patrocínio, S. Guimarães","doi":"10.1109/ICTAI.2014.127","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.127","url":null,"abstract":"Video summarization is a simplification of video content for compacting the video information. The video summarization problem can be transformed to a clustering problem, in which some frames are selected to saliently represent the video content. In this work, we use a hierarchical graph-based clustering method for computing a video summary. In fact, the proposed approach, called Summary, adopts a hierarchical clustering method to generate a weight map from the frame similarity graph in which the clusters (or connected components of the graph) can easily be inferred. Moreover, the use of this strategy allows to apply a similarity measure between clusters during graph partition, instead of considering only the similarity between isolated frames. Furthermore, a new evaluation measure that assesses the diversity of opinions of user summaries, called Covering, is also proposed. Experimental results provide quantitative and qualitative comparison between the new approach and other popular algorithms from the literature, showing that the new algorithm is robust and efficient. Concerning quality measures, Summary outperforms the compared methods regardless of the visual feature used in terms of F-measure.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114487729","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
k-Intervals: A New Extension of the k-Means Algorithm k-区间:k-均值算法的新扩展
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.45
Fenfei Guo, Deqiang Han, Chongzhao Han
{"title":"k-Intervals: A New Extension of the k-Means Algorithm","authors":"Fenfei Guo, Deqiang Han, Chongzhao Han","doi":"10.1109/ICTAI.2014.45","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.45","url":null,"abstract":"In this paper we propose a new extension of the k-means algorithm by changing the model it uses to represent clusters. The objectives of traditional k-means and lots of other k-means-related clustering algorithms are all center-based. We suggest using an alternative way to represent the clusters while computing the similarity between an object and a certain cluster. The purpose is to preserve more information of the clusters and at the same time keep the simplicity of the algorithm. In this paper we use intervals to represent clusters and propose a new clustering algorithm k-intervals based on this model. Experimental results on both synthetic data sets and real data sets (several UCI data sets and the ORL face database) demonstrate the effectiveness and the advantages of the proposed algorithm.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114375724","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
An Integer Linear Programming Scheme to Sanitize Sensitive Frequent Itemsets 敏感频繁项集净化的整数线性规划方法
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.119
Vasileios Kagklis, Vassilios S. Verykios, Giannis Tzimas, A. Tsakalidis
{"title":"An Integer Linear Programming Scheme to Sanitize Sensitive Frequent Itemsets","authors":"Vasileios Kagklis, Vassilios S. Verykios, Giannis Tzimas, A. Tsakalidis","doi":"10.1109/ICTAI.2014.119","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.119","url":null,"abstract":"In this paper, we propose a novel approach to address the frequent item set hiding problem, by formulating it as an integer linear program (ILP). The solution of the ILP points out the transactions that need to be sanitized in order to achieve the hiding of the sensitive frequent item sets, while the impact on other non-sensitive item sets is minimized. We present a novel heuristic approach to calculate the coefficients of the objective function of the ILP, while at the same time we minimize the side effects introduced by the hiding process. We also propose a sanitization algorithm that performs the hiding on the selected transactions. Finally, we evaluate the proposed method on real datasets and we compare the results of the newly proposed method with those of other state of the art approaches.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125215760","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
Reflecting Comprehension through French Textual Complexity Factors 通过法语文本复杂性因素反映理解能力
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.97
M. Dascalu, L. L. Stavarache, Stefan Trausan-Matu, Philippe Dessus, Maryse Bianco
{"title":"Reflecting Comprehension through French Textual Complexity Factors","authors":"M. Dascalu, L. L. Stavarache, Stefan Trausan-Matu, Philippe Dessus, Maryse Bianco","doi":"10.1109/ICTAI.2014.97","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.97","url":null,"abstract":"Research efforts in terms of automatic textual complexity analysis are mainly focused on English vocabulary and few adaptations exist for other languages. Starting from a solid base in terms of discourse analysis and existing textual complexity assessment model for English, we introduce a French model trained on 200 documents extracted from school manuals pre-classified into five complexity classes. The underlying textual complexity metrics include surface, syntactic, morphological, semantic and discourse specific factors that are afterwards combined through the use of Support Vector Machines. In the end, each factor is correlated to pupil comprehension metrics scores, spanning throughout multiple classes, therefore creating a clearer perspective in terms of measurements impacting the perceived difficulty of a given text. In addition to purely quantitative surface factors, specific parts of speech and cohesion have proven to be reliable predictors of learners' comprehension level, creating nevertheless a strong background for building dependable French textual complexity models.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121742601","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
Solve a Constraint Problem without Modeling It 在没有建模的情况下解决约束问题
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.12
C. Bessiere, Rémi Coletta, Nadjib Lazaar
{"title":"Solve a Constraint Problem without Modeling It","authors":"C. Bessiere, Rémi Coletta, Nadjib Lazaar","doi":"10.1109/ICTAI.2014.12","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.12","url":null,"abstract":"We study how to find a solution to a constraint problem without modeling it. Constraint acquisition systems such as Conacq or ModelSeeker are not able to solve a single instance of a problem because they require positive examples to learn. The recent QuAcq algorithm for constraint acquisition does not require positive examples to learn a constraint network. It is thus able to solve a constraint problem without modeling it: we simply exit from QuAcq as soon as a complete example is classified as positive by the user. In this paper, we propose ASK&SOLVE, an elicitation-based solver that tries to find the best trade off between learning and solving to converge as soon as possible on a solution. We propose several strategies to speed-up ASK&SOLVE. Finally we give an experimental evaluation that shows that our approach improves the state of the art.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123594823","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
A Minimal Spanning Tree Analysis of EEG Responses to Complex Visual Stimuli 脑电对复杂视觉刺激反应的最小生成树分析
2014 IEEE 26th International Conference on Tools with Artificial Intelligence Pub Date : 2014-11-10 DOI: 10.1109/ICTAI.2014.103
M. Antonakakis, M. Zervakis, Vaso Tsirka, S. Micheloyannis
{"title":"A Minimal Spanning Tree Analysis of EEG Responses to Complex Visual Stimuli","authors":"M. Antonakakis, M. Zervakis, Vaso Tsirka, S. Micheloyannis","doi":"10.1109/ICTAI.2014.103","DOIUrl":"https://doi.org/10.1109/ICTAI.2014.103","url":null,"abstract":"Human brain is the most complicated network and its functional mechanism is a demanding concept in neuroscience research. Graph theory and forms an interesting tool for modeling the brain interactions and estimated brain parameters. In this paper, we consider synchronization features for modeling brain operations in electro-encephalogram (EEG) responses to kanizsa and fractal stimuli, using minimal spanning tree (MST) on a network of phase synchronization EEG channels. Graphs of phase-synchronization activity and MST structures are computed using these graphs. The proposed approach yields evidence that the fractal stimuli generate stronger energy response and synchronization of theta band in occipital lobe.","PeriodicalId":142794,"journal":{"name":"2014 IEEE 26th International Conference on Tools with Artificial Intelligence","volume":"87 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131388080","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
首页 上一页 下一页 尾页
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学术官方微信