This paper addresses visualized clustering methods that are embedded in CorMap and iView analysis of ideas towards the concerned topic. K-means clustering, automatic affinity diagram (KJ method) and self-organizing map are applied to CorMap analysis and graph clustering algorithm is applied to iView analysis are introduced. We report the visualized clustering results of workshops of a famous scientific forum, show the features of each clustering and compare their performance.
{"title":"Visualized Clustering of Ideas for Group Argumentation","authors":"Bin Luo, Xijin J. Tang","doi":"10.1109/WI-IAT.2010.280","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.280","url":null,"abstract":"This paper addresses visualized clustering methods that are embedded in CorMap and iView analysis of ideas towards the concerned topic. K-means clustering, automatic affinity diagram (KJ method) and self-organizing map are applied to CorMap analysis and graph clustering algorithm is applied to iView analysis are introduced. We report the visualized clustering results of workshops of a famous scientific forum, show the features of each clustering and compare their performance.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"20 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":"115106543","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}
How best to represent text data is an important problem in text mining tasks including information retrieval, clustering, classification and etc.. In this paper, we proposed a compact document representation with term semantic units which are identified from the implicit and explicit semantic information. Among it, the implicit semantic information is extracted from syntactic content via statistical methods such as latent semantic indexing and information bottleneck. The explicit semantic information is mined from the external semantic resource (Wikipedia). The proposed compact representation model can map a document collection in a low-dimension space (term semantic units which are much less than the number of all unique terms). Experimental results on real data sets have shown that the compact representation efficiently improve the performance of text clustering.
{"title":"Text Clustering via Term Semantic Units","authors":"L. Jing, Jiali Yun, Jian Yu, Houkuan Huang","doi":"10.1109/WI-IAT.2010.23","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.23","url":null,"abstract":"How best to represent text data is an important problem in text mining tasks including information retrieval, clustering, classification and etc.. In this paper, we proposed a compact document representation with term semantic units which are identified from the implicit and explicit semantic information. Among it, the implicit semantic information is extracted from syntactic content via statistical methods such as latent semantic indexing and information bottleneck. The explicit semantic information is mined from the external semantic resource (Wikipedia). The proposed compact representation model can map a document collection in a low-dimension space (term semantic units which are much less than the number of all unique terms). Experimental results on real data sets have shown that the compact representation efficiently improve the performance of text clustering.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"98 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":"121900102","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}
Surjeet Mishra, A. Gorai, Tavleen Oberoi, Hiranmay Ghosh
In this paper, we present a few innovative techniques for visualization of content and contextual information of a multimedia digital library for effective browsing. A traditional collection visualization portal often depicts some metadata or a short synopsis, which is quite inadequate for assessing the documents. We have designed a novel web portal that incorporates a few preview facilities to disclose an abstract of the contents. Moreover, we place the documents on Google Maps to make its geographical context explicit. A semantic network, created automatically around the collection, brings out other contextual information from external knowledge resources like Wikipedia which is used for navigating collection. This paper also reports economical hosting techniques using Amazon Cloud.
{"title":"Efficient Visualization of Content and Contextual Information of an Online Multimedia Digital Library for Effective Browsing","authors":"Surjeet Mishra, A. Gorai, Tavleen Oberoi, Hiranmay Ghosh","doi":"10.1109/WI-IAT.2010.96","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.96","url":null,"abstract":"In this paper, we present a few innovative techniques for visualization of content and contextual information of a multimedia digital library for effective browsing. A traditional collection visualization portal often depicts some metadata or a short synopsis, which is quite inadequate for assessing the documents. We have designed a novel web portal that incorporates a few preview facilities to disclose an abstract of the contents. Moreover, we place the documents on Google Maps to make its geographical context explicit. A semantic network, created automatically around the collection, brings out other contextual information from external knowledge resources like Wikipedia which is used for navigating collection. This paper also reports economical hosting techniques using Amazon Cloud.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"89 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":"123761573","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}
Huiliang Zhang, C. Miao, Shell-Ying Huang, Zhiqi Shen, Xudong Luo
It is very important to know how fast a BDI agent can react to and process incoming event sequences if we want to apply such autonomous agents into time-sensitive applications like the Close-In weapon system in air-carriers. In [15], we proposed an analysis method for traditional sequential agents. In this paper we extend the theoretical analysis method to parallel BDI agents. Our method can estimate the average response time using the average attributes of a sequence of events based on probability and queueing theory. The simulation experiments show that our theoretical analysis method is effective. We also show by an experiment that an agent that dynamically allocates its computational time resources perform better than one that does not. Thus, the theoretical method suggests a way to quickly estimate the performance of an agent if the average attributes of the incoming event sequence are known in advance. Such an analysis of average response time can definitely benefit constructing more efficient BDI agents that situate in time-sensitive environments.
{"title":"How Fast Can a BDI Agent Respond?","authors":"Huiliang Zhang, C. Miao, Shell-Ying Huang, Zhiqi Shen, Xudong Luo","doi":"10.1109/WI-IAT.2010.248","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.248","url":null,"abstract":"It is very important to know how fast a BDI agent can react to and process incoming event sequences if we want to apply such autonomous agents into time-sensitive applications like the Close-In weapon system in air-carriers. In [15], we proposed an analysis method for traditional sequential agents. In this paper we extend the theoretical analysis method to parallel BDI agents. Our method can estimate the average response time using the average attributes of a sequence of events based on probability and queueing theory. The simulation experiments show that our theoretical analysis method is effective. We also show by an experiment that an agent that dynamically allocates its computational time resources perform better than one that does not. Thus, the theoretical method suggests a way to quickly estimate the performance of an agent if the average attributes of the incoming event sequence are known in advance. Such an analysis of average response time can definitely benefit constructing more efficient BDI agents that situate in time-sensitive environments.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"2 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":"124516443","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}
Guowei Dong, Shizhong Wu, Guisi Wang, Tao Guo, Yonggang Huang
The correctness of mission-critical software is an important part of information security, but oracle problem and test data generation are constraints for some programs. Although metamorphic testing (MT) is practical for programs with oracle problem and evolutionary testing (ET) is a good application of genetic algorithm (GA) for automatic test data generation, fitness functions used in ET are not always effective at target search. This article provides a method for improving ET’s efficiency by considering metamorphic relation (MR) when fitness function is constructed, and finally some conclusions are presented.
{"title":"Security Assurance with Metamorphic Testing and Genetic Algorithm","authors":"Guowei Dong, Shizhong Wu, Guisi Wang, Tao Guo, Yonggang Huang","doi":"10.1109/WI-IAT.2010.101","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.101","url":null,"abstract":"The correctness of mission-critical software is an important part of information security, but oracle problem and test data generation are constraints for some programs. Although metamorphic testing (MT) is practical for programs with oracle problem and evolutionary testing (ET) is a good application of genetic algorithm (GA) for automatic test data generation, fitness functions used in ET are not always effective at target search. This article provides a method for improving ET’s efficiency by considering metamorphic relation (MR) when fitness function is constructed, and finally some conclusions are presented.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"88 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":"125411510","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 research, a new evaluation model to select adequate ontologies that fit user requirements is proposed. The model consists of selection criteria and measurements. The proposed model presents two novel features distinct from previous research models. First, it enables users to assign weights to the evaluation criteria based on assumed impacts on ontology selection. Second, it enables users to search keywords from multiple ontologies. In addition, new metrics for the selection criteria are proposed. For empirical analysis, a prototype was developed and experiments were performed. The experimental results indicate that our evaluation model for ontology selection is valid and works well. The ultimate goal of this research is to provide an ontology evaluation model, enabling ontology users to select adequate ontologies to user requirements.
{"title":"User-Centered Evaluation Model for Ontology Selection","authors":"Sunju Oh, H. Yeom","doi":"10.1109/WI-IAT.2010.315","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.315","url":null,"abstract":"In this research, a new evaluation model to select adequate ontologies that fit user requirements is proposed. The model consists of selection criteria and measurements. The proposed model presents two novel features distinct from previous research models. First, it enables users to assign weights to the evaluation criteria based on assumed impacts on ontology selection. Second, it enables users to search keywords from multiple ontologies. In addition, new metrics for the selection criteria are proposed. For empirical analysis, a prototype was developed and experiments were performed. The experimental results indicate that our evaluation model for ontology selection is valid and works well. The ultimate goal of this research is to provide an ontology evaluation model, enabling ontology users to select adequate ontologies to user requirements.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"23 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":"128478957","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}
Classical information retrieval is based around a user having an information need, formulated as a query, and a system which matches the query against 'documents', retrieving those most likely to be relevant. In some applications there are challenges because the 'documents' are not discrete objects but highly inter-connected, and IR research has for decades developed models of the processes, devised novel ranking algorithms, and developed very elaborate benchmarking techniques for performance. But what if the information we need or seek is not neatly divided into documents, either discrete or inter-connected, but needs to be taken from a constant stream of data values, namely data from sensors. These sensors cover the physical sensors around us (environment, place, physical activities like traffic, weather, people movement, crowd gatherings like concerts and sports events) as well as the online sensors we have access to (blogs, tweets, etc.). Often termed the *sensor web*, this information source is characterised as being noisy, errorsome, unpredictable and dynamic, exactly like the real and the virtual worlds in which we live, work and play. In this presentation I introduce several diverse sensor web applications to show the breadth and pervasive nature of the sensor web and I then show some of the techniques which we use to manage the information which forms part of the sensor web.
{"title":"The Sensor Web: Unpredictable, Noisy and Loaded with Errors","authors":"A. Smeaton","doi":"10.1109/WI-IAT.2010.307","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.307","url":null,"abstract":"Classical information retrieval is based around a user having an information need, formulated as a query, and a system which matches the query against 'documents', retrieving those most likely to be relevant. In some applications there are challenges because the 'documents' are not discrete objects but highly inter-connected, and IR research has for decades developed models of the processes, devised novel ranking algorithms, and developed very elaborate benchmarking techniques for performance. But what if the information we need or seek is not neatly divided into documents, either discrete or inter-connected, but needs to be taken from a constant stream of data values, namely data from sensors. These sensors cover the physical sensors around us (environment, place, physical activities like traffic, weather, people movement, crowd gatherings like concerts and sports events) as well as the online sensors we have access to (blogs, tweets, etc.). Often termed the *sensor web*, this information source is characterised as being noisy, errorsome, unpredictable and dynamic, exactly like the real and the virtual worlds in which we live, work and play. In this presentation I introduce several diverse sensor web applications to show the breadth and pervasive nature of the sensor web and I then show some of the techniques which we use to manage the information which forms part of the sensor web.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"48 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":"129230748","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 spite of the rising demands for reusable information systems, current designs are still insufficient in providing efficient reusable mechanisms for system design. One of the major problems hindering the development of information reuse in most traditional systems, which include component-based systems and object-oriented systems, is the lack of the self-organising ability among the system components or subsystems. The emergence of intelligent agent-based technology is able to solve the problems plaguing many traditional systems. In this paper we introduce an optimised design for agent-based systems, which is able to provide an efficient process for agent capability reuse. An experimental program is developed to evaluate the performance of the proposed design.
{"title":"An Optimised Design for Agent Capability Reuse","authors":"H. Zhang, C. Leung, Xinghuo Yu, Jing He","doi":"10.1109/WI-IAT.2010.154","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.154","url":null,"abstract":"In spite of the rising demands for reusable information systems, current designs are still insufficient in providing efficient reusable mechanisms for system design. One of the major problems hindering the development of information reuse in most traditional systems, which include component-based systems and object-oriented systems, is the lack of the self-organising ability among the system components or subsystems. The emergence of intelligent agent-based technology is able to solve the problems plaguing many traditional systems. In this paper we introduce an optimised design for agent-based systems, which is able to provide an efficient process for agent capability reuse. An experimental program is developed to evaluate the performance of the proposed design.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"3 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":"129839937","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}
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detection. In this paper we propose an intention recognition system based on the event calculus. The system, called WIREC, exploits profiles, contextual information, heuristics and any available integrity constraints together with plan libraries and a basic theory of actions, causality and ramifications. Whenever the profile and context suggest there is a usual pattern of behaviour on the part of the actor the search for intention can be focused on existing plan libraries. On the other hand, when no such information is available or if the behaviour of the actor deviates from the usual pattern the search for intention can revert to the basic theory of actions, in effect dynamically constructing partial plans corresponding to the actions executed by the actor.
{"title":"Intention Recognition with Event Calculus Graphs","authors":"F. Sadri","doi":"10.1109/WI-IAT.2010.83","DOIUrl":"https://doi.org/10.1109/WI-IAT.2010.83","url":null,"abstract":"Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detection. In this paper we propose an intention recognition system based on the event calculus. The system, called WIREC, exploits profiles, contextual information, heuristics and any available integrity constraints together with plan libraries and a basic theory of actions, causality and ramifications. Whenever the profile and context suggest there is a usual pattern of behaviour on the part of the actor the search for intention can be focused on existing plan libraries. On the other hand, when no such information is available or if the behaviour of the actor deviates from the usual pattern the search for intention can revert to the basic theory of actions, in effect dynamically constructing partial plans corresponding to the actions executed by the actor.","PeriodicalId":340211,"journal":{"name":"2010 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology","volume":"52 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":"129925723","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：