S. M. Allen, M. J. Chorley, Gualtiero Colombo, R. Whitaker
The performance of many emerging communication paradigms depend on high levels of cooperation amongst the peers in the network. Although an individual’s best strategy may be to selfishly consume resources without reciprocation, the optimal social performance requires agents in the network to behave in an altruistic manner. This paper considers a P2P data dissemination scenario, and applies an autonomic trust protocol that forms social network structures to incentive cooperation. Trust links are formed according to the simple criterion that ‘individuals seek to interact with others at least as cooperative as themselves’ and these links are used to prioritise the choice of peers to interact with. The success of the protocol is validated through a prisoner’s dilemma based simulation which uses the similarity of interest between peers to define pay-offs. While the variation in interests reduces the average payoff (per iteration) received by the most cooperative individuals, only the most ‘divergent’ and uncooperative nodes are heavily affected and ostracized from interaction by other cooperative nodes.
{"title":"Incentivising Cooperation between Agents for Content Sharing","authors":"S. M. Allen, M. J. Chorley, Gualtiero Colombo, R. Whitaker","doi":"10.1109/WI-IAT.2010.145","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.145","url":null,"abstract":"The performance of many emerging communication paradigms depend on high levels of cooperation amongst the peers in the network. Although an individual’s best strategy may be to selfishly consume resources without reciprocation, the optimal social performance requires agents in the network to behave in an altruistic manner. This paper considers a P2P data dissemination scenario, and applies an autonomic trust protocol that forms social network structures to incentive cooperation. Trust links are formed according to the simple criterion that ‘individuals seek to interact with others at least as cooperative as themselves’ and these links are used to prioritise the choice of peers to interact with. The success of the protocol is validated through a prisoner’s dilemma based simulation which uses the similarity of interest between peers to define pay-offs. While the variation in interests reduces the average payoff (per iteration) received by the most cooperative individuals, only the most ‘divergent’ and uncooperative nodes are heavily affected and ostracized from interaction by other cooperative nodes.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117026562","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}
In the area of financial decision making it is more and more acknowledged that psychological states and characteristics play an important role, for example feeling insecure in relation to financial risks, and being greedy in relation to opportunities to obtain serious gains. This paper presents an agent model of human decision making behaviour in economic situations, incorporating a human’s greed state and personality characteristic concerning risk. The model provides a basis for the development of personalised intelligent agents that support a person in financial decisions. To evaluate the model a number of simulation experiments have been performed, which illustrate the model’s ability to show behaviour of different types of personalities.
{"title":"Supporting Financial Decision Making by an Intelligent Agent Estimating Greed and Risk","authors":"T. Bosse, G. F. Siddiqui, Jan Treur","doi":"10.1109/WI-IAT.2010.233","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.233","url":null,"abstract":"In the area of financial decision making it is more and more acknowledged that psychological states and characteristics play an important role, for example feeling insecure in relation to financial risks, and being greedy in relation to opportunities to obtain serious gains. This paper presents an agent model of human decision making behaviour in economic situations, incorporating a human’s greed state and personality characteristic concerning risk. The model provides a basis for the development of personalised intelligent agents that support a person in financial decisions. To evaluate the model a number of simulation experiments have been performed, which illustrate the model’s ability to show behaviour of different types of personalities.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132524486","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}
This paper presents the coauthor network topic (CNT) model constructed based on Markov random fields (MRFs) with higher-order cliques. Regularized by the complex coauthor network structures, the CNT can simultaneously learn topic distributions as well as expertise of authors from large document collections. Besides modeling the pairwise relations, we model also higher-order coauthor relations and investigate their effects on topic and expertise modeling. We derive efficient inference and learning algorithms from the Gibbs sampling procedure. To confirm the effectiveness, we apply the CNT to the expert finding problem on a DBLP corpus of titles from six different computer science conferences. Experiments show that the higher-order relations among coauthors can improve the topic and expertise modeling performance over the case with pairwise relations, and thus can find more relevant experts given a query topic or document.
{"title":"Coauthor Network Topic Models with Application to Expert Finding","authors":"Jia Zeng, W. K. Cheung, Chun-hung Li, Jiming Liu","doi":"10.1109/WI-IAT.2010.20","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.20","url":null,"abstract":"This paper presents the coauthor network topic (CNT) model constructed based on Markov random fields (MRFs) with higher-order cliques. Regularized by the complex coauthor network structures, the CNT can simultaneously learn topic distributions as well as expertise of authors from large document collections. Besides modeling the pairwise relations, we model also higher-order coauthor relations and investigate their effects on topic and expertise modeling. We derive efficient inference and learning algorithms from the Gibbs sampling procedure. To confirm the effectiveness, we apply the CNT to the expert finding problem on a DBLP corpus of titles from six different computer science conferences. Experiments show that the higher-order relations among coauthors can improve the topic and expertise modeling performance over the case with pairwise relations, and thus can find more relevant experts given a query topic or document.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132857426","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}
Functionality-oriented service composition and quality-oriented service selection are two important phases of Web service composition. To select the optimal composition schema at the former phase and make the best composite service found at the latter phase, we propose an approach to estimate schema quality of Web service composition. The approach considers the number of Web services and the number of time steps as its evaluation criteria. Based on the two evaluation criteria, the computation formulae and algorithm are given. Finally, the effectiveness and rationality of the approach is verified through simulation experiments.
{"title":"An Approach to Estimate Schema Quality of Web Service Composition","authors":"Weihong Liu, Hongbing Wang","doi":"10.1109/WI-IAT.2010.299","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.299","url":null,"abstract":"Functionality-oriented service composition and quality-oriented service selection are two important phases of Web service composition. To select the optimal composition schema at the former phase and make the best composite service found at the latter phase, we propose an approach to estimate schema quality of Web service composition. The approach considers the number of Web services and the number of time steps as its evaluation criteria. Based on the two evaluation criteria, the computation formulae and algorithm are given. Finally, the effectiveness and rationality of the approach is verified through simulation experiments.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128170701","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}
The digital age has brought about new platforms for collaboration which have provided interesting and effective ways of enabling people to engage in a wide variety of socially-driven activities. One only needs to observe the many free/libre open source software projects on the web, where millions of connected individuals actively participate in the development and deployment of a wide range of software applications and tools. For many of us, there is a great appeal to this ideology, one comprising of a more transparent and open culture of collaboration. Such activities encourage freedom and shared learning which could be considered essential to human growth and innovation. In this paper we describe research with such goals. Specific to our research includes the development of online and mobile user interfaces for the visualization of food ``spimes'' (informationally-rich food-based data), seeking to understand how best to enable and encourage people to share information/knowledge, visualize/compare choices, and understand different aspects of food quality. By democratizing food knowledge in such respects, it is the goal that we develop a more satisfying food culture, enabling people to collectively realize more healthy, socially acceptable, environmentally friendly, and cost-effective food choices.
{"title":"Constructing Collaborative Online Communities for Visualizing Spimes","authors":"Timothy Maciag, Daryl H. Hepting","doi":"10.1109/WI-IAT.2010.297","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.297","url":null,"abstract":"The digital age has brought about new platforms for collaboration which have provided interesting and effective ways of enabling people to engage in a wide variety of socially-driven activities. One only needs to observe the many free/libre open source software projects on the web, where millions of connected individuals actively participate in the development and deployment of a wide range of software applications and tools. For many of us, there is a great appeal to this ideology, one comprising of a more transparent and open culture of collaboration. Such activities encourage freedom and shared learning which could be considered essential to human growth and innovation. In this paper we describe research with such goals. Specific to our research includes the development of online and mobile user interfaces for the visualization of food ``spimes'' (informationally-rich food-based data), seeking to understand how best to enable and encourage people to share information/knowledge, visualize/compare choices, and understand different aspects of food quality. By democratizing food knowledge in such respects, it is the goal that we develop a more satisfying food culture, enabling people to collectively realize more healthy, socially acceptable, environmentally friendly, and cost-effective food choices.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"1128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132002831","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}
In this paper, we propose the use of an agent-based architecture to enhance workflow system capacity to support interprofessional, patient-centred palliative care delivery. This paper outlines the concept of palliative care and describes how agents can be used to assist care providers to address the needs of the patient and family. Our architecture is illustrated in a diagram and the agents are described in terms of the services they provide, and the dependencies among them. The dependencies determine the information flow, which facilitates the communication and collaboration among the patient and care providers.
{"title":"Enhancing Patient-Centered Palliative Care with Collaborative Agents","authors":"Ji Ruan, W. MacCaull, Heather Jewers","doi":"10.1109/WI-IAT.2010.259","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.259","url":null,"abstract":"In this paper, we propose the use of an agent-based architecture to enhance workflow system capacity to support interprofessional, patient-centred palliative care delivery. This paper outlines the concept of palliative care and describes how agents can be used to assist care providers to address the needs of the patient and family. Our architecture is illustrated in a diagram and the agents are described in terms of the services they provide, and the dependencies among them. The dependencies determine the information flow, which facilitates the communication and collaboration among the patient and care providers.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134363495","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}
Abstract-In this paper, we propose a novel method combined classical collaborative filtering (CF) and bipartite network structure. Different from the classical CF, user similarity is viewed as personal recommendation power and during the recommendation process, it will be redistributed to different users. Furthermore, a free parameter is introduced to tune the contribution of the user to the user similairty. Numerical results demonstrates that decreasing the degree of user to some extent in method performs good in rank value and hamming distance. Furthermore, the correlation between degree and similarity is concerned to sovle the drastically change of our method performance.
{"title":"One Improved Collaborative Filtering Method Based on Information Transformation","authors":"Zhaoxing Liu, Ning Zhang","doi":"10.1109/WI-IAT.2010.319","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.319","url":null,"abstract":"Abstract-In this paper, we propose a novel method combined classical collaborative filtering (CF) and bipartite network structure. Different from the classical CF, user similarity is viewed as personal recommendation power and during the recommendation process, it will be redistributed to different users. Furthermore, a free parameter is introduced to tune the contribution of the user to the user similairty. Numerical results demonstrates that decreasing the degree of user to some extent in method performs good in rank value and hamming distance. Furthermore, the correlation between degree and similarity is concerned to sovle the drastically change of our method performance.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"113 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134481412","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}
Static index pruning techniques aim at removing from the posting lists of an inverted file the references to documents which are likely to be not relevant for answering user queries. The reduction in the size of the index results in a better exploitation of memory hierarchies and faster query processing. On the other hand, pruning may affect the precision of the information retrieval system, since pruned entries are unavailable at query processing time. Static pruning techniques proposed so far exploit query-independent measures to evaluate the importance of a document within a posting list. This paper proposes a general framework that aims at enhancing the precision of any static pruning methods by exploiting usage information extracted from query logs. Experiments conducted on the TREC WT10g Web collection and a large Altavista query log show that integrating usage knowledge into the pruning process is profitable, and increases remarkably performance figures obtained with the state-of-the art Carmel's static pruning method.
{"title":"On Using Query Logs for Static Index Pruning","authors":"Hoang Thanh Lam, R. Perego, F. Silvestri","doi":"10.1109/WI-IAT.2010.139","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.139","url":null,"abstract":"Static index pruning techniques aim at removing from the posting lists of an inverted file the references to documents which are likely to be not relevant for answering user queries. The reduction in the size of the index results in a better exploitation of memory hierarchies and faster query processing. On the other hand, pruning may affect the precision of the information retrieval system, since pruned entries are unavailable at query processing time. Static pruning techniques proposed so far exploit query-independent measures to evaluate the importance of a document within a posting list. This paper proposes a general framework that aims at enhancing the precision of any static pruning methods by exploiting usage information extracted from query logs. Experiments conducted on the TREC WT10g Web collection and a large Altavista query log show that integrating usage knowledge into the pruning process is profitable, and increases remarkably performance figures obtained with the state-of-the art Carmel's static pruning method.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134546963","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}
Information recommender system attempts to present information that is likely to be useful for the user. Showing recommendation reason is an important role of the system. However, current recommender systems give only simple or quantitative reasons for the recommendation. In this paper, we aim at giving precise and non-quantitative reasons which are also easy to understand. We make use of formulas in first-order predicate logic for explaining the reason. In order to build such formulas, we use Inductive Logic Programming. We succeeded to extract several useful formulas from blogs.
{"title":"Rule Extraction from Blog Using Inductive Logic Programming","authors":"N. Chikara, M. Koshimura, H. Fujita, R. Hasegawa","doi":"10.1109/WI-IAT.2010.235","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.235","url":null,"abstract":"Information recommender system attempts to present information that is likely to be useful for the user. Showing recommendation reason is an important role of the system. However, current recommender systems give only simple or quantitative reasons for the recommendation. In this paper, we aim at giving precise and non-quantitative reasons which are also easy to understand. We make use of formulas in first-order predicate logic for explaining the reason. In order to build such formulas, we use Inductive Logic Programming. We succeeded to extract several useful formulas from blogs.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133103952","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}
Automated end-to-end Service Level Management (SLM) is crucial to enable self-organising Service-Oriented Architectures (SOA). In this paper, we present an approach based on Organic Computing to enable automated SLM by using automated service level negotiation. The evaluation results in a simulated SOA environment are presented to show the applicability of our approach.
{"title":"Enabling Self-Organising Service Level Management with Automated Negotiation","authors":"Lei Liu, H. Schmeck","doi":"10.1109/WI-IAT.2010.127","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.127","url":null,"abstract":"Automated end-to-end Service Level Management (SLM) is crucial to enable self-organising Service-Oriented Architectures (SOA). In this paper, we present an approach based on Organic Computing to enable automated SLM by using automated service level negotiation. The evaluation results in a simulated SOA environment are presented to show the applicability of our approach.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133127075","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：