首页 > 最新文献

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

英文 中文
Generating Personalized Summaries Using Publicly Available Web Documents 使用公开可用的网络文档生成个性化摘要
Chandan Kumar, Prasad Pingali, Vasudeva Varma
Many knowledge workers are increasingly using online resources to find out latest developments in their specialty and articles of interest. To extract relevant information from such multiple online information sources summarization is being used. Current summarization systems produce a uniform version of summary for all users. However summaries which are generic in nature do not cater to the userpsilas background and interests. In this paper we propose to make the summarization process user specific and present a design for generating personalized summaries of online articles that are tailored to each personpsilas interest. The userpsilas data available on Web is used for model their background and interest. A controlled user-centered qualitative evaluation carried out on news articles of science and technology domain, indicates better user satisfaction with personalized summaries compared to generic summaries.
许多知识工作者越来越多地使用在线资源来查找他们的专业和感兴趣的文章的最新发展。为了从这样的多个在线信息源中提取相关信息,采用了摘要的方法。当前的摘要系统为所有用户生成统一版本的摘要。然而,一般性质的摘要不符合用户的背景和兴趣。在本文中,我们建议使摘要过程针对用户,并提出了一种针对每个人的兴趣定制的在线文章的个性化摘要的设计。Web上可用的用户数据用于建模他们的背景和兴趣。对科技领域的新闻文章进行了一项受控的以用户为中心的定性评价,结果表明个性化摘要的用户满意度高于通用摘要。
{"title":"Generating Personalized Summaries Using Publicly Available Web Documents","authors":"Chandan Kumar, Prasad Pingali, Vasudeva Varma","doi":"10.1109/WIIAT.2008.332","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.332","url":null,"abstract":"Many knowledge workers are increasingly using online resources to find out latest developments in their specialty and articles of interest. To extract relevant information from such multiple online information sources summarization is being used. Current summarization systems produce a uniform version of summary for all users. However summaries which are generic in nature do not cater to the userpsilas background and interests. In this paper we propose to make the summarization process user specific and present a design for generating personalized summaries of online articles that are tailored to each personpsilas interest. The userpsilas data available on Web is used for model their background and interest. A controlled user-centered qualitative evaluation carried out on news articles of science and technology domain, indicates better user satisfaction with personalized summaries compared to generic summaries.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122037915","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}
引用次数: 19
Partner Selection Mechanisms for Agent Cooperation 代理合作的伙伴选择机制
Toktam Ebadi, Maryam A. Purvis, M. Purvis
In a multi-agent system, a single agent may not be capable of completing complex tasks. Therefore agents are required to form a team to fulfill the task requirements. In this paper an agent model is introduced that facilitates cooperation among agents. A multi-threaded multi-agent simulation framework is designed to test the model. The experimental results demonstrate that the model is significantly useful in achieving cooperation under various environmental constraints. It also allows agents to adjust their teammate selection strategies according to environmental constraints.
在多智能体系统中,单个智能体可能无法完成复杂的任务。因此需要agent组成一个团队来完成任务需求。本文介绍了一种促进agent间合作的agent模型。设计了一个多线程多智能体仿真框架对该模型进行测试。实验结果表明,该模型对实现各种环境约束下的合作具有显著的实用价值。它还允许代理根据环境约束调整他们的队友选择策略。
{"title":"Partner Selection Mechanisms for Agent Cooperation","authors":"Toktam Ebadi, Maryam A. Purvis, M. Purvis","doi":"10.1109/WIIAT.2008.294","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.294","url":null,"abstract":"In a multi-agent system, a single agent may not be capable of completing complex tasks. Therefore agents are required to form a team to fulfill the task requirements. In this paper an agent model is introduced that facilitates cooperation among agents. A multi-threaded multi-agent simulation framework is designed to test the model. The experimental results demonstrate that the model is significantly useful in achieving cooperation under various environmental constraints. It also allows agents to adjust their teammate selection strategies according to environmental constraints.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123572817","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
Identifying Opinion Leaders in BBS 识别BBS中的意见领袖
Zhongwu Zhai, Hua Xu, P. Jia
Opinion leaders play a very important role in information diffusion; they are found in all fields of society and influence the opinions of the masses in their fields. Most proposed algorithms on identifying opinion leaders in Internet social network are global measure algorithms and usually omit the fact that opinion leaders are field-limited. We propose and test several algorithms, including interest-field based algorithms and global measure algorithms, to identify opinion leaders in BBS. Our experiments show that different algorithms are sensitive to different indicators; the interest-field based algorithms which not only take into account of the social networkspsila structure but also the userspsila interest space are more reasonable and effective in identifying opinion leaders in BBS. The interest-field based algorithms are sensitive to the high status nodes in the social network, and their performance relies on the quality of field discovery.
意见领袖在信息传播中起着非常重要的作用;他们存在于社会的各个领域,并影响着各自领域内群众的意见。目前提出的网络社交网络意见领袖识别算法大多是全局度量算法,通常忽略了意见领袖具有域限制的事实。我们提出并测试了几种算法,包括基于兴趣域的算法和全局度量算法,以识别BBS中的意见领袖。我们的实验表明,不同的算法对不同的指标敏感;基于兴趣场的算法既考虑了社交网络的结构,又考虑了用户的兴趣空间,在论坛意见领袖识别中更为合理和有效。基于兴趣场的算法对社交网络中的高地位节点敏感,其性能依赖于兴趣场发现的质量。
{"title":"Identifying Opinion Leaders in BBS","authors":"Zhongwu Zhai, Hua Xu, P. Jia","doi":"10.1109/WIIAT.2008.37","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.37","url":null,"abstract":"Opinion leaders play a very important role in information diffusion; they are found in all fields of society and influence the opinions of the masses in their fields. Most proposed algorithms on identifying opinion leaders in Internet social network are global measure algorithms and usually omit the fact that opinion leaders are field-limited. We propose and test several algorithms, including interest-field based algorithms and global measure algorithms, to identify opinion leaders in BBS. Our experiments show that different algorithms are sensitive to different indicators; the interest-field based algorithms which not only take into account of the social networkspsila structure but also the userspsila interest space are more reasonable and effective in identifying opinion leaders in BBS. The interest-field based algorithms are sensitive to the high status nodes in the social network, and their performance relies on the quality of field discovery.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123382588","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}
引用次数: 47
Indexing Method for Transitive Relationships of Product Information 产品信息传递关系的索引方法
Hyunja Lee, Junho Shim
For successfully using a RDBMS as repository for the product information, it is essential that the ontological query be processed efficiently and answered properly on RDBMS. The key point of well processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. Especially, the transitive relationships (i.e. ISA, component-of relationships, etc.) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. To processing the queries over transitive relationships, we suggest the efficient index using the numbering schemes.
为了成功地使用RDBMS作为产品信息的存储库,必须在RDBMS上有效地处理本体查询并正确地回答。处理好本体论查询的关键是产品本体论概念之间的各种语义关系是否同样处理好。特别是,必须成功处理祖先-后代、父母-孩子和产品分类等传递关系(即ISA、组件-关系等)。为了处理传递关系的查询,我们建议使用编号方案进行高效索引。
{"title":"Indexing Method for Transitive Relationships of Product Information","authors":"Hyunja Lee, Junho Shim","doi":"10.1109/WIIAT.2008.190","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.190","url":null,"abstract":"For successfully using a RDBMS as repository for the product information, it is essential that the ontological query be processed efficiently and answered properly on RDBMS. The key point of well processing the ontological queries is whether the various semantic relationships among the concepts of the product ontology are likewise well-processed. Especially, the transitive relationships (i.e. ISA, component-of relationships, etc.) such as ancestors-descendents, parents-children, and taxonomy of products must be processed successfully. To processing the queries over transitive relationships, we suggest the efficient index using the numbering schemes.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"8 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123612081","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
Predicting News Story Importance Using Language Features 用语言特征预测新闻故事的重要性
Ralf Krestel, B. Mehta
In this age of awareness, people have access to information like never before. Hundreds of newspapers and millions of bloggers present news and their interpretations in an openly accessible manner. With globalization, distant events can have impact on people thousands of miles away. While expert humans can recognize a potentially important piece of news, this is still a difficult problem for an automatic system. Since people are increasingly relying on multiple online sources of information, it is important to support users in filtering news automatically. In this work, we consider the problem of anticipating news story importance, i.e. given a news item, predicting if it will be of interest for a majority of users. Such ranking is currently done manually for newspapers, and we explore automatic approaches and indicative features for the same. Our main conclusion is that importance prediction is a hard problem, and pure textual features are not sufficient for classifiers with 90% accuracy.
在这个意识的时代,人们可以获得前所未有的信息。数以百计的报纸和数以百万计的博客以一种开放的方式呈现新闻和他们的解释。随着全球化的发展,遥远的事件可以对千里之外的人们产生影响。虽然专家可以识别出一条潜在的重要新闻,但对于自动系统来说,这仍然是一个难题。由于人们越来越依赖多种在线信息来源,因此支持用户自动过滤新闻非常重要。在这项工作中,我们考虑了预测新闻故事重要性的问题,即给定一个新闻项目,预测它是否会引起大多数用户的兴趣。目前,报纸的排名是手动完成的,我们将探索自动方法和指示性特征。我们的主要结论是,重要性预测是一个难题,单纯的文本特征对于准确率达到90%的分类器来说是不够的。
{"title":"Predicting News Story Importance Using Language Features","authors":"Ralf Krestel, B. Mehta","doi":"10.1109/WIIAT.2008.193","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.193","url":null,"abstract":"In this age of awareness, people have access to information like never before. Hundreds of newspapers and millions of bloggers present news and their interpretations in an openly accessible manner. With globalization, distant events can have impact on people thousands of miles away. While expert humans can recognize a potentially important piece of news, this is still a difficult problem for an automatic system. Since people are increasingly relying on multiple online sources of information, it is important to support users in filtering news automatically. In this work, we consider the problem of anticipating news story importance, i.e. given a news item, predicting if it will be of interest for a majority of users. Such ranking is currently done manually for newspapers, and we explore automatic approaches and indicative features for the same. Our main conclusion is that importance prediction is a hard problem, and pure textual features are not sufficient for classifiers with 90% accuracy.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"58 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124351812","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
Structured Learning of Component Dependencies in AmI Systems AmI系统中组件依赖关系的结构化学习
Todor Dimitrov, J. Pauli, E. Naroska, C. Ressel
As information and communication technologies are becoming an integral part of our homes, the demand for AmI systems with assistive functionality is increasing. A great effort has been spent on designing and building interoperable middleware solutions to be used as the basis for such system. What is called for, though, is a clear direction in the way uncertainty about acquired knowledge is learnt and employed. This paper presents a probabilistic framework for learning dependencies between components within a home environment. In our approach, the uncertainty is maintained in a probabilistic knowledge base which is automatically built from semantic descriptions and observations of device states and events. The knowledge base can be used by smart applications for performing reasoning about the current flow of system events. Furthermore, some preliminary results obtained from real world data are presented.
随着信息和通信技术成为我们家庭不可或缺的一部分,对具有辅助功能的AmI系统的需求正在增加。在设计和构建可互操作的中间件解决方案以作为此类系统的基础上已经花费了大量的精力。然而,我们需要的是一个明确的方向,即如何学习和利用已获得知识的不确定性。本文提出了一个用于学习家庭环境中组件之间依赖关系的概率框架。在我们的方法中,不确定性维持在一个概率知识库中,该知识库是根据设备状态和事件的语义描述和观察自动建立的。智能应用程序可以使用知识库来执行关于当前系统事件流的推理。此外,还给出了从实际数据中得到的一些初步结果。
{"title":"Structured Learning of Component Dependencies in AmI Systems","authors":"Todor Dimitrov, J. Pauli, E. Naroska, C. Ressel","doi":"10.1109/WIIAT.2008.13","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.13","url":null,"abstract":"As information and communication technologies are becoming an integral part of our homes, the demand for AmI systems with assistive functionality is increasing. A great effort has been spent on designing and building interoperable middleware solutions to be used as the basis for such system. What is called for, though, is a clear direction in the way uncertainty about acquired knowledge is learnt and employed. This paper presents a probabilistic framework for learning dependencies between components within a home environment. In our approach, the uncertainty is maintained in a probabilistic knowledge base which is automatically built from semantic descriptions and observations of device states and events. The knowledge base can be used by smart applications for performing reasoning about the current flow of system events. Furthermore, some preliminary results obtained from real world data are presented.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"279 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121366352","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
Exception Mining on Multiple Time Series in Stock Market 股票市场多时间序列的异常挖掘
C. Luo, Yanchang Zhao, Longbing Cao, Yuming Ou, Chengqi Zhang
This paper presents our research on exception mining on multiple time series data which aims to assist stock market surveillance by identifying market anomalies. Traditional technologies on stock market surveillance have shown their limitations to handle large amount of complicated stock market data. In our research, the outlier mining on multiple time series (OMM) is proposed to improve the effectiveness of exception detection for stock market surveillance. The idea of our research is presented, challenges on the research are analyzed, and potential research directions are summarized.
本文介绍了对多时间序列数据进行异常挖掘的研究,旨在通过识别市场异常来辅助股票市场监控。传统的股市监测技术在处理大量复杂的股市数据时已经显示出其局限性。在我们的研究中,提出了多时间序列的异常值挖掘(OMM),以提高股票市场监控异常检测的有效性。提出了本文的研究思路,分析了研究面临的挑战,总结了可能的研究方向。
{"title":"Exception Mining on Multiple Time Series in Stock Market","authors":"C. Luo, Yanchang Zhao, Longbing Cao, Yuming Ou, Chengqi Zhang","doi":"10.1109/WIIAT.2008.302","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.302","url":null,"abstract":"This paper presents our research on exception mining on multiple time series data which aims to assist stock market surveillance by identifying market anomalies. Traditional technologies on stock market surveillance have shown their limitations to handle large amount of complicated stock market data. In our research, the outlier mining on multiple time series (OMM) is proposed to improve the effectiveness of exception detection for stock market surveillance. The idea of our research is presented, challenges on the research are analyzed, and potential research directions are summarized.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124267713","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
A Development Framework for Mobile User-Interfaces Based on HTML Centric Dependency Injection 基于HTML中心依赖注入的移动用户界面开发框架
Takashi Nozawa, Hajime Hotta, M. Hagiwara
While the use of mobile Web contents has shown a considerable increase, most of these contents, which are written in HTML format, are not convenient enough to use. Even though rich user-interfaces can be developed using some technologies like Flash Lite, it costs high because developers need to construct a whole application from scratch. Therefore, the development framework for mobile Web contents which reduces the development cost is needed. In this paper, we propose a development framework for rich user-interfaces of mobile Web contents. The proposed framework employs the dependency injection pattern to separate a content and its user-interface. Each user-interface component provides a functionality of a specific user-interface, and information that is specific to a particular website is described in an HTML document. A Web site is made by binding multiple user-interface components with an HTML document. The proposed framework provides a reduction of the development cost of mobile Web sites with a rich user-interface by leveraging existing resources.
虽然移动Web内容的使用已经显示出相当大的增长,但这些内容大多以HTML格式编写,使用起来不够方便。尽管可以使用Flash Lite等技术开发富用户界面,但成本很高,因为开发人员需要从头开始构建整个应用程序。因此,需要一个能够降低开发成本的移动Web内容开发框架。本文提出了一种移动Web内容富用户界面的开发框架。建议的框架采用依赖注入模式来分离内容及其用户界面。每个用户界面组件提供特定用户界面的功能,并且特定于特定网站的信息在HTML文档中进行描述。Web站点是通过将多个用户界面组件与HTML文档绑定而成的。所建议的框架通过利用现有资源,降低了具有丰富用户界面的移动Web站点的开发成本。
{"title":"A Development Framework for Mobile User-Interfaces Based on HTML Centric Dependency Injection","authors":"Takashi Nozawa, Hajime Hotta, M. Hagiwara","doi":"10.1109/WIIAT.2008.304","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.304","url":null,"abstract":"While the use of mobile Web contents has shown a considerable increase, most of these contents, which are written in HTML format, are not convenient enough to use. Even though rich user-interfaces can be developed using some technologies like Flash Lite, it costs high because developers need to construct a whole application from scratch. Therefore, the development framework for mobile Web contents which reduces the development cost is needed. In this paper, we propose a development framework for rich user-interfaces of mobile Web contents. The proposed framework employs the dependency injection pattern to separate a content and its user-interface. Each user-interface component provides a functionality of a specific user-interface, and information that is specific to a particular website is described in an HTML document. A Web site is made by binding multiple user-interface components with an HTML document. The proposed framework provides a reduction of the development cost of mobile Web sites with a rich user-interface by leveraging existing resources.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122622746","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
Semantic Wiki Where Human and Agents Collaborate 人类和代理协作的语义Wiki
K. Kawamoto, M. Mase, Y. Kitamura, Y. Tijerino
A Wiki is a collaborative Web page authoring system. Users collaborate to build a Web site by creating and updating Wiki pages through Web browsers. However, conventional Wikis easily lose the consistency of the contents because a number of anonymous users can participate in authoring them. By introducing information agents that understand the. Wiki contents, we can keep the consistency. The agents can automatically update Wiki contents, integrate other Web contents to them, and keep them consistent cooperating with the human users. We propose KawaWiki, which is a semantic Wiki system where human users and information agents can collaborate by utilizing the semantic Web technology. To make agents and users collaborate in authoring Wiki contents, we adopt the RDF as the common representation. It is not easy for novice users to author RDF data, and we introduce KawaWiki templates to generate a Wiki page with RDF data at one time. We also introduce KawaWiki queries to make agents retrieve information efficiently from the Wiki contents. Finally, we introduce an agent description language to specify agent's behavior on the Wiki.
Wiki是一个协作的Web页面创作系统。用户通过Web浏览器创建和更新Wiki页面,从而协作构建Web站点。然而,传统的wiki很容易失去内容的一致性,因为许多匿名用户可以参与创作。通过引入信息代理来理解。维基的内容,我们可以保持一致性。代理可以自动更新Wiki内容,将其他Web内容集成到这些内容中,并与人类用户保持一致。我们提出了KawaWiki,它是一个语义Wiki系统,人类用户和信息代理可以利用语义Web技术进行协作。为了使代理和用户协同创作Wiki内容,我们采用RDF作为通用表示。对于新手用户来说,编写RDF数据并不容易,因此我们引入了KawaWiki模板来一次性使用RDF数据生成Wiki页面。我们还引入了KawaWiki查询,使代理能够有效地从Wiki内容中检索信息。最后,我们引入了一种代理描述语言来描述代理在Wiki上的行为。
{"title":"Semantic Wiki Where Human and Agents Collaborate","authors":"K. Kawamoto, M. Mase, Y. Kitamura, Y. Tijerino","doi":"10.1109/WIIAT.2008.240","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.240","url":null,"abstract":"A Wiki is a collaborative Web page authoring system. Users collaborate to build a Web site by creating and updating Wiki pages through Web browsers. However, conventional Wikis easily lose the consistency of the contents because a number of anonymous users can participate in authoring them. By introducing information agents that understand the. Wiki contents, we can keep the consistency. The agents can automatically update Wiki contents, integrate other Web contents to them, and keep them consistent cooperating with the human users. We propose KawaWiki, which is a semantic Wiki system where human users and information agents can collaborate by utilizing the semantic Web technology. To make agents and users collaborate in authoring Wiki contents, we adopt the RDF as the common representation. It is not easy for novice users to author RDF data, and we introduce KawaWiki templates to generate a Wiki page with RDF data at one time. We also introduce KawaWiki queries to make agents retrieve information efficiently from the Wiki contents. Finally, we introduce an agent description language to specify agent's behavior on the Wiki.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128910846","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
Acquiring Explicit User Goals from Search Query Logs 从查询日志中获取明确的用户目标
M. Strohmaier, P. Prettenhofer, Mark Kröll
Knowledge about user goals is crucial for realizing the vision of intelligent agents acting upon user intent on the Web. In a departure from existing approaches, this paper proposes a novel approach to the problem of user goal acquisition: The utilization of search query logs for this task. The paper makes the following contributions: (a) it presents an automatic method for the acquisition of user goals from search query logs with useful precision/recall scores (b) it provides insights into the nature and some characteristics of these goals and (c) it shows that the goals acquired from query logs exhibit traits of a long tail distribution.
关于用户目标的知识对于实现基于Web上用户意图的智能代理的愿景至关重要。在现有方法的基础上,本文提出了一种新的方法来解决用户目标获取问题:利用搜索查询日志来完成这项任务。本文做出了以下贡献:(a)提出了一种从搜索查询日志中自动获取用户目标的方法,具有有用的精度/召回率分数;(b)它提供了对这些目标的性质和一些特征的见解;(c)它显示了从查询日志中获取的目标表现出长尾分布的特征。
{"title":"Acquiring Explicit User Goals from Search Query Logs","authors":"M. Strohmaier, P. Prettenhofer, Mark Kröll","doi":"10.1109/WIIAT.2008.364","DOIUrl":"https://doi.org/10.1109/WIIAT.2008.364","url":null,"abstract":"Knowledge about user goals is crucial for realizing the vision of intelligent agents acting upon user intent on the Web. In a departure from existing approaches, this paper proposes a novel approach to the problem of user goal acquisition: The utilization of search query logs for this task. The paper makes the following contributions: (a) it presents an automatic method for the acquisition of user goals from search query logs with useful precision/recall scores (b) it provides insights into the nature and some characteristics of these goals and (c) it shows that the goals acquired from query logs exhibit traits of a long tail distribution.","PeriodicalId":393772,"journal":{"name":"2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128947660","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
期刊
2008 IEEE/WIC/ACM International Conference 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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1