Web forums have become a major source of information gathering/mining due to a large amount of user generated content. Crawling of web forums is necessary to gather/mine the information from them. However, a generic web crawler is unable to efficiently and effectively crawl the web forums because of the existence of many redundant and duplicate pages. In addition, there exists a crawling relationship among the useful pages that need to be considered. So, for efficient crawling, we need to intelligently crawl the web forums by eliminating redundant and duplicate pages, and understanding the crawling relationship. Existing works in forum crawling use visual pattern recognition based methods, which make them extremely computational expensive. In this paper, we propose a novel light-weight crawling method using text and links properties of the pages in web forums. Theoretical analysis and experimental results show the effectiveness and efficiency of the proposed method.
{"title":"A Generalized Links and Text Properties Based Forum Crawler","authors":"Amit Sachan, Wee-Yong Lim, V. Thing","doi":"10.1109/WI-IAT.2012.213","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.213","url":null,"abstract":"Web forums have become a major source of information gathering/mining due to a large amount of user generated content. Crawling of web forums is necessary to gather/mine the information from them. However, a generic web crawler is unable to efficiently and effectively crawl the web forums because of the existence of many redundant and duplicate pages. In addition, there exists a crawling relationship among the useful pages that need to be considered. So, for efficient crawling, we need to intelligently crawl the web forums by eliminating redundant and duplicate pages, and understanding the crawling relationship. Existing works in forum crawling use visual pattern recognition based methods, which make them extremely computational expensive. In this paper, we propose a novel light-weight crawling method using text and links properties of the pages in web forums. Theoretical analysis and experimental results show the effectiveness and efficiency of the proposed method.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129101389","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}
Group behaviors of organisms can be described as the response to personally and socially acquired information. Many previous works, for example traditional social force model and alignment rule, concern the influence of neighbors' behaviors, but overlook the individual direct response to the information of environment. Here, we propose a novel friction based social force model and focus on the individual initiative, which is a direct response to environmental stimuli. By employing multi-agent methods, our model simulates a grazing case: a group of sheep graze in a meadow. We demonstrate that, guided by friction force (namely the individual initiative of unwilling to move), initiatives of individual and partners have variable influences on the benefit and motion of individuals in group behaviors. Furthermore, simulation results are consistent with two recent biological observations, that cannot be mimicked by traditional social force model and alignment rule.
{"title":"A Friction Based Social Force Model for Group Behaviors","authors":"Zhaofeng Li, Yichuan Jiang","doi":"10.1109/WI-IAT.2012.112","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.112","url":null,"abstract":"Group behaviors of organisms can be described as the response to personally and socially acquired information. Many previous works, for example traditional social force model and alignment rule, concern the influence of neighbors' behaviors, but overlook the individual direct response to the information of environment. Here, we propose a novel friction based social force model and focus on the individual initiative, which is a direct response to environmental stimuli. By employing multi-agent methods, our model simulates a grazing case: a group of sheep graze in a meadow. We demonstrate that, guided by friction force (namely the individual initiative of unwilling to move), initiatives of individual and partners have variable influences on the benefit and motion of individuals in group behaviors. Furthermore, simulation results are consistent with two recent biological observations, that cannot be mimicked by traditional social force model and alignment rule.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128085838","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}
Recently, named entity recognition tools tend to disambiguate recognized named entities on a very detailed level. Instead of elementary types (e.g. Person or Location), they assign concrete identifiers, trying to distinguish even different entities having same name and type (e.g. cities with the same name in different countries). We introduce a novel method for this kind of named entity disambiguation exploiting structural dependencies of recognized entities. We analyse the co-occurrence of disambiguated entities in the backing knowledge base and use this information to improve results of existing named entity disambiguation approaches. A model for co-occurrence representation is proposed and evaluated based on a dataset that we mine from Wikipedia.
{"title":"Context Aware Named Entity Disambiguation","authors":"Ivo Lasek, P. Vojtás","doi":"10.1109/WI-IAT.2012.96","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.96","url":null,"abstract":"Recently, named entity recognition tools tend to disambiguate recognized named entities on a very detailed level. Instead of elementary types (e.g. Person or Location), they assign concrete identifiers, trying to distinguish even different entities having same name and type (e.g. cities with the same name in different countries). We introduce a novel method for this kind of named entity disambiguation exploiting structural dependencies of recognized entities. We analyse the co-occurrence of disambiguated entities in the backing knowledge base and use this information to improve results of existing named entity disambiguation approaches. A model for co-occurrence representation is proposed and evaluated based on a dataset that we mine from Wikipedia.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132032196","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}
Text analytics on consumer-generated content has gained significant momentum over last few years. A wide-range of text mining techniques has been proposed which can provide interesting insights about the text content. But, the challenge still exists in consuming the extracted information in form of actionable intelligence. Identifying actionable intelligence is difficult due to differences in consumer and business languages. Since feedbacks rarely talks of a single problem, determining the problems is also challenging. We propose a framework to address some of these challenges. Organizational websites or standard domain-ontologies are rich repositories of domain knowledge. The proposed method utilizes this knowledge to learn a discriminative classifier model for a domain using Fisher's discriminant metric. The consumer feedbacks are classified to different business categories using the learnt model. The output is further fed into a fuzzy reasoning unit where every feedback is assigned confidence values for each category. Initial experiments show that the proposed framework is capable of handling text feedbacks containing customer complaints in various domains.
{"title":"An Ontology-Based Mining of Consumer Feedbacks Using Fuzzy Reasoning","authors":"Lipika Dey, Sameera Bharadwaja H., Shefali Bhat","doi":"10.1109/WI-IAT.2012.193","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.193","url":null,"abstract":"Text analytics on consumer-generated content has gained significant momentum over last few years. A wide-range of text mining techniques has been proposed which can provide interesting insights about the text content. But, the challenge still exists in consuming the extracted information in form of actionable intelligence. Identifying actionable intelligence is difficult due to differences in consumer and business languages. Since feedbacks rarely talks of a single problem, determining the problems is also challenging. We propose a framework to address some of these challenges. Organizational websites or standard domain-ontologies are rich repositories of domain knowledge. The proposed method utilizes this knowledge to learn a discriminative classifier model for a domain using Fisher's discriminant metric. The consumer feedbacks are classified to different business categories using the learnt model. The output is further fed into a fuzzy reasoning unit where every feedback is assigned confidence values for each category. Initial experiments show that the proposed framework is capable of handling text feedbacks containing customer complaints in various domains.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128997475","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}
We present a description of our multi-agent system where computational intelligence methods are embodied as software agents. This system is designed in order to allow easy experiments with learning, meta learning, gathering experience based on previous computations, and recommending suitable methods for particular data. The architecture of the system is presented and its meta learning abilities are demonstrated on a set of experiments with neural network models and both evolutionary and local search heuristics.
{"title":"A Novel Meta Learning System and Its Application to Optimization of Computing Agents' Results","authors":"O. Kazík, K. Pesková, M. Pilát, Roman Neruda","doi":"10.1109/WI-IAT.2012.250","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.250","url":null,"abstract":"We present a description of our multi-agent system where computational intelligence methods are embodied as software agents. This system is designed in order to allow easy experiments with learning, meta learning, gathering experience based on previous computations, and recommending suitable methods for particular data. The architecture of the system is presented and its meta learning abilities are demonstrated on a set of experiments with neural network models and both evolutionary and local search heuristics.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123017160","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 introduces the utilization of data originated in the web user ocular movement to improve the methodology for identifying Website Key objects that was designed by Velasquez and Dujovne through the use of eye tracking tools. Given a website, this methodology takes as input the request register (Web log) of the website, the pages that compose it and the interest of users in the web objects of each page, which is quantified using a survey. Subsequently, the data is transformed and preprocessed before finally applying Web mining algorithms that allow the extraction of the Website Key objects. In this paper, a novel application of the eye tracking technology is proposed, in order to dispense with the survey, that is to say, using a more precise tool to achieve an improvement in the classification of the Website Key objects. It was concluded that eye tracking technology is useful and accurate when it comes to knowing what a user looks at and therefore, what attracts their attention the most. Finally, it was established that there is an improvement of between 15% and 16% when using the information generated by the eye tracker.
{"title":"Improvement of a Methodology for Website Keyobject Identification through the Application of Eye-Tracking Technologies","authors":"Juan Domingo Velásquez-Silva","doi":"10.1109/WI-IAT.2012.182","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.182","url":null,"abstract":"This paper introduces the utilization of data originated in the web user ocular movement to improve the methodology for identifying Website Key objects that was designed by Velasquez and Dujovne through the use of eye tracking tools. Given a website, this methodology takes as input the request register (Web log) of the website, the pages that compose it and the interest of users in the web objects of each page, which is quantified using a survey. Subsequently, the data is transformed and preprocessed before finally applying Web mining algorithms that allow the extraction of the Website Key objects. In this paper, a novel application of the eye tracking technology is proposed, in order to dispense with the survey, that is to say, using a more precise tool to achieve an improvement in the classification of the Website Key objects. It was concluded that eye tracking technology is useful and accurate when it comes to knowing what a user looks at and therefore, what attracts their attention the most. Finally, it was established that there is an improvement of between 15% and 16% when using the information generated by the eye tracker.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124169364","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}
Since around 2000, many companies have worked to create interorganizational cooperation, which can solve the problem of a lack of resources when creating new business. In the real world, many companies cannot find the holder of necessary resources, and they cannot conduct proper interor-ganizational cooperation. To solve these problems, we propose a business process visualization tool.
{"title":"Prototype of New Business Process Visualization Tool","authors":"A. Nagai, T. Tsuboi, Takayuki Ito","doi":"10.1109/WI-IAT.2012.118","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.118","url":null,"abstract":"Since around 2000, many companies have worked to create interorganizational cooperation, which can solve the problem of a lack of resources when creating new business. In the real world, many companies cannot find the holder of necessary resources, and they cannot conduct proper interor-ganizational cooperation. To solve these problems, we propose a business process visualization tool.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"292 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121478773","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}
Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nan yang Technological University (NTU) Co-Space populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own, (2) interactivity: agents can interact naturally with players, and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted an evaluative study involving human subjects to assess how virtual characters may enhance user experience in the virtual world. The results show that the fusion ART-based virtual humans receive significantly higher ratings in various performance measures related to user experience, especially Telepresence, Perceived Interactivity and Flow.
{"title":"Agent-Based Virtual Humans in Co-Space: An Evaluative Study","authors":"Yilin Kang, A. Tan, F. Nah","doi":"10.1109/WI-IAT.2012.130","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.130","url":null,"abstract":"Co-Space refers to interactive virtual environment modelled after the real world in terms of look-and-feel, functionalities and services. We have developed a 3D virtual world named Nan yang Technological University (NTU) Co-Space populated with virtual human characters. Three key requirements of realistic virtual humans in the virtual world have been identified, namely (1) autonomy: agents can function on their own, (2) interactivity: agents can interact naturally with players, and (3) personality: agents can exhibit human traits and characteristics. Working towards these challenges, we propose a brain-inspired agent architecture that integrates goal-directed autonomy, natural language interaction and human-like personality. We conducted an evaluative study involving human subjects to assess how virtual characters may enhance user experience in the virtual world. The results show that the fusion ART-based virtual humans receive significantly higher ratings in various performance measures related to user experience, especially Telepresence, Perceived Interactivity and Flow.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128488105","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}
Yi-feng Zeng, Hua Mao, Prashant Doshi, Yinghui Pan, Jian Luo
Communication is one of central activities in multiagent systems. It enables the knowledge sharing among multiple agents and improves the planning quality in a long run. In this paper, we study communication decision problems in the framework of interactive dynamic influence diagrams~(I-DIDs). I-DIDs are recognized probabilistic graphical models for sequential decision making in uncertain multiagent settings. We extend the representation to explicitly model communication actions as well as their relations to other variables in the domain. The challenging work is on developing an incentive mechanism that drives level 0 agents to learn communication while they act alone in a dynamic environment. We present solutions to the new model and show meaningful communication strategies in a multiagent problem domain.
{"title":"Learning Communication in Interactive Dynamic Influence Diagrams","authors":"Yi-feng Zeng, Hua Mao, Prashant Doshi, Yinghui Pan, Jian Luo","doi":"10.1109/WI-IAT.2012.180","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.180","url":null,"abstract":"Communication is one of central activities in multiagent systems. It enables the knowledge sharing among multiple agents and improves the planning quality in a long run. In this paper, we study communication decision problems in the framework of interactive dynamic influence diagrams~(I-DIDs). I-DIDs are recognized probabilistic graphical models for sequential decision making in uncertain multiagent settings. We extend the representation to explicitly model communication actions as well as their relations to other variables in the domain. The challenging work is on developing an incentive mechanism that drives level 0 agents to learn communication while they act alone in a dynamic environment. We present solutions to the new model and show meaningful communication strategies in a multiagent problem domain.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"4 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125344439","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}
A. T. Mors, C. Witteveen, Charlotte Ipema, F. D. Nijs, Theodor Tsiourakis
In multi-agent route planning, there is a set of autonomous vehicles (agents), each with their own start and destination locations. Agents want to reach their destinations as quickly as possible while avoiding conflicts with other agents. We present a single-agent route planning algorithm that finds an optimal conflict-free route plan given a set of reservations from higher-priority agents. We also present an approach that constructs a conflict-free schedule along a fixed path. In order to obtain low-cost multi-agent plans, the fixed paths must provide the agents with sufficiently different alternatives in case certain parts of the infrastructure are more congested than others. We tried both a k shortest paths algorithm, and an algorithm for node-disjoint paths, and compared both approaches to the routing algorithm, and investigated how performances depend on characteristics of the infrastructure.
{"title":"Empirical Evaluation of Multi-Agent Routing Approaches","authors":"A. T. Mors, C. Witteveen, Charlotte Ipema, F. D. Nijs, Theodor Tsiourakis","doi":"10.1109/WI-IAT.2012.198","DOIUrl":"https://doi.org/10.1109/WI-IAT.2012.198","url":null,"abstract":"In multi-agent route planning, there is a set of autonomous vehicles (agents), each with their own start and destination locations. Agents want to reach their destinations as quickly as possible while avoiding conflicts with other agents. We present a single-agent route planning algorithm that finds an optimal conflict-free route plan given a set of reservations from higher-priority agents. We also present an approach that constructs a conflict-free schedule along a fixed path. In order to obtain low-cost multi-agent plans, the fixed paths must provide the agents with sufficiently different alternatives in case certain parts of the infrastructure are more congested than others. We tried both a k shortest paths algorithm, and an algorithm for node-disjoint paths, and compared both approaches to the routing algorithm, and investigated how performances depend on characteristics of the infrastructure.","PeriodicalId":220218,"journal":{"name":"2012 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126114627","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
扫码关注我们
求助内容：
应助结果提醒方式：