首页 > 最新文献

2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology最新文献

英文 中文
Modeling and Validation of Biased Human Trust 人类偏见信任的建模与验证
M. Hoogendoorn, S. W. Jaffry, P. V. Maanen, Jan Treur
When considering intelligent agents that interact with humans, having an idea of the trust levels of the human, for example in other agents or services, can be of great importance. Most models of human trust that exist, are based on some rationality assumption, and biased behavior is not represented, whereas a vast literature in Cognitive and Social Sciences indicates that humans often exhibit non-rational, biased behavior with respect to trust. This paper reports how some variations of biased human trust models have been designed, analyzed and validated against empirical data. The results show that such biased trust models are able to predict human trust significantly better.
在考虑与人类交互的智能代理时,了解人类的信任级别(例如在其他代理或服务中的信任级别)可能非常重要。大多数存在的人类信任模型都是基于一些理性假设,偏见行为没有得到体现,而认知和社会科学领域的大量文献表明,人类在信任方面经常表现出非理性、偏见的行为。本文报告了如何根据经验数据设计、分析和验证有偏见的人类信任模型的一些变化。结果表明,这种有偏见的信任模型能够更好地预测人类的信任。
{"title":"Modeling and Validation of Biased Human Trust","authors":"M. Hoogendoorn, S. W. Jaffry, P. V. Maanen, Jan Treur","doi":"10.1109/WI-IAT.2011.198","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.198","url":null,"abstract":"When considering intelligent agents that interact with humans, having an idea of the trust levels of the human, for example in other agents or services, can be of great importance. Most models of human trust that exist, are based on some rationality assumption, and biased behavior is not represented, whereas a vast literature in Cognitive and Social Sciences indicates that humans often exhibit non-rational, biased behavior with respect to trust. This paper reports how some variations of biased human trust models have been designed, analyzed and validated against empirical data. The results show that such biased trust models are able to predict human trust significantly better.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133789868","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}
引用次数: 13
Strategic Behavior in Interaction Selection and Contact Selection 互动选择与接触选择中的策略行为
Björn-Oliver Hartmann, Klemens Böhm, Christian Hütter
Social search platforms like Aardvark or Yahoo Answers have attracted a lot of attention lately. In principle, participants have two strategic dimensions in social search systems: (1) Interaction selection, i.e., forwarding/processing incoming requests (or not), and (2) contact selection, i.e., adding or dropping contacts. In systems with these strategic dimensions, it is unclear whether nodes cooperate, and if they form efficient network structures. To shed light on this fundamental question, we have conducted a study to investigate human behavior in interaction selection and to investigate the ability of humans to form efficient networks. In order to limit the degree of problem understanding necessary by the study participants, we have introduced the problem as an online game. 193 subjects joined the study that was online for 67 days. One result is that subjects choose contacts strategically and that they use strategies that lead to cooperative and almost efficient systems. Surprisingly, subjects tend to overestimate the value of cooperative contacts and keep cooperative but costly contacts. This observation is important: Assisting agents that help subjects to avoid this behavior might yield more efficiency.
像Aardvark或Yahoo Answers这样的社交搜索平台最近吸引了很多关注。原则上,参与者在社交搜索系统中有两个战略维度:(1)交互选择,即转发/处理(或不转发)传入请求;(2)联系人选择,即添加或删除联系人。在具有这些战略维度的系统中,尚不清楚节点是否合作,以及它们是否形成有效的网络结构。为了阐明这个基本问题,我们进行了一项研究,调查人类在互动选择中的行为,并调查人类形成有效网络的能力。为了限制研究参与者对问题的必要理解程度,我们将问题作为在线游戏引入。193名受试者参加了为期67天的在线研究。结果之一是,实验对象策略性地选择联系人,他们使用的策略会导致合作和几乎高效的系统。令人惊讶的是,被试倾向于高估合作联系的价值,并保持合作但代价高昂的联系。这个观察结果很重要:帮助被试避免这种行为的代理可能会产生更高的效率。
{"title":"Strategic Behavior in Interaction Selection and Contact Selection","authors":"Björn-Oliver Hartmann, Klemens Böhm, Christian Hütter","doi":"10.1109/WI-IAT.2011.23","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.23","url":null,"abstract":"Social search platforms like Aardvark or Yahoo Answers have attracted a lot of attention lately. In principle, participants have two strategic dimensions in social search systems: (1) Interaction selection, i.e., forwarding/processing incoming requests (or not), and (2) contact selection, i.e., adding or dropping contacts. In systems with these strategic dimensions, it is unclear whether nodes cooperate, and if they form efficient network structures. To shed light on this fundamental question, we have conducted a study to investigate human behavior in interaction selection and to investigate the ability of humans to form efficient networks. In order to limit the degree of problem understanding necessary by the study participants, we have introduced the problem as an online game. 193 subjects joined the study that was online for 67 days. One result is that subjects choose contacts strategically and that they use strategies that lead to cooperative and almost efficient systems. Surprisingly, subjects tend to overestimate the value of cooperative contacts and keep cooperative but costly contacts. This observation is important: Assisting agents that help subjects to avoid this behavior might yield more efficiency.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134100145","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
Towards Collaborative Metadata Enrichment for Adaptive Web-Based Learning 面向自适应网络学习的协同元数据充实
Róbert Móro, Ivan Srba, Maros Uncík, M. Bieliková, Marián Simko
In recent years we have witnessed expansion of Web 2.0. Its main feature is allowing users' collaboration in content creation using various means, e.g. annotations, discussions, wikis, blogs or tags. This approach has influenced also web-based learning, for which the term "Learning 2.0" has been introduced. In this paper we explore using tags in such systems. Tags can be used for improving of searching, categorization of web-documents, creating folksonomies and ontologies or enhancing the user-model. Another aspect of tags is that they act as a bridge between resources and users to create a social network. We integrated tags in a learning framework ALEF and experimentally evaluated their usage in education process.
近年来,我们见证了Web 2.0的扩展。它的主要特点是允许用户通过各种方式协作创建内容,例如注释、讨论、wiki、博客或标签。这种方法也影响了基于网络的学习,为此引入了术语“学习2.0”。在本文中,我们探索在这样的系统中使用标签。标签可用于改进搜索、web文档的分类、创建大众分类法和本体或增强用户模型。标签的另一个方面是它们作为资源和用户之间的桥梁来创建一个社交网络。我们将标签整合到一个学习框架ALEF中,并通过实验评估了标签在教育过程中的使用情况。
{"title":"Towards Collaborative Metadata Enrichment for Adaptive Web-Based Learning","authors":"Róbert Móro, Ivan Srba, Maros Uncík, M. Bieliková, Marián Simko","doi":"10.1109/WI-IAT.2011.220","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.220","url":null,"abstract":"In recent years we have witnessed expansion of Web 2.0. Its main feature is allowing users' collaboration in content creation using various means, e.g. annotations, discussions, wikis, blogs or tags. This approach has influenced also web-based learning, for which the term \"Learning 2.0\" has been introduced. In this paper we explore using tags in such systems. Tags can be used for improving of searching, categorization of web-documents, creating folksonomies and ontologies or enhancing the user-model. Another aspect of tags is that they act as a bridge between resources and users to create a social network. We integrated tags in a learning framework ALEF and experimentally evaluated their usage in education process.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130321450","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
Problems and Countermeasures for Disaster Reduction in China's Remote Rural Areas 中国偏远农村地区减灾面临的问题与对策
Ning Wang, Hongyu Huang, Yanzhang Wang, Hui Li, Liming Li
In front of various disasters, the remote rural areas of China appear to be more vulnerable. Because of lacking sufficient attention, disaster reduction in these areas has become the short board of the disaster prevention and reduction system in china. Therefore, this paper lays special stress on analyzing the causes that giving rise to this phenomenon, and the deficiencies in execution, and then proposes some practicable ways to change this situation.
在各种灾害面前,中国偏远的农村地区显得更加脆弱。由于缺乏足够的重视,这些地区的减灾已成为中国防灾减灾系统的短板。因此,本文着重分析了造成这一现象的原因和执行中存在的不足,并提出了一些切实可行的改变这一现状的途径。
{"title":"Problems and Countermeasures for Disaster Reduction in China's Remote Rural Areas","authors":"Ning Wang, Hongyu Huang, Yanzhang Wang, Hui Li, Liming Li","doi":"10.1109/WI-IAT.2011.91","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.91","url":null,"abstract":"In front of various disasters, the remote rural areas of China appear to be more vulnerable. Because of lacking sufficient attention, disaster reduction in these areas has become the short board of the disaster prevention and reduction system in china. Therefore, this paper lays special stress on analyzing the causes that giving rise to this phenomenon, and the deficiencies in execution, and then proposes some practicable ways to change this situation.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115564880","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
Merging and Re-ranking Answers from Distributed Multiple Web Sources 合并和重新排序来自分布式多个Web源的答案
Hyo-Jung Oh, Jeong Hur, C. Lee, Pum-Mo Ryu, Y. Yoon, Hyunki Kim
Depending on questions, various answering methods and answer sources can be used. In this paper, we build a distributed QA system to handle different types of questions and web sources. When a user question is entered, the broker distributes the question over multiple sub-QAs according to question types. The selected sub-QAs find local optimal candidate answers, and then they are collected in to the answer manager. The merged candidates are re-ranked by adjusting confidence weights based on the question analysis result. The re-ranking algorithm aims to find global optimal answers. We borrow the concept from the margin and slack variables in SVM, and modify to project confidence weights into the same boundary by training. Several experimental results prove reliability of our proposed QA model.
根据问题的不同,可以使用不同的回答方法和答案来源。在本文中,我们构建了一个分布式QA系统来处理不同类型的问题和web资源。当输入用户问题时,代理根据问题类型将问题分发到多个子问答中。选择的子问答找到局部最优候选答案,然后将其收集到答案管理器中。根据问题分析结果调整置信度权重,对合并后的考生进行重新排序。重新排序算法的目的是寻找全局最优答案。我们借鉴了支持向量机中裕度变量和松弛变量的概念,并修改为通过训练将置信度权重投影到同一边界。几个实验结果证明了我们提出的质量保证模型的可靠性。
{"title":"Merging and Re-ranking Answers from Distributed Multiple Web Sources","authors":"Hyo-Jung Oh, Jeong Hur, C. Lee, Pum-Mo Ryu, Y. Yoon, Hyunki Kim","doi":"10.1109/WI-IAT.2011.139","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.139","url":null,"abstract":"Depending on questions, various answering methods and answer sources can be used. In this paper, we build a distributed QA system to handle different types of questions and web sources. When a user question is entered, the broker distributes the question over multiple sub-QAs according to question types. The selected sub-QAs find local optimal candidate answers, and then they are collected in to the answer manager. The merged candidates are re-ranked by adjusting confidence weights based on the question analysis result. The re-ranking algorithm aims to find global optimal answers. We borrow the concept from the margin and slack variables in SVM, and modify to project confidence weights into the same boundary by training. Several experimental results prove reliability of our proposed QA model.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114809973","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
Exploring the Community Set Space 探索社区集合空间
J. Scripps
This paper presents the community set space canvas, a triangular canvas where the results of community finding algorithms can be plotted for comparison. The points of the triangle represent trivial sets, such as the set of one large community, and the edges are populated by well known set types, such as disjoint communities.
本文提出了社区集合空间画布,一个三角形的画布,可以在其中绘制社区查找算法的结果以进行比较。三角形的点表示平凡的集合,比如一个大群落的集合,而边则由已知的集合类型填充,比如不相交的群落。
{"title":"Exploring the Community Set Space","authors":"J. Scripps","doi":"10.1109/WI-IAT.2011.75","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.75","url":null,"abstract":"This paper presents the community set space canvas, a triangular canvas where the results of community finding algorithms can be plotted for comparison. The points of the triangle represent trivial sets, such as the set of one large community, and the edges are populated by well known set types, such as disjoint communities.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114402654","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}
引用次数: 8
Diversifying Product Review Rankings: Getting the Full Picture 多样化的产品评论排名:全面了解情况
Ralf Krestel, Nima Dokoohaki
E-commerce Web sites owe much of their popularity to consumer reviews provided together with product descriptions. On-line customers spend hours and hours going through heaps of textual reviews to build confidence in products they are planning to buy. At the same time, popular products have thousands of user-generated reviews. Current approaches to present them to the user or recommend an individual review for a product are based on the helpfulness or usefulness of each review. In this paper we look at the top-k reviews in a ranking to give a good summary to the user with each review complementing the others. To this end we use Latent Dirichlet Allocation to detect latent topics within reviews and make use of the assigned star rating for the product as an indicator of the polarity expressed towards the product and the latent topics within the review. We present a framework to cover different ranking strategies based on theuser's need: Summarizing all reviews, focus on a particular latent topic, or focus on positive, negative or neutral aspects. We evaluated the system using manually annotated review data from a commercial review Web site.
电子商务网站的流行很大程度上要归功于消费者的评论和产品描述。在线消费者花费数小时阅读大量的文字评论,以建立对他们计划购买的产品的信心。与此同时,受欢迎的产品有成千上万的用户评论。当前向用户展示它们或推荐单个产品评论的方法是基于每个评论的帮助或有用性。在本文中,我们查看排名中的前k条评论,以便为用户提供一个很好的总结,每个评论都可以补充其他评论。为此,我们使用潜在狄利克雷分配来检测评论中的潜在主题,并利用分配给产品的星级评级作为对产品和评论中潜在主题表达的极性的指标。我们提出了一个框架来涵盖基于用户需求的不同排名策略:总结所有评论,关注特定潜在主题,或关注积极,消极或中性方面。我们使用来自商业评论网站的人工注释的评论数据来评估系统。
{"title":"Diversifying Product Review Rankings: Getting the Full Picture","authors":"Ralf Krestel, Nima Dokoohaki","doi":"10.1109/WI-IAT.2011.33","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.33","url":null,"abstract":"E-commerce Web sites owe much of their popularity to consumer reviews provided together with product descriptions. On-line customers spend hours and hours going through heaps of textual reviews to build confidence in products they are planning to buy. At the same time, popular products have thousands of user-generated reviews. Current approaches to present them to the user or recommend an individual review for a product are based on the helpfulness or usefulness of each review. In this paper we look at the top-k reviews in a ranking to give a good summary to the user with each review complementing the others. To this end we use Latent Dirichlet Allocation to detect latent topics within reviews and make use of the assigned star rating for the product as an indicator of the polarity expressed towards the product and the latent topics within the review. We present a framework to cover different ranking strategies based on theuser's need: Summarizing all reviews, focus on a particular latent topic, or focus on positive, negative or neutral aspects. We evaluated the system using manually annotated review data from a commercial review Web site.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117273770","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}
引用次数: 28
Leveraging Network Properties for Trust Evaluation in Multi-agent Systems 利用网络属性进行多智能体系统信任评估
Xi Wang, M. Maghami, G. Sukthankar
In this paper, we present a collective classification approach for identifying untrustworthy individuals in multi-agent communities from a combination of observable features and network connections. Under the assumption that data are organized as independent and identically distributed (i.i.d.)samples, traditional classification is typically performed on each object independently, without considering the underlying network connecting the instances. In collective classification, a set of relational features, based on the connections between instances, is used to augment the feature vector used in classification. This approach can perform particularly well when the underlying data exhibits homophily, a propensity for similar items to be connected. We suggest that in many cases human communities exhibit homophily in trust levels since shared attitudes toward trust can facilitate the formation and maintenance of bonds, in the same way that other types of shared beliefs and value systems do. Hence, knowledge of an agent's connections provides a valuable cue that can assist in the identification of untrustworthy individuals who are misrepresenting themselves by modifying their observable information. This paper presents results that demonstrate that our proposed trust evaluation method is robust in cases where a large percentage of the individuals present misleading information.
在本文中,我们提出了一种集体分类方法,用于从可观察特征和网络连接的组合中识别多智能体社区中不可信的个体。在假设数据被组织为独立且同分布(i.i.d)的样本的情况下,传统的分类通常是独立地对每个对象执行分类,而不考虑连接实例的底层网络。在集体分类中,基于实例之间的联系,使用一组关系特征来增强分类中使用的特征向量。当底层数据表现出同质性时,这种方法可以执行得特别好,同质性是指相似的项目被连接起来的倾向。我们认为,在许多情况下,人类社区在信任水平上表现出同质性,因为对信任的共同态度可以促进纽带的形成和维持,就像其他类型的共同信念和价值体系一样。因此,对一个代理的连接的了解提供了一个有价值的线索,可以帮助识别不值得信任的个体,这些个体通过修改他们的可观察信息来歪曲自己。本文给出的结果表明,我们提出的信任评估方法在很大比例的个人提供误导性信息的情况下是鲁棒的。
{"title":"Leveraging Network Properties for Trust Evaluation in Multi-agent Systems","authors":"Xi Wang, M. Maghami, G. Sukthankar","doi":"10.1109/WI-IAT.2011.217","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.217","url":null,"abstract":"In this paper, we present a collective classification approach for identifying untrustworthy individuals in multi-agent communities from a combination of observable features and network connections. Under the assumption that data are organized as independent and identically distributed (i.i.d.)samples, traditional classification is typically performed on each object independently, without considering the underlying network connecting the instances. In collective classification, a set of relational features, based on the connections between instances, is used to augment the feature vector used in classification. This approach can perform particularly well when the underlying data exhibits homophily, a propensity for similar items to be connected. We suggest that in many cases human communities exhibit homophily in trust levels since shared attitudes toward trust can facilitate the formation and maintenance of bonds, in the same way that other types of shared beliefs and value systems do. Hence, knowledge of an agent's connections provides a valuable cue that can assist in the identification of untrustworthy individuals who are misrepresenting themselves by modifying their observable information. This paper presents results that demonstrate that our proposed trust evaluation method is robust in cases where a large percentage of the individuals present misleading information.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115785377","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}
引用次数: 16
Classification Based on Specific Vocabulary 基于特定词汇的分类
J. Savoy, Olena Zubaryeva
Assuming a binomial distribution for word occurrence, we propose computing a standardized Z score to define the specific vocabulary of a subset compared to that of the entire corpus. This approach is applied to weight terms characterizing a document (or a sample of texts). We then show how these Z score values can be used to derive an efficient categorization scheme. To evaluate this proposition we categorize speeches given by B. Obama as either electoral or presidential. The results tend to show that the suggested classification scheme performs better than a Support Vector Machine scheme, and a Naive Bayes classifier (10-fold cross validation).
假设单词出现的二项分布,我们建议计算一个标准化的Z分数来定义一个子集与整个语料库的特定词汇。这种方法应用于描述文档(或文本样本)的权重项。然后,我们将展示如何使用这些Z分数值来推导有效的分类方案。为了评价这一命题,我们将B.奥巴马的演讲分为选举演讲和总统演讲。结果表明,建议的分类方案优于支持向量机方案和朴素贝叶斯分类器(10倍交叉验证)。
{"title":"Classification Based on Specific Vocabulary","authors":"J. Savoy, Olena Zubaryeva","doi":"10.1109/WI-IAT.2011.19","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.19","url":null,"abstract":"Assuming a binomial distribution for word occurrence, we propose computing a standardized Z score to define the specific vocabulary of a subset compared to that of the entire corpus. This approach is applied to weight terms characterizing a document (or a sample of texts). We then show how these Z score values can be used to derive an efficient categorization scheme. To evaluate this proposition we categorize speeches given by B. Obama as either electoral or presidential. The results tend to show that the suggested classification scheme performs better than a Support Vector Machine scheme, and a Naive Bayes classifier (10-fold cross validation).","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115903044","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
Cognitive Resource Aware Service Provisioning 认知资源感知服务发放
A. Molina, In-Young Ko
The vision of spontaneously delivering ubiquitous services to mobile users stands on the tradition of reflecting functional and non-functional requirements. Nevertheless, existing approaches do not reason in advance about the potential conflicts of mobility activities with human-computer interaction based tasks. These conflicts may burden the user with unexpected interruptions that overload the central human-cognitive capacity. This paper introduces a novel cognitive engineering mechanism to optimize service functionality co ordinations during runtime in accordance with situational demands of cognitive resources. We base our resource aware approach for service coordination optimization on two theories from cognitive psychology -- the human-processing system theory of Navon and the multiple resource theory of Wickens. On top of this psychological background, we introduce a specific mechanism for varying service co ordinations.
自发地向移动用户提供无处不在的服务的愿景基于反映功能和非功能需求的传统。然而,现有的方法并没有提前推理出移动活动与基于人机交互的任务之间的潜在冲突。这些冲突可能会给用户带来意想不到的中断,从而使人类的核心认知能力超负荷。本文介绍了一种新的认知工程机制,根据认知资源的情景需求,优化运行时服务功能协调。我们的服务协调优化资源感知方法基于两种认知心理学理论——纳文的人类处理系统理论和威肯斯的多重资源理论。在这种心理背景之上,我们引入了一种特定的机制,用于不同的服务协调。
{"title":"Cognitive Resource Aware Service Provisioning","authors":"A. Molina, In-Young Ko","doi":"10.1109/WI-IAT.2011.251","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.251","url":null,"abstract":"The vision of spontaneously delivering ubiquitous services to mobile users stands on the tradition of reflecting functional and non-functional requirements. Nevertheless, existing approaches do not reason in advance about the potential conflicts of mobility activities with human-computer interaction based tasks. These conflicts may burden the user with unexpected interruptions that overload the central human-cognitive capacity. This paper introduces a novel cognitive engineering mechanism to optimize service functionality co ordinations during runtime in accordance with situational demands of cognitive resources. We base our resource aware approach for service coordination optimization on two theories from cognitive psychology -- the human-processing system theory of Navon and the multiple resource theory of Wickens. On top of this psychological background, we introduce a specific mechanism for varying service co ordinations.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"29 18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116273018","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
期刊
2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1