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

2012 IEEE 24th International Conference on Tools with Artificial Intelligence最新文献

筛选
英文 中文
Track-Person Association Using a First-Order Probabilistic Model 基于一阶概率模型的轨迹-人关联
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.118
T. Geier, Susanne Biundo-Stephan, Stephan Reuter, K. Dietmayer
{"title":"Track-Person Association Using a First-Order Probabilistic Model","authors":"T. Geier, Susanne Biundo-Stephan, Stephan Reuter, K. Dietmayer","doi":"10.1109/ICTAI.2012.118","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.118","url":null,"abstract":"This work addresses the problem of track association in person tracking. We propose a probabilistic model, based on Markov Logic Networks, that aims at associating the individual tracks emerging from a person tracking algorithm to the correct persons. For this purpose the continuous estimates of the object positions acquired by the tracking algorithm are mapped into discrete spatial regions, which are based on a floor plan of the environment. Experiments show that the described model is able to exploit the additional information contained inside the provided floor plan, and deliver good results compared to a state of the art person tracking algorithm despite the lossy discretization step. We discuss the engineered model in detail and give an empirical evaluation using an indoor setting.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127096964","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
Competence Enhancement for Nearest Neighbor Classification Rule by Ranking-Based Instance Selection 基于排序实例选择的最近邻分类规则能力增强
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.108
C. S. Pereira, George D. C. Cavalcanti
{"title":"Competence Enhancement for Nearest Neighbor Classification Rule by Ranking-Based Instance Selection","authors":"C. S. Pereira, George D. C. Cavalcanti","doi":"10.1109/ICTAI.2012.108","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.108","url":null,"abstract":"This paper introduces a novel prototype selection scheme that decides which instances to preserve using an approach that defines an order to the instances in the data sets. The order of each instance is defined by its relevance to the data set considering the similarity to their nearest eighboors. Scores are assigned to the instances. Instances surrounded by others of the same class have highest scores and have priority in the selection. Experiments performed over several classification problems show that the proposed method reduces the storage requirements and keeps or improves the classification accuracy.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129252090","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
SAT with Global Constraints 具有全局约束的SAT
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.19
Md. Solimul Chowdhury, Jia-Huai You
{"title":"SAT with Global Constraints","authors":"Md. Solimul Chowdhury, Jia-Huai You","doi":"10.1109/ICTAI.2012.19","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.19","url":null,"abstract":"We present a tight integration of SAT with CP, called SAT(gc), which embeds global constraints into SAT. A prototype is implemented by integrating the state of the art SAT solver ZCHAFF and the generic constraint solver GECODE. Experiments are carried out for benchmarks from puzzle domains and planning domains to reveal insights in compact representation, solving effectiveness, and novel usability of the new framework.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"06 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128915561","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
Hybrid Correlational Graphical Models for Reasoning in Detecting Systems 用于检测系统推理的混合关联图模型
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.93
Dongyu Shi, Sufang Xu
{"title":"Hybrid Correlational Graphical Models for Reasoning in Detecting Systems","authors":"Dongyu Shi, Sufang Xu","doi":"10.1109/ICTAI.2012.93","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.93","url":null,"abstract":"Using probabilistic graphical models to deal with uncertainties by modeling relationships among detecting objects is a common method for event detecting systems. However, not all relations are captured accurately by former graphical models. This paper presents a hybrid correlational model for typical abnormal event detecting systems that have correlated objects. It captures the OR relation of multiple influences from different sources of the abnormal event. An algorithm based on message passing is developed for efficient reasoning in the model. Analysis and experiments are provided to compare it with former graphical modeling by results on the detecting objects that lack of local evidence, and by their sensitivity to the occurrence of abnormal event.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"52 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127998697","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
Partial Max-restricted Path Consistency 部分最大限制路径一致性
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.33
Jinsong Guo, Zhanshan Li, Hongbo Li
{"title":"Partial Max-restricted Path Consistency","authors":"Jinsong Guo, Zhanshan Li, Hongbo Li","doi":"10.1109/ICTAI.2012.33","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.33","url":null,"abstract":"Filtering techniques are essential in the search algorithms solving constraint satisfaction problems (CSPs). Arc consistency (AC) is the most often used filtering technique because it cheaply removes some values that cannot belong to any solutions. Comparing with AC, max-Restricted Path Consistency (maxRPC) has a stronger pruning power while it is not suited for use during search because of the prohibitive time cost. Thus, light maxRPC which is the light version of maxRPC was proposed. Comparing with maxRPC, it has a lower time cost and the search algorithm maintaining light maxRPC (MlmaxRPC) can outperform the search algorithm maintaining AC (MAC) on some problems. However, MlmaxRPC suffers from the time waste in the cases that applying a stricter checking standard does not intrigue any value deletion. In order to avoid the time waste in MlmaxRPC, in this paper, partial maxRPC which is a new approximation of maxRPC is proposed. It only applies the stricter checking standard when the value deletion is of high possibility. MpmaxRPC which is the search algorithm maintaining partial maxRPC has a better average performance than MAC and MlmaxRPC.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117335554","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 Transparent and Decentralized Model of Action for Intelligent Virtual Agents 一种透明分散的智能虚拟代理行为模型
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.71
George Anastassakis, T. Panayiotopoulos
{"title":"A Transparent and Decentralized Model of Action for Intelligent Virtual Agents","authors":"George Anastassakis, T. Panayiotopoulos","doi":"10.1109/ICTAI.2012.71","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.71","url":null,"abstract":"Intelligent virtual agent action is a crucial element of any virtual environment application as it essentially brings the environment to life, introduces believability and realism, and enables complex interactions and evolution over time. However, the design and development of mechanisms for virtual agent action is neither a trivial nor a straightforward task. In this paper we present a model of action for virtual agents that meets specific requirements and, as such, can be systematically implemented, can seamlessly and transparently integrate with knowledge representation and intelligent reasoning mechanisms, is highly independent of virtual world implementation specifics, and enables virtual agent portability and reuse.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115423169","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
An Automatic Decomposition Method for Qualitative Spatial and Temporal Reasoning 定性时空推理的自动分解方法
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.84
J. Hué, Matthias Westphal, S. Wölfl
{"title":"An Automatic Decomposition Method for Qualitative Spatial and Temporal Reasoning","authors":"J. Hué, Matthias Westphal, S. Wölfl","doi":"10.1109/ICTAI.2012.84","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.84","url":null,"abstract":"Qualitative spatial and temporal reasoning is a research field that studies relational, constraint-based formalisms for representing, and reasoning about, spatial and temporal information. The standard approach for checking consistency is based on an exhaustive representation of possible configurations between three entities, the so-called composition tables. These tables, however, encode semantic background knowledge in a redundant way, which becomes a size and efficiency issue, when the composition table needs to be grounded as done in SAT encodings of problem instances. % In this paper, we present a new framework that allows for decomposing composition tables into logically simpler parts, while preserving logical equivalence, e.g., the decomposition in start- and end-points for Allen's Interval Calculus. We show that finding such decompositions is an NP-complete problem and present a SAT-based method to generate decompositions. Finally, we discuss the impact of our decomposition method on SAT encodings of problem instances, and present a reasoning system built on decompositions that compares favorably with state-of-the-art solvers.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130640360","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
Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search 同步分布式搜索中弧一致性的异步维护
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.14
M. Wahbi, R. Ezzahir, C. Bessiere, E. Bouyakhf
{"title":"Maintaining Arc Consistency Asynchronously in Synchronous Distributed Search","authors":"M. Wahbi, R. Ezzahir, C. Bessiere, E. Bouyakhf","doi":"10.1109/ICTAI.2012.14","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.14","url":null,"abstract":"We recently proposed No good-Based Asynchronous Forward Checking (AFC-ng), an efficient and robust algorithm for solving Distributed Constraint Satisfaction Problems (DisCSPs). AFC-ng performs an asynchronous forward checking phase during synchronous search. In this paper, we propose two new algorithms based on the same mechanism as AFC-ng. However, instead of using forward checking as a filtering property, we propose to maintain arc consistency asynchronously (MACA). The first algorithm we propose, MACA-del, enforces arc consistency thanks to an additional type of messages, deletion messages. The second algorithm, MACA-not, achieves arc consistency without any new type of message. We provide a theoretical analysis and an experimental evaluation of the proposed approach. Our experiments show the good performance of MACA algorithms, particularly those of MACA-not.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123414336","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
Collective Classification for Sentiment Analysis in Social Networks 面向社会网络情感分析的集体分类
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.135
J. Rabelo, R. Prudêncio, F. Barros
{"title":"Collective Classification for Sentiment Analysis in Social Networks","authors":"J. Rabelo, R. Prudêncio, F. Barros","doi":"10.1109/ICTAI.2012.135","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.135","url":null,"abstract":"The emergence of online social networks has generated an enormous amount of data containing users' opinions about the most varied subjects. Aiming to identify opinion orientation, Sentiment Analysis techniques have been proposed, mainly based on text classification methods. We propose a different perspective to treat this problem, based on a user centric approach. We adopt a graph representation in which nodes represent users and connections represent relationships in a social network. Then, we apply collective classification techniques which use link information to infer opinions of users who have not posted their opinion about the subject under analysis. Preliminary experiments on a Twitter corpus of political preferences have shown promising results.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114758307","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
MP-Draughts: Ordering the Search Tree and Refining the Game Board Representation to Improve a Multi-agent System for Draughts mp -草稿:排序搜索树和精炼游戏棋盘表示以改进草稿的多代理系统
2012 IEEE 24th International Conference on Tools with Artificial Intelligence Pub Date : 2012-11-07 DOI: 10.1109/ICTAI.2012.159
V. Duarte, Rita Maria Silva Julia
{"title":"MP-Draughts: Ordering the Search Tree and Refining the Game Board Representation to Improve a Multi-agent System for Draughts","authors":"V. Duarte, Rita Maria Silva Julia","doi":"10.1109/ICTAI.2012.159","DOIUrl":"https://doi.org/10.1109/ICTAI.2012.159","url":null,"abstract":"In this paper the authors present an extension of the automatic player system MP-Draughts (MultiPhase-Draughts): a self-learning multi-agent environment for draughts composed of 26 Multiple Layer Perceptrons (MLPs). The weights of the MLPs are updated by Temporal Differences (TD). The search for the best move is conducted by a search algorithm based on Alpha-Beta pruning, Iterative Deepening and Table Transposition. One of the agents is trained in such a way that it becomes an expert in the initial stages of play and the remaining (25), in endgame stages. The endgame boards used to train the endgame agents are retrieved from an endgame board database and clustered by a Kohonem-SOM Neural Network (NN). The same Kohonem-SOM NN will also be used during the games to select which endgame agent is more suitable to play each time the endgame stage of play is reached. In this paper the authors propose the following modifications to improve the performance of MP-Draughts: first, to change the mapping of the board states such that, instead of indicating the presence or not of certain features, it indicates the number of elements pointed out by each feature, second, to order the search tree of each agent in such a way as to attenuate the innumerous re-evaluations of the same board state inherent to the iterative deepening strategy.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115156350","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
首页 上一页 下一页 尾页
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学术官方微信