2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology最新文献_第2页

Accuracy vs. Speed: Scalable Entity Coreference on the Semantic Web with On-the-Fly Pruning 准确性与速度:基于动态剪枝的语义网上可扩展实体相互引用

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.24

Dezhao Song, J. Heflin

{"title":"Accuracy vs. Speed: Scalable Entity Coreference on the Semantic Web with On-the-Fly Pruning","authors":"Dezhao Song, J. Heflin","doi":"10.1109/WI-IAT.2012.24","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.24","url":null,"abstract":"One challenge for the Semantic Web is to scalably establish high quality owl: same As links between co referent ontology instances in different data sources, traditional approaches that exhaustively compare every pair of instances do not scale well to large datasets. In this paper, we propose a pruning-based algorithm for reducing the complexity of entity co reference. First, we discard candidate pairs of instances that are not sufficiently similar to the same pool of other instances. A sigmoid function based thresholding method is proposed to automatically adjust the threshold for such commonality on-the-fly. In our prior work, each instance is associated with a context graph consisting of neighboring RDF nodes. In this paper, we speed up the comparison for a single pair of instances by pruning insignificant context in the graph, this is accomplished by evaluating its potential contribution to the final similarity measure. We evaluate our system on three Semantic Web instance categories. We verify the effectiveness of our thresholding and context pruning methods by comparing to nine state-of-the-art systems. We show that our algorithm frequently outperforms those systems with a runtime speedup factor of 18 to 24 while maintaining competitive F1-scores. For datasets of up to 1 million instances, this translates to as much as 370 hours improvement in runtime.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129798464","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

Policy-Based Governance within Luna: Why We Developed Yet Another Agent Framework Luna内部基于策略的治理:为什么我们开发了另一个代理框架

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.272

L. Bunch, J. Bradshaw, T. Eskridge, P. Feltovich, J. Lott, Andrzej Uszok, Marco M. Carvalho

引用次数: 2

Improving Crowdsourcing Efficiency Based on Division Strategy 基于事业部战略的众包效率提升

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.86

Huan Jiang, S. Matsubara

{"title":"Improving Crowdsourcing Efficiency Based on Division Strategy","authors":"Huan Jiang, S. Matsubara","doi":"10.1109/WI-IAT.2012.86","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.86","url":null,"abstract":"This paper examines the efficiency in crowd sourcing, especially crowd sourcing for the software bug detection. Crowd sourcing has recently emerged as a lucrative paradigm for leveraging the collective intelligence of crowds. However, it has inherent weakness that a simple reward setting causes an uneven distribution of workers on each task, which reduces the efficiency of solving the tasks. A challenge is that the system designer is not allowed to set the reward to the arbitrary value because so-called \"market wages\" exist and if the reward is set to the value lower than the market wage, such a task fails to attract the sufficient number of workers. To solve this problem, we focus on the division strategy that divides the crowds into different groups and the workers compete with each other among the same group. We have developed a model that crowds write their codes independently and then try to find bugs in the codes written by the others. Next, we examine two division strategy, random grouping and ability grouping by analyzing the equilibrium behavior of each worker and carrying out simulations. The results show that the division strategy affect the efficiency of crowd sourcing bug detection and the random grouping leads to a higher efficiency compared to the ability grouping.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124517311","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

Abstraction in Model Based Partially Observable Reinforcement Learning Using Extended Sequence Trees 基于扩展序列树的部分可观察模型强化学习抽象

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.161

Erkin Çilden, Faruk Polat

引用次数: 3

RCQ-ACS: RDF Chain Query Optimization Using an Ant Colony System 基于蚁群系统的RDF链查询优化

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.63

A. Hogenboom, Ewout Niewenhuijse, Frederik Hogenboom, F. Frasincar

引用次数: 4

Ontology Based Scope Visualisation 基于本体的范围可视化

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.120

J. Tscherrig, F. Carrino, M. Sokhn, E. Mugellini, Omar Abou Khaled

引用次数: 1

Behavior Abstraction Robustness in Agent Modeling Agent建模中的行为抽象鲁棒性

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.157

Robert Junges, Franziska Klügl-Frohnmeyer

引用次数: 1

Database Keyword Search: A Perspective from Optimization 数据库关键字搜索:一个优化的视角

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.188

Rajvardhan Patil, Zhengxin Chen, Yong Shi

引用次数: 6

Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms 广义分割机制:组合多种防策略机制的框架

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.256

Y. Sakurai, M. Yokoo

{"title":"Generalized Partition Mechanism: Framework for Combining Multiple Strategy-Proof Mechanisms","authors":"Y. Sakurai, M. Yokoo","doi":"10.1109/WI-IAT.2012.256","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.256","url":null,"abstract":"This paper presents a framework for combining multiple strategy-proof resource allocation mechanisms, in which participants are divided into several groups (partitions) and each mechanism is applied to one partition. The idea of dividing participants into several groups is introduced to achieve budget balance in a redistribution mechanism, i.e., the payment (money) collected in one partition is distributed in another partition. Furthermore, this idea has been used to adjust parameters of a mechanism (e.g., the reservation price in an auction) based on the information of participants in one partition in order to improve the mechanism's efficiency or revenue. This paper presents a unified framework called a generalized partition mechanism, in which information, money, and unsold goods can be transferred among partitions. This framework is very general and thus can be applied to various settings, including cases where a redistribution mechanism must adjust parameters to obtain a better social surplus. We provide a sufficient condition on the flow of information, money, and goods among partitions so that the generalized partition mechanism is strategy-proof, assuming that each mechanism applied to the partition is strategy-proof. We can use this sufficient condition as a guideline for combining multiple mechanisms. To show the applicability of this guideline, we develop new redistribution mechanisms based on this guideline, in which the utility of a participant can be non-quasi-linear.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132129930","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

Proactive Control Method Based on System Margin in Evolutional Agent System 进化智能体系统中基于系统边际的主动控制方法

2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology Pub Date : 2012-12-04 DOI: 10.1109/WI-IAT.2012.201

Akiko Takahashi, Mitsuru Abe, Wenpeng Wei, Tetsuo Kinoshita

引用次数: 3