Ephemeral clustering has been studied for more than a decade, although with low user acceptance. According to us, this situation is mainly due to (1) an excessive number of generated clusters, which makes browsing difficult and (2) low quality labeling, which introduces imprecision within the search process. In this paper, our motivation is twofold. First, we propose to reduce the number of clusters of Web page results, but keeping all different query meanings. For that purpose, we propose a new polythetic methodology based on an informative similarity measure, the InfoSimba, and a new hierarchical clustering algorithm, the HISGK-means. Second, a theoretical background is proposed to define meaningful cluster labels embedded in the definition of the HISGK-means algorithm, which may elect as best label, words outside the given cluster. To confirm our intuitions, we propose a new evaluation framework, which shows that we are able to extract most of the important query meanings but generating much less clusters than state-of-the-art systems.
{"title":"Informative Polythetic Hierarchical Ephemeral Clustering","authors":"G. Dias, G. Cleuziou, David Machado","doi":"10.1109/WI-IAT.2011.123","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.123","url":null,"abstract":"Ephemeral clustering has been studied for more than a decade, although with low user acceptance. According to us, this situation is mainly due to (1) an excessive number of generated clusters, which makes browsing difficult and (2) low quality labeling, which introduces imprecision within the search process. In this paper, our motivation is twofold. First, we propose to reduce the number of clusters of Web page results, but keeping all different query meanings. For that purpose, we propose a new polythetic methodology based on an informative similarity measure, the InfoSimba, and a new hierarchical clustering algorithm, the HISGK-means. Second, a theoretical background is proposed to define meaningful cluster labels embedded in the definition of the HISGK-means algorithm, which may elect as best label, words outside the given cluster. To confirm our intuitions, we propose a new evaluation framework, which shows that we are able to extract most of the important query meanings but generating much less clusters than state-of-the-art systems.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"55 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":"122574292","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}
Normative logics offer descriptions on expected behavior of agents inside a system. Norm implementation in MAS is rarely discussed and in practice, introducing norms triggers indirect impacts on the behavior of agents. In order to obtain some experience, we implemented OperettA norms using 2APL agents in a firefighter simulation. In this article, we propose a comprehensive overview of the issues encountered when implementing the different norm aspects in agents.
{"title":"Implementing Norms?","authors":"Loïs Vanhée, H. Aldewereld, F. Dignum","doi":"10.1109/WI-IAT.2011.184","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.184","url":null,"abstract":"Normative logics offer descriptions on expected behavior of agents inside a system. Norm implementation in MAS is rarely discussed and in practice, introducing norms triggers indirect impacts on the behavior of agents. In order to obtain some experience, we implemented OperettA norms using 2APL agents in a firefighter simulation. In this article, we propose a comprehensive overview of the issues encountered when implementing the different norm aspects in agents.","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":"114518532","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 Web-based intelligent decision support system(Web-IDSS) is pivotal for a Virtual Team (VT) to successfully execute business-related tasks. The current generation of Web-IDSS built on top of semantic web technologies for VTs lacks the capability to provide decision support when underlying information is incomplete and/or contradictory. In this article, we address this limitation of current Web-IDSS through defeasible logic based argumentation formalism. The proposed Web-IDSS uses a hybrid reasoning approach: forward chaining(data-driven) for the construction of arguments over incomplete information, and backward chaining (goal-driven) for conflict identification and resolution with explanation. The proposed Web-IDSS adheres to web standards and publishes the outcome of argumentative reasoning in Argument Interchange Format (AIF).
{"title":"Defeasible Reasoning Based Argumentative Web-IDSS for Virtual Teams (VTs)","authors":"N. Janjua, F. Hussain","doi":"10.1109/WI-IAT.2011.168","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.168","url":null,"abstract":"The Web-based intelligent decision support system(Web-IDSS) is pivotal for a Virtual Team (VT) to successfully execute business-related tasks. The current generation of Web-IDSS built on top of semantic web technologies for VTs lacks the capability to provide decision support when underlying information is incomplete and/or contradictory. In this article, we address this limitation of current Web-IDSS through defeasible logic based argumentation formalism. The proposed Web-IDSS uses a hybrid reasoning approach: forward chaining(data-driven) for the construction of arguments over incomplete information, and backward chaining (goal-driven) for conflict identification and resolution with explanation. The proposed Web-IDSS adheres to web standards and publishes the outcome of argumentative reasoning in Argument Interchange Format (AIF).","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"127 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":"114587753","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}
Kouichi Akamatsu, Nimit Pattanasri, A. Jatowt, Katsumi Tanaka
We put forward a hypothesis that if there is a link from one page to another, it is likely that comprehensibility of the two pages is similar. To investigate whether this hypothesis is true or not, we conduct experiments using existing readability measures. We investigate the relationship between links and readability of text extracted from web pages for two datasets, set of English and Japanese pages. We could find that links and readability of text extracted from web pages are correlated. Based on the hypothesis, we propose a link analysis algorithm to measure comprehensibility of web pages. Our method is based on the Trust Rank algorithm which is originally used for combating web spam. We use link structure to propagate readability scores from source pages selected based on their comprehensibility. The results of experimental evaluation demonstrate that our method could improve estimation of comprehensibility of pages.
{"title":"Measuring Comprehensibility of Web Pages Based on Link Analysis","authors":"Kouichi Akamatsu, Nimit Pattanasri, A. Jatowt, Katsumi Tanaka","doi":"10.1109/WI-IAT.2011.242","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.242","url":null,"abstract":"We put forward a hypothesis that if there is a link from one page to another, it is likely that comprehensibility of the two pages is similar. To investigate whether this hypothesis is true or not, we conduct experiments using existing readability measures. We investigate the relationship between links and readability of text extracted from web pages for two datasets, set of English and Japanese pages. We could find that links and readability of text extracted from web pages are correlated. Based on the hypothesis, we propose a link analysis algorithm to measure comprehensibility of web pages. Our method is based on the Trust Rank algorithm which is originally used for combating web spam. We use link structure to propagate readability scores from source pages selected based on their comprehensibility. The results of experimental evaluation demonstrate that our method could improve estimation of comprehensibility of pages.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"6 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":"121929081","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}
Capturing users' future search actions has many potential applications such as query recommendation, web page re-ranking, advertisement arrangement, and so on. This paper predicts users' future queries and URL clicks based on their current access behaviors and global users' query logs. We explore various features from queries and clicked URLs in the users' current search sessions, select similar intents from query logs, and use them for prediction. Because of an intent shift problem in search sessions, this paper discusses which actions have more effects on the prediction, what representations are more suitable to represent users' intents, how the intent similarity is measured, and how the retrieved similar intents affect the prediction. MSN Search Query Log excerpt (RFP 2006 dataset) is taken as an experimental corpus. Three methods and the back-off models are presented.
{"title":"Predicting Next Search Actions with Search Engine Query Logs","authors":"K. Lin, Chieh-Jen Wang, Hsin-Hsi Chen","doi":"10.1109/WI-IAT.2011.15","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.15","url":null,"abstract":"Capturing users' future search actions has many potential applications such as query recommendation, web page re-ranking, advertisement arrangement, and so on. This paper predicts users' future queries and URL clicks based on their current access behaviors and global users' query logs. We explore various features from queries and clicked URLs in the users' current search sessions, select similar intents from query logs, and use them for prediction. Because of an intent shift problem in search sessions, this paper discusses which actions have more effects on the prediction, what representations are more suitable to represent users' intents, how the intent similarity is measured, and how the retrieved similar intents affect the prediction. MSN Search Query Log excerpt (RFP 2006 dataset) is taken as an experimental corpus. Three methods and the back-off models are presented.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"7 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":"129691139","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}
Observation is one of the most commonly used techniques to change behaviour through persuasion. When pervasive technology adopts this technique, in the form of ubiquitous monitoring, the benefits are likely to be significant. However, there is generally a lack of systematic methods for designing persuasive systems. This research aims to explore the use of the PSA-BI model and the 3D-RAB model in creating a method for systematically designing intentional behavioural change into ubiquitous monitoring systems.
{"title":"Ubiquitous Monitoring and User Perceptions as a Persuasive Strategy","authors":"Stuart Moran, I. Wiafe, K. Nakata","doi":"10.1109/WI-IAT.2011.112","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.112","url":null,"abstract":"Observation is one of the most commonly used techniques to change behaviour through persuasion. When pervasive technology adopts this technique, in the form of ubiquitous monitoring, the benefits are likely to be significant. However, there is generally a lack of systematic methods for designing persuasive systems. This research aims to explore the use of the PSA-BI model and the 3D-RAB model in creating a method for systematically designing intentional behavioural change into ubiquitous monitoring systems.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"83 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":"124607116","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}
Most existing approaches of Web service selection with user preferences are either quantitative or qualitative. However, using a qualitative or quantitative approach alone cannot handle all the non-functional properties(NFPs). To solve this problem, we present an approach of service selection with quantitative and qualitative user preferences, where qualitative preferences are modeled as a TCP-net and quantitative preferences are specified by using arbitrary positive numbers. Our approach consists of two steps, that is, qualitative selection based on qualitative preferences and quantitative selection based on quantitative preferences. We prove its effectiveness and verify its efficiency through extensive experiments.
{"title":"Web Service Selection with Quantitative and Qualitative User Preferences","authors":"Hongbing Wang, Weihong Liu","doi":"10.1109/WI-IAT.2011.68","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.68","url":null,"abstract":"Most existing approaches of Web service selection with user preferences are either quantitative or qualitative. However, using a qualitative or quantitative approach alone cannot handle all the non-functional properties(NFPs). To solve this problem, we present an approach of service selection with quantitative and qualitative user preferences, where qualitative preferences are modeled as a TCP-net and quantitative preferences are specified by using arbitrary positive numbers. Our approach consists of two steps, that is, qualitative selection based on qualitative preferences and quantitative selection based on quantitative preferences. We prove its effectiveness and verify its efficiency through extensive experiments.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"235 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":"130620523","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}
Distributed fusion of complex information is critical to the success of large organizations. For such organizations, comprised of thousands of agents, improving and shaping the quality of conclusions reached is a challenging problem. The challenge is increased by the fact that acquisition of information could be costly. This leads to the crucial requirement that the organization should strive to reach correct conclusions while minimizing information acquisition cost. In this paper, we have developed a model of complex, interdependent information that is costly to acquire and where complex fusion should be optimized within an organization while minimizing the cost of acquiring the sensor data. Empirical results show a number of interesting effects. First, unselfish agents who spend resources (even when not strictly locally necessary) can lead to substantial improvement in the overall accuracy of the organization's conclusions. Second, an organization can substantially improve its performance by carefully assigning sensor resources within the organization. Third, over time, agents can learn the reliability of the members of the organization to whom they are directly connected to improve performance. Learning can also lead to better team decisions about whether to spend resources and how much resource to expend to get sensor data. Our conclusions and algorithms can help a range of organizations reach better conclusions while expending less resources procuring sensor data.
{"title":"Multi-variate Distributed Data Fusion with Expensive Sensor Data","authors":"Yonghong Wang, K. Sycara, P. Scerri","doi":"10.1109/WI-IAT.2011.248","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.248","url":null,"abstract":"Distributed fusion of complex information is critical to the success of large organizations. For such organizations, comprised of thousands of agents, improving and shaping the quality of conclusions reached is a challenging problem. The challenge is increased by the fact that acquisition of information could be costly. This leads to the crucial requirement that the organization should strive to reach correct conclusions while minimizing information acquisition cost. In this paper, we have developed a model of complex, interdependent information that is costly to acquire and where complex fusion should be optimized within an organization while minimizing the cost of acquiring the sensor data. Empirical results show a number of interesting effects. First, unselfish agents who spend resources (even when not strictly locally necessary) can lead to substantial improvement in the overall accuracy of the organization's conclusions. Second, an organization can substantially improve its performance by carefully assigning sensor resources within the organization. Third, over time, agents can learn the reliability of the members of the organization to whom they are directly connected to improve performance. Learning can also lead to better team decisions about whether to spend resources and how much resource to expend to get sensor data. Our conclusions and algorithms can help a range of organizations reach better conclusions while expending less resources procuring sensor data.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"3 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":"125256694","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}
Mode and route choice are central elements of traffic simulations. Traditionally they form two subsequent steps in the four-step process where first, the simulated population distributes among available transportation modes and then their movement is assigned to the roads respectively other networks. However, these two phases are better dealt with simultaneously as choices are highly depending on each other. In this paper, we are suggesting an agent-based combined route and mode choice model that is not only able to resemble traditional simulations, but provides the means for new applications. As the simulated agents are active and situated while moving through the network, they are able to react to unforeseen events such as the closing of a link. Thus we can reproduce the self-organized re-distribution of travelers to new routes depending on when/where they are notified about the problem. We illustrate the feasibility and usefulness of our agent-based mode and route choice simulation using a real-world network of a small-size Swiss town.
{"title":"Agent-Based Route (and Mode) Choice Simulation in Real-World Networks","authors":"Franziska Klügl-Frohnmeyer, G. Rindsfüser","doi":"10.1109/WI-IAT.2011.246","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.246","url":null,"abstract":"Mode and route choice are central elements of traffic simulations. Traditionally they form two subsequent steps in the four-step process where first, the simulated population distributes among available transportation modes and then their movement is assigned to the roads respectively other networks. However, these two phases are better dealt with simultaneously as choices are highly depending on each other. In this paper, we are suggesting an agent-based combined route and mode choice model that is not only able to resemble traditional simulations, but provides the means for new applications. As the simulated agents are active and situated while moving through the network, they are able to react to unforeseen events such as the closing of a link. Thus we can reproduce the self-organized re-distribution of travelers to new routes depending on when/where they are notified about the problem. We illustrate the feasibility and usefulness of our agent-based mode and route choice simulation using a real-world network of a small-size Swiss town.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"7 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":"127914442","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 development of surface public transportation networks is a major issue in terms of ecology, economy and society. Their quality in term of punctuality and passengers services(regularity between buses) should be improved. To do so, cities often use regulation systems at junctions that grant priority to buses. However, most of them hardly take into account both public transport vehicles such as buses and private vehicle traffic. This paper proposes a bimodal urban traffic control strategy based on a multi-agent model. The objective is to improve global traffic, to reduce bus delays and to improve bus regularity in congested areas of the network. In our approach, traffic regulation is obtained thanks to communication, collaboration and negotiation between heterogeneous agents. We tested our strategy on a complex network of nine junctions. The results of the simulation are presented.
{"title":"Collaborative Agents for Modeling Traffic Regulation Systems","authors":"N. Bhouri, Flavien Balbo, S. Pinson, M. Tlig","doi":"10.1109/WI-IAT.2011.62","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.62","url":null,"abstract":"The development of surface public transportation networks is a major issue in terms of ecology, economy and society. Their quality in term of punctuality and passengers services(regularity between buses) should be improved. To do so, cities often use regulation systems at junctions that grant priority to buses. However, most of them hardly take into account both public transport vehicles such as buses and private vehicle traffic. This paper proposes a bimodal urban traffic control strategy based on a multi-agent model. The objective is to improve global traffic, to reduce bus delays and to improve bus regularity in congested areas of the network. In our approach, traffic regulation is obtained thanks to communication, collaboration and negotiation between heterogeneous agents. We tested our strategy on a complex network of nine junctions. The results of the simulation are presented.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"12 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":"132215924","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
扫码关注我们
求助内容：
应助结果提醒方式：