Web Intell. Agent Syst.最新文献_第6页

Modeling user hidden navigational behavior for Web recommendation 为Web推荐建模用户隐藏的导航行为

Web Intell. Agent Syst. Pub Date : 2011-08-01 DOI: 10.3233/WIA-2011-0217

Guandong Xu, Lin Li, Yanchun Zhang, X. Yi, M. Kitsuregawa

{"title":"Modeling user hidden navigational behavior for Web recommendation","authors":"Guandong Xu, Lin Li, Yanchun Zhang, X. Yi, M. Kitsuregawa","doi":"10.3233/WIA-2011-0217","DOIUrl":"https://doi.org/10.3233/WIA-2011-0217","url":null,"abstract":"Web users exhibit a variety of navigational interests through clicking a sequence of Web pages. Analyses of Web usage data will lead to discovering Web user access patterns, and in turn, facilitating users to locate more preferable Web contents via collaborative recommendation techniques. In the context of Web usage mining, Latent Semantic Analysis (LSA) based on probability inference provides a promising approach to capture not only user hidden navigational patterns, but also the associations between users, pages and hidden navigational patterns. The discovered user access patterns could be used as a usage reference base for identifying the new user's access preferences and making usage-based collaborative Web recommendations. In this paper, we propose a novel usage-based Web recommendation framework, in which Latent Dirichlet Allocation (LDA) is employed to learn the underlying task space from the training Web log data and infer the task distribution for a target user via task inference. The main advantages of the adapted LDA model are its capabilities of efficiently learning the semantic usage information from the Web log data and effectively inferring the access preference of the target user even with a few Web clicks that might be unseen in the training data. In this paper, we also investigate the determination of an optimizing task number, which is another important problem commonly encountered in latent semantic analysis. Experiments conducted on a real Web log dataset show that this approach can achieve better recommendation performance in comparison to other existing techniques. And the discovered task-simplex expression can also provide a better interpretation for Web designers or users to better understand the user navigational preference.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122263122","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

Configuration and control design model for an agent based Flexible Distributed System 基于agent的柔性分布式系统组态与控制设计模型

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0213

Akiko Takahashi, Tetsuo Kinoshita

引用次数: 3

Agent-based vs. population-based simulation of displacement of crime: A comparative study 基于主体与基于人口的犯罪转移模拟:比较研究

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0212

T. Bosse, C. Gerritsen, M. Hoogendoorn, S. W. Jaffry, Jan Treur

引用次数: 22

A multi-agent system for decentralised fractional shared resource constraint scheduling 分散分式共享资源约束调度的多智能体系统

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0208

Gaurav Singh, René Weiskircher

引用次数: 23

Comparing Service-Oriented Computing and Agent-Oriented Programming towards integration 面向服务的计算与面向代理的编程在集成方面的比较

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0211

Giacomo Cabri, L. Leonardi, Mariachiara Puviani, R. Quitadamo

{"title":"Comparing Service-Oriented Computing and Agent-Oriented Programming towards integration","authors":"Giacomo Cabri, L. Leonardi, Mariachiara Puviani, R. Quitadamo","doi":"10.3233/WIA-2011-0211","DOIUrl":"https://doi.org/10.3233/WIA-2011-0211","url":null,"abstract":"Service Oriented Computing (SOC) and Agent Oriented Programming (AOP) are two promising paradigms exploited in the development of distributed systems. In fact, even if starting from different conceptual abstractions, both paradigms try to face unpredictability and complexity in wide and open distributed scenarios. In this context, they exhibit both strengths and weaknesses. The aim of this paper is to propose a comparison between these two paradigms, performed with regard to some issues peculiar of the development of distributed systems that developers must face: space decomposition, interactions among distributed components, reusability/customization, interoperability and security. Of course the purpose of this paper is not to define the “best paradigm”, rather the paper aims at providing developers with critical knowledge about advantages and limitations of the two paradigms. Finally, the need for a smart integration of the two paradigms is pointed out, which will lead to exploit the advantages of both in a joint way. Therefore, we briefly survey some proposals in this direction and report some considerations about them.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121107358","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

Mining personal experiences and opinions from Web documents 从Web文档中挖掘个人经验和意见

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0209

Shuya Abe, Kentaro Inui, Kazuo Hara, Hiraku Morita, C. Sao, Megumi Eguchi, Asuka Sumida, Koji Murakami, Suguru Matsuyoshi

引用次数: 12

Plan representation and execution in multi-actor scenarios by means of social commitments 通过社会承诺的方式在多参与者场景中进行计划的表达和执行

Web Intell. Agent Syst. Pub Date : 2011-04-01 DOI: 10.3233/WIA-2011-0210

Antonín Komenda, J. Vokrínek, M. Pechoucek

引用次数: 5

Solving coarse-grained DisCSPs with local search 用局部搜索求解粗粒度discsp

Web Intell. Agent Syst. Pub Date : 2010-12-01 DOI: 10.3233/WIA-2010-0197

I. Arana, Hatem Ahriz, Muhammed Basharu

{"title":"Solving coarse-grained DisCSPs with local search","authors":"I. Arana, Hatem Ahriz, Muhammed Basharu","doi":"10.3233/WIA-2010-0197","DOIUrl":"https://doi.org/10.3233/WIA-2010-0197","url":null,"abstract":"Distributed constraint satisfaction problems (DisCSPs) are often used to solve problems which are naturally distributed over a number of agents on different locations who cooperate to solve the overall problem. One common assumption in DisCSP resolution is that each agent is only responsible for one variable, i.e. problems are fine-grained. We consider the more realistic scenario where DisCSPs are coarse-grained. Thus, each agent holds multiple local variables, i.e. each agent is responsible for a complex local problem. In such cases, besides the constraints between variables held by different agents there are also local constraints between variables within an agent. Thus, agents have to find a balance between the emphasis they place on resolving their internal and external constraints. Placing slightly more emphasis on one group of constraints can compromise the collective ability of agents to reach agreement and solve problems. We introduce DisBO-wd, a stochastic local search algorithm based on DisBO (Distributed Breakout) which includes a weight decay mechanism and some randomisation. We also present Multi-DisPel, a penalty-based, distributed, local search algorithm which is able to solve coarse-grained DisCSPs efficiently. Multi-DisPeL uses penalties on values in order to escape local optima during problem solving rather than the popular weights on constraints. We compare Multi-DisPeL and DisBO-wd with other algorithms and show, empirically, that they are more efficient and at least as effective as state of the art algorithms in some problem classes.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"156 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127359096","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

Assumption-based reasoning in dynamic normative agent systems 动态规范智能体系统中基于假设的推理

Web Intell. Agent Syst. Pub Date : 2010-12-01 DOI: 10.3233/WIA-2010-0196

G. Giannikis, Aspassia Daskalopulu

{"title":"Assumption-based reasoning in dynamic normative agent systems","authors":"G. Giannikis, Aspassia Daskalopulu","doi":"10.3233/WIA-2010-0196","DOIUrl":"https://doi.org/10.3233/WIA-2010-0196","url":null,"abstract":"In this paper we address dynamic assumption-based reasoning in open agent systems, where, unavoidably, agents have incomplete knowledge about their environment and about other agents. The interactions among agents in such systems are typically subject to norms, which stipulate what each agent is obliged, permitted, prohibited, empowered etc. to do, while it participates in the system. In such environments agents need to resort to assumptions, in order to establish what actions are appropriate to perform, and they need to do so dynamically, since the environment, the agents that exist in it, the information that is exchanged between them, and the normative relations between them change over time. In earlier work, we had proposed Default Theory construction to support dynamic assumption-based reasoning. We argued that in this way, agents could perform both assumption identification and employment dynamically, contrary to other approaches to assumption-based reasoning, which catered for either one or the other. A shortcoming of this early proposal of ours, though, is that Default Theory construction seems to require proof, which is notably computationally expensive. In this paper we present a computational technique that can be used for this construction in an incremental manner that does not depend on proof, and a prototype tool that we developed for experimentation. In a nutshell, depending on their current knowledge at any given time, agents can identify appropriate candidate assumptions in an ad hoc manner. When such choices need to be revised, agents can reconstruct their view of the possible world in which they find themselves, and establish their revised assumption requirements at run-time. \u0000 \u0000This paper is an extended version of the work presented at the 2008 IEEE/WI/ACM Int. Conf. on Intelligent Agent Technology, 9-12 December, Sydney, Australia.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114208386","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

Model guided algorithm for mining unordered embedded subtrees 无序嵌入子树的模型导向挖掘算法

Web Intell. Agent Syst. Pub Date : 2010-12-01 DOI: 10.3233/WIA-2010-0200

F. Hadzic, Henry Tan, T. Dillon

引用次数: 7