This paper proposes a two-phase feature selection method specific for bioinformatics domain from classification perspective in data mining. In the first phase, Bhattacharyya distance measurement is used for filtering the majority of irrelevant genes. Upon the basis, we apply floating sequential search method (FSSM) to further select informative gene set using kernel distance as measurement of class separability. The verification of colon tissue dataset using support vector machines (SVMs) proves that informative gene set selected by our method is acceptable for disease identification.
{"title":"Domain Driven Two-Phase Feature Selection Method Based on Bhattacharyya Distance and Kernel Distance Measurements","authors":"Yibing Chen, Lingling Zhang, Jun Li, Yong Shi","doi":"10.1109/WI-IAT.2011.61","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.61","url":null,"abstract":"This paper proposes a two-phase feature selection method specific for bioinformatics domain from classification perspective in data mining. In the first phase, Bhattacharyya distance measurement is used for filtering the majority of irrelevant genes. Upon the basis, we apply floating sequential search method (FSSM) to further select informative gene set using kernel distance as measurement of class separability. The verification of colon tissue dataset using support vector machines (SVMs) proves that informative gene set selected by our method is acceptable for disease identification.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"66 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":"115316318","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}
M. Riemsdijk, Virginia Dignum, C. Jonker, H. Aldewereld
Organizational modeling languages are used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Agents take part in organizations by playing one or more of the specified roles. Using such an organizational specification to organize a multi-agent system can support agents' effectiveness in attaining their purpose, or prevent certain undesired behavior from occurring. In this paper, we investigate the process of role enactment in organizations that have a so-called gatekeeper that is responsible for admitting agents to the organization, like the well-known OperA organizational modelling language. We propose an interaction protocol between gatekeeper and agents that want to play roles, resulting in admittance of agents to the organization (or rejection). We analyze which kinds of reasoning are needed for agents to participate in this protocol. In particular, agents need to be able to reason about whether they have the necessary capabilities to play a role in an organization. We make precise what it means to have a capability and propose to integrate reasoning about capabilities in agent programming languages using reflection. We show how this kind of reflection about capabilities can be used to program role enactment in the GOAL agent programming language.
{"title":"Programming Role Enactment through Reflection","authors":"M. Riemsdijk, Virginia Dignum, C. Jonker, H. Aldewereld","doi":"10.1109/WI-IAT.2011.205","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.205","url":null,"abstract":"Organizational modeling languages are used to specify an agent organization in terms of its roles, organizational structure, norms, etc. Agents take part in organizations by playing one or more of the specified roles. Using such an organizational specification to organize a multi-agent system can support agents' effectiveness in attaining their purpose, or prevent certain undesired behavior from occurring. In this paper, we investigate the process of role enactment in organizations that have a so-called gatekeeper that is responsible for admitting agents to the organization, like the well-known OperA organizational modelling language. We propose an interaction protocol between gatekeeper and agents that want to play roles, resulting in admittance of agents to the organization (or rejection). We analyze which kinds of reasoning are needed for agents to participate in this protocol. In particular, agents need to be able to reason about whether they have the necessary capabilities to play a role in an organization. We make precise what it means to have a capability and propose to integrate reasoning about capabilities in agent programming languages using reflection. We show how this kind of reflection about capabilities can be used to program role enactment in the GOAL agent programming language.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"82 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":"115724280","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}
Nowadays we are facing the daily information overload. It is thus difficult to get exactly the information we need. It often happens that while reading, we find a word we do not understand and we would need an explanation or some additional information about this word. For this purpose annotations in the Web environment are created and attached to such words. In this paper we propose a method for an automatic extension of the content available on the Web by adding annotations to selected terms (keywords) in the text. The method is designed to be able to insert annotations into the text written in Slovak with a potential to be language independent. Annotations themselves are obtained through publicly available services providing information retrieval. We adapt created annotations taking into account implicit feedback from users in form of click through data. We evaluate the proposed method in the environment of an educational web-based system.
{"title":"Automatic Annotation of Non-English Web Content","authors":"J. Sevcech, M. Bieliková","doi":"10.1109/WI-IAT.2011.219","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.219","url":null,"abstract":"Nowadays we are facing the daily information overload. It is thus difficult to get exactly the information we need. It often happens that while reading, we find a word we do not understand and we would need an explanation or some additional information about this word. For this purpose annotations in the Web environment are created and attached to such words. In this paper we propose a method for an automatic extension of the content available on the Web by adding annotations to selected terms (keywords) in the text. The method is designed to be able to insert annotations into the text written in Slovak with a potential to be language independent. Annotations themselves are obtained through publicly available services providing information retrieval. We adapt created annotations taking into account implicit feedback from users in form of click through data. We evaluate the proposed method in the environment of an educational web-based system.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"29 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":"116786588","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}
Agent coordination is a fundamental task in designing and operating multiagent systems. However, in dynamically changing environments, coordination must balance proactive and reactive behaviors in order to enable efficient operations while retaining the necessary flexibility to react to unforeseen events. This paper introduces adaptive agent relationships for coping with these contradictory requirements. In this approach, agents dynamically establish relationships which are represented as interaction patterns. On the one hand, these patterns enable efficient coordination by restricting the number of potential interaction flows to those offering the best estimated outcome. On the other hand, they can adapt to environmental changes, as the agents continuously reconsider their relationships in a feedback loop of estimated interaction flows and actually observed coordination outcomes. The paper formalizes the agent decision-making process enabling adaptive relationships and applies it to a logistics network scenario. A comparative evaluation demonstrates its ability to efficiently coordinate agent interaction in a dynamic environment.
{"title":"Efficient Multiagent Coordination in Dynamic Environments","authors":"J. Berndt, O. Herzog","doi":"10.1109/WI-IAT.2011.63","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.63","url":null,"abstract":"Agent coordination is a fundamental task in designing and operating multiagent systems. However, in dynamically changing environments, coordination must balance proactive and reactive behaviors in order to enable efficient operations while retaining the necessary flexibility to react to unforeseen events. This paper introduces adaptive agent relationships for coping with these contradictory requirements. In this approach, agents dynamically establish relationships which are represented as interaction patterns. On the one hand, these patterns enable efficient coordination by restricting the number of potential interaction flows to those offering the best estimated outcome. On the other hand, they can adapt to environmental changes, as the agents continuously reconsider their relationships in a feedback loop of estimated interaction flows and actually observed coordination outcomes. The paper formalizes the agent decision-making process enabling adaptive relationships and applies it to a logistics network scenario. A comparative evaluation demonstrates its ability to efficiently coordinate agent interaction in a dynamic environment.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"58 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":"117167150","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 semantic linguistic processor which extracts the objects and their links from natural language texts is considered. It is intended for the areas where the automatic formalization of the flows of texts in natural language is required. Peculiarities of the texts are taken into account by linguistic knowledge of the processor: the system can be tuned to various subject areas. We describe the use of this processor for text formalization in different subject areas, such as criminology (summary of incidents, accusatory conclusions, etc.), mass media (documents about terrorist activities), personnel management (autobiographies, resume). Special features of each problem area are examined: the collections of extracted objects, the means for their identification, their connections, occurring contractions, punctuation and special signs, specific character of language constructions, etc. -- all these special features were taken into account in the linguistic knowledge development.
{"title":"Intelligent Extraction of Knowledge Structures from Natural Language Texts","authors":"I. Kuznetsov, E. Kozerenko, A. Matskevich","doi":"10.1109/WI-IAT.2011.235","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.235","url":null,"abstract":"A semantic linguistic processor which extracts the objects and their links from natural language texts is considered. It is intended for the areas where the automatic formalization of the flows of texts in natural language is required. Peculiarities of the texts are taken into account by linguistic knowledge of the processor: the system can be tuned to various subject areas. We describe the use of this processor for text formalization in different subject areas, such as criminology (summary of incidents, accusatory conclusions, etc.), mass media (documents about terrorist activities), personnel management (autobiographies, resume). Special features of each problem area are examined: the collections of extracted objects, the means for their identification, their connections, occurring contractions, punctuation and special signs, specific character of language constructions, etc. -- all these special features were taken into account in the linguistic knowledge development.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":" 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120984406","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}
Identifying and extracting named entities from web pages has been the subject of many researches. In this paper, we propose and evaluate some new unsupervised language modeling approaches to determine the membership level of a candidate answer, a named entity, to a natural language question to a very fine-grained conceptual class of entity. We propose to address this issue by using the Web or DBPedia hierarchy as sources of evidence. Then, this level of membership can be used to improve the ranking of candidate answers in a question-answering task. Lastly, we present the results we obtained by participating in TREC 2010 Entity track.
{"title":"The Web as a Source of Evidence for Filtering Candidate Answers to Natural Language Questions","authors":"L. Bonnefoy, P. Bellot, M. Benoit","doi":"10.1109/WI-IAT.2011.226","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.226","url":null,"abstract":"Identifying and extracting named entities from web pages has been the subject of many researches. In this paper, we propose and evaluate some new unsupervised language modeling approaches to determine the membership level of a candidate answer, a named entity, to a natural language question to a very fine-grained conceptual class of entity. We propose to address this issue by using the Web or DBPedia hierarchy as sources of evidence. Then, this level of membership can be used to improve the ranking of candidate answers in a question-answering task. Lastly, we present the results we obtained by participating in TREC 2010 Entity track.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"88 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":"125076820","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 describes software agents that monitor the formation of teams within the System-Oriented UAV simulator SOUL. Operators must be trained in virtual teams, working in communities of practice. According to the evaluation of their collective skills, users can then be placed in communities of competencies. For monitoring the interactions between operators, an agent framework facilitates the collaborative training, by pushing up contracts and aiding cohesion of human-teams. The contracts make the most with the direct use of e-portfolio for operators to gather the social dependencies on knowledge and skills. This allows us to assess operator's actions in real time together with an immediate detection and analysis of misbehavior feedbacks, improving the whole situation awareness.
{"title":"Enhancing Group Cohesion in Virtual Communities of Practice","authors":"E. Gouardères, G. Gouardères","doi":"10.1109/WI-IAT.2011.186","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.186","url":null,"abstract":"This paper describes software agents that monitor the formation of teams within the System-Oriented UAV simulator SOUL. Operators must be trained in virtual teams, working in communities of practice. According to the evaluation of their collective skills, users can then be placed in communities of competencies. For monitoring the interactions between operators, an agent framework facilitates the collaborative training, by pushing up contracts and aiding cohesion of human-teams. The contracts make the most with the direct use of e-portfolio for operators to gather the social dependencies on knowledge and skills. This allows us to assess operator's actions in real time together with an immediate detection and analysis of misbehavior feedbacks, improving the whole situation awareness.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"28 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":"126094255","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}
G. Boella, G. Pigozzi, M. Slavkovik, Leendert van der Torre
Satisficing, the concept proposed by Herbert Simon, as an approach to reaching agreements is little explored. We propose a model for satisficing agreement reaching for an adaptive collaborative group of agents. The group consists of one human agent familiar with the problem and arbitrarily many artificial agents. Our model raises to the team level the recognition-primed decision model constructed in the field of cognitive decision-making by using social choice for reaching group opinions.
{"title":"A Satisficing Agreements Model","authors":"G. Boella, G. Pigozzi, M. Slavkovik, Leendert van der Torre","doi":"10.1109/WI-IAT.2011.232","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.232","url":null,"abstract":"Satisficing, the concept proposed by Herbert Simon, as an approach to reaching agreements is little explored. We propose a model for satisficing agreement reaching for an adaptive collaborative group of agents. The group consists of one human agent familiar with the problem and arbitrarily many artificial agents. Our model raises to the team level the recognition-primed decision model constructed in the field of cognitive decision-making by using social choice for reaching group opinions.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"65 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":"114905593","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}
Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of behavioral models ascribed to other agents over time. Previous approaches mainly cluster behaviorally equivalent models to reduce the complexity of I-DID solutions. In this paper, we seek to further reduce the model space by introducing an approximate measure of behavioral equivalence (BE) and using it to group models. Specifically, we focus on $K$ most probable paths in the solution of each model and compare these policy paths to determine approximate BE. We discuss the challenges in computing the top $K$ policy paths and experimentally evaluate the performance of this heuristic approach in terms of the scalability and quality of the solution.
{"title":"Approximating Model Equivalence in Interactive Dynamic Influence Diagrams Using Top K Policy Paths","authors":"Yi-feng Zeng, Yingke Chen, Prashant Doshi","doi":"10.1109/WI-IAT.2011.79","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.79","url":null,"abstract":"Interactive dynamic influence diagrams (I-DIDs) are graphical models for sequential decision making in uncertain settings shared by other agents. Algorithms for solving I-DIDs face the challenge of an exponentially growing space of behavioral models ascribed to other agents over time. Previous approaches mainly cluster behaviorally equivalent models to reduce the complexity of I-DID solutions. In this paper, we seek to further reduce the model space by introducing an approximate measure of behavioral equivalence (BE) and using it to group models. Specifically, we focus on $K$ most probable paths in the solution of each model and compare these policy paths to determine approximate BE. We discuss the challenges in computing the top $K$ policy paths and experimentally evaluate the performance of this heuristic approach in terms of the scalability and quality of the solution.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"119 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":"116392572","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 new approach to the quantifying changes in an email social network illustrated by the data from the Enron dataset). The Triad Transition Matrix containing the probabilities of transitions between triads is defined, then we show how it can help to discover the dynamic patterns of network evolution. The compatibility of the TTM approach with the existing methods of characterizing the local topology (network motifs) is discussed as well.
{"title":"Discovering the Evolutionary Patterns in Local Topology of an E-Mail Social Network","authors":"K. Juszczyszyn, Wojciech Frys","doi":"10.1109/WI-IAT.2011.21","DOIUrl":"https://doi.org/10.1109/WI-IAT.2011.21","url":null,"abstract":"We present a new approach to the quantifying changes in an email social network illustrated by the data from the Enron dataset). The Triad Transition Matrix containing the probabilities of transitions between triads is defined, then we show how it can help to discover the dynamic patterns of network evolution. The compatibility of the TTM approach with the existing methods of characterizing the local topology (network motifs) is discussed as well.","PeriodicalId":128421,"journal":{"name":"2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology","volume":"16 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":"122336772","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
扫码关注我们
求助内容：
应助结果提醒方式：