Web services enable to achieve an interoperability between heterogeneous data mining applications through platform and language independent interfaces. As the number of available data mining services increases, it becomes more difficult to find a service that can perform a specific task at hand. Moreover, there may also be no such single data mining service capable of performing the specific task, but a combination of other existing services may provide this capability. Hence, a standardized set of interfaces and data interchange formats between services is necessary to discover suitable services as well as to enable composition of the services into complex workflows. Semantic Web services aiming to tackle the problem of discovering of demanded functionality by grounding semantic Web services to particular WSDL port types or by an extension of the interface description using references to an ontology. In both cases it requires semantically annotated interfaces with well described input parameters and results produced by the services. Hence, a data minig ontology is required to describe semantic Web services performing data mining tasks. The goal of this paper is not to provide an exhaustive specification of the interface defining all kinds of data types and data mining primitives used in communication with the data mining services, but rather propose a model, which can be used by software developers to unify development of the services using common Web standards and technologies. Additionally, the reference model can serve as a template for implementation of WSRF-compliant data mining grid services.
{"title":"A Reference Model for Data Mining Web Services","authors":"I. Janciak, P. Brezany","doi":"10.1109/SKG.2010.36","DOIUrl":"https://doi.org/10.1109/SKG.2010.36","url":null,"abstract":"Web services enable to achieve an interoperability between heterogeneous data mining applications through platform and language independent interfaces. As the number of available data mining services increases, it becomes more difficult to find a service that can perform a specific task at hand. Moreover, there may also be no such single data mining service capable of performing the specific task, but a combination of other existing services may provide this capability. Hence, a standardized set of interfaces and data interchange formats between services is necessary to discover suitable services as well as to enable composition of the services into complex workflows. Semantic Web services aiming to tackle the problem of discovering of demanded functionality by grounding semantic Web services to particular WSDL port types or by an extension of the interface description using references to an ontology. In both cases it requires semantically annotated interfaces with well described input parameters and results produced by the services. Hence, a data minig ontology is required to describe semantic Web services performing data mining tasks. The goal of this paper is not to provide an exhaustive specification of the interface defining all kinds of data types and data mining primitives used in communication with the data mining services, but rather propose a model, which can be used by software developers to unify development of the services using common Web standards and technologies. Additionally, the reference model can serve as a template for implementation of WSRF-compliant data mining grid services.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123097111","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 keywords at different semantic levels have different semantic representation abilities. Although words have been organized by semantic dictionaries (e.g. WordNet) with exact semantics, the dictionaries can not be constructed automatically by machine and there are still many words which are not included in the dictionaries. This paper proposes a novel method to automatically extract keywords of higher semantic level which named concept. According to the Association Linked Network (ALN) of webpages, the ALN of keywords (kALN) is constructed first which holds the keywords of a domain and the relations among these keywords. By analyzing graph characteristics of kALN, keywords are grouped into communities. Then drawing on Entropy and Mutual Information, concepts are extracted from each kALN community. Experimental results show that the proposed method of concept extraction is acceptable in accuracy and complexity.
{"title":"Concept Extraction based on Association Linked Network","authors":"Xiao Wei, Xiangfeng Luo","doi":"10.1109/SKG.2010.11","DOIUrl":"https://doi.org/10.1109/SKG.2010.11","url":null,"abstract":"Text keywords at different semantic levels have different semantic representation abilities. Although words have been organized by semantic dictionaries (e.g. WordNet) with exact semantics, the dictionaries can not be constructed automatically by machine and there are still many words which are not included in the dictionaries. This paper proposes a novel method to automatically extract keywords of higher semantic level which named concept. According to the Association Linked Network (ALN) of webpages, the ALN of keywords (kALN) is constructed first which holds the keywords of a domain and the relations among these keywords. By analyzing graph characteristics of kALN, keywords are grouped into communities. Then drawing on Entropy and Mutual Information, concepts are extracted from each kALN community. Experimental results show that the proposed method of concept extraction is acceptable in accuracy and complexity.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131680062","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}
Service-oriented computing (SOC) promises a world of cooperating services loosely connected, creating dynamic business processes and agile applications. Service composition plays a very important role in it. One important problem related to service composition is about what the content of service description is. Most approaches focus on the description about web services themselves, and fail to consider the behaviour of the services in composition. This paper introduces a composition approach on the environment level. The basic idea of it is to develop a model-based approach by using the stability character of environment to encapsulate the changing of the service and the request. Our approach both facilitate to improve the composition efficiency and is more appropriate for compositing complex services or behaviour services based on its’ behaviour. A running travel example is used to illustrate our approach.
{"title":"Web Service Composition on the Environment Level","authors":"Guangjun Cai","doi":"10.1109/SKG.2010.35","DOIUrl":"https://doi.org/10.1109/SKG.2010.35","url":null,"abstract":"Service-oriented computing (SOC) promises a world of cooperating services loosely connected, creating dynamic business processes and agile applications. Service composition plays a very important role in it. One important problem related to service composition is about what the content of service description is. Most approaches focus on the description about web services themselves, and fail to consider the behaviour of the services in composition. This paper introduces a composition approach on the environment level. The basic idea of it is to develop a model-based approach by using the stability character of environment to encapsulate the changing of the service and the request. Our approach both facilitate to improve the composition efficiency and is more appropriate for compositing complex services or behaviour services based on its’ behaviour. A running travel example is used to illustrate our approach.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130543826","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}
Naïve Bayes classifier is proved to be one of the most effective classifier an be used widely. It applies statistical theory to text classification. This paper researched and implemented a Chinese text classifier using JAVA base on Naïve Bayes Method. First of all, this paper described test classification system, the content includes text information expressing, extracting and the method of Chinese text classification. Then it used JAVA to implement Naïve Bayes classification algorithm. Finally this paper made a performance evaluation to the classifier in this classification system, it used the indicators of precision, recall and run time to evaluate the classification results, experiment showed that this classification system has a higher classification accuracy.
{"title":"Research and Implement of Chinese Text Classifier Based on Naïve Bayes Method","authors":"Jian Huang, Zhongdi Cen, Qiuhong Zheng","doi":"10.1109/SKG.2010.79","DOIUrl":"https://doi.org/10.1109/SKG.2010.79","url":null,"abstract":"Naïve Bayes classifier is proved to be one of the most effective classifier an be used widely. It applies statistical theory to text classification. This paper researched and implemented a Chinese text classifier using JAVA base on Naïve Bayes Method. First of all, this paper described test classification system, the content includes text information expressing, extracting and the method of Chinese text classification. Then it used JAVA to implement Naïve Bayes classification algorithm. Finally this paper made a performance evaluation to the classifier in this classification system, it used the indicators of precision, recall and run time to evaluate the classification results, experiment showed that this classification system has a higher classification accuracy.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128715301","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}
Owing to the increasing demand of learning resource sharing, data integration is a promising approach to support system interoperability across heterogeneous e-Learning systems. One of the main problems to deal with in data heterogeneity is semantic conflict and although a variety of methodologies have been proposed which focus on name conflicts, structure conflicts have received little attention. This paper proposes an approach of ontology-based metadata integration for sharing learning resources between the heterogeneous Learning Management Systems. In order to achieve semantic interoperability, the standard metadata DC/LOM, WordNet and mapping rules are proposed to cope with not only name conflict but also structure conflict arising in the real-world system. The preliminary result provides the ability of learning resource interoperability between the different repositories that can establish a community-shared and reusable semantic pattern base over educational institutes.
{"title":"Ontology-based Metadata Integration Approach for Learning Resource Interoperability","authors":"Kotchakorn Banlue, N. Arch-int, S. Arch-int","doi":"10.1109/SKG.2010.30","DOIUrl":"https://doi.org/10.1109/SKG.2010.30","url":null,"abstract":"Owing to the increasing demand of learning resource sharing, data integration is a promising approach to support system interoperability across heterogeneous e-Learning systems. One of the main problems to deal with in data heterogeneity is semantic conflict and although a variety of methodologies have been proposed which focus on name conflicts, structure conflicts have received little attention. This paper proposes an approach of ontology-based metadata integration for sharing learning resources between the heterogeneous Learning Management Systems. In order to achieve semantic interoperability, the standard metadata DC/LOM, WordNet and mapping rules are proposed to cope with not only name conflict but also structure conflict arising in the real-world system. The preliminary result provides the ability of learning resource interoperability between the different repositories that can establish a community-shared and reusable semantic pattern base over educational institutes.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129948611","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}
Shengdong Li, Xueqiang Lv, Hongwei Wang, Shuicai Shi
Text classification is the key technology for topic tracking, and vector space model (VSM) is one of the most simple and effective model for topics representation. On the basis of Knearest neighbor (KNN) algorithm for text classification and support vector machines (SVM) algorithm for text classification, we have studied how they affect topic tracking. Then we get the variation law that they affect topic tracking, and add up their optimal values in topic tracking. Finally, TDT evaluation method proves that optimal topic tracking performance based on SVM increases by 35.134% more than KNN.
{"title":"Study on Key Technology for Topic Tracking","authors":"Shengdong Li, Xueqiang Lv, Hongwei Wang, Shuicai Shi","doi":"10.1109/SKG.2010.39","DOIUrl":"https://doi.org/10.1109/SKG.2010.39","url":null,"abstract":"Text classification is the key technology for topic tracking, and vector space model (VSM) is one of the most simple and effective model for topics representation. On the basis of Knearest neighbor (KNN) algorithm for text classification and support vector machines (SVM) algorithm for text classification, we have studied how they affect topic tracking. Then we get the variation law that they affect topic tracking, and add up their optimal values in topic tracking. Finally, TDT evaluation method proves that optimal topic tracking performance based on SVM increases by 35.134% more than KNN.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"83 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131168953","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}
Big tree is a hierarchical data model for efficiently managing large scale web resources. This paper presents a new type of hierarchical data model, which is inspired by resource space model. Also it could be thought as an extension of resource space model.
{"title":"A Bigtree Index for Resource Space Model","authors":"Z.-W. Zeng, H. Zhuge","doi":"10.1109/SKG.2010.78","DOIUrl":"https://doi.org/10.1109/SKG.2010.78","url":null,"abstract":"Big tree is a hierarchical data model for efficiently managing large scale web resources. This paper presents a new type of hierarchical data model, which is inspired by resource space model. Also it could be thought as an extension of resource space model.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"231 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120951785","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}
At present, in the field of earth science applications there is a difficult problem that how data sharing system to build data services and applications chains automatically, especially in geological data application. It involves the choice of data provider services, data selection, service composition and its interface matching issues. The traditional workflow depends on the strict syntax matching and workflow engine. It is hard for application users to select services and especial needed data provided by selected data service, to comprehend the service function interfaces and make proper service orders, etc. This paper presents a way by using spatial information ontology and rules database to generate data service chain and correspond prototype which achieve a variety of services, matching and composition.
{"title":"XPDL Intelligent Data Service Chain Based on Ontology","authors":"Wenyang Yu, Guoqing Li, Shengtao Sun, Lv Pang","doi":"10.1109/SKG.2010.45","DOIUrl":"https://doi.org/10.1109/SKG.2010.45","url":null,"abstract":"At present, in the field of earth science applications there is a difficult problem that how data sharing system to build data services and applications chains automatically, especially in geological data application. It involves the choice of data provider services, data selection, service composition and its interface matching issues. The traditional workflow depends on the strict syntax matching and workflow engine. It is hard for application users to select services and especial needed data provided by selected data service, to comprehend the service function interfaces and make proper service orders, etc. This paper presents a way by using spatial information ontology and rules database to generate data service chain and correspond prototype which achieve a variety of services, matching and composition.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125383947","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 tremendous growth of research in Peer-to-Peer (P2P) systems in recent years has initiated rising interests on how to design resilient networks for these systems. In this paper, we propose a novel query routing mechanism for improving query performance and a mobile agent based dynamic network reconfiguration mechanism for providing combined node and link failure diagnosis and restoration in unstructured P2P networks. Experimental results show that our query routing mechanism achieves a good tradeoff between query hit rate and space cost in scale-free network and our mobile agent based dynamic network reconfiguration mechanism performs better than existed methods in different types of network topologies.
{"title":"Building Resilient Unstructured Peer-to-Peer Networks Using Mobile Agents","authors":"Ming Xu, Shuigeng Zhou, J. Guan","doi":"10.1109/SKG.2010.25","DOIUrl":"https://doi.org/10.1109/SKG.2010.25","url":null,"abstract":"The tremendous growth of research in Peer-to-Peer (P2P) systems in recent years has initiated rising interests on how to design resilient networks for these systems. In this paper, we propose a novel query routing mechanism for improving query performance and a mobile agent based dynamic network reconfiguration mechanism for providing combined node and link failure diagnosis and restoration in unstructured P2P networks. Experimental results show that our query routing mechanism achieves a good tradeoff between query hit rate and space cost in scale-free network and our mobile agent based dynamic network reconfiguration mechanism performs better than existed methods in different types of network topologies.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124319425","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper presents a new image segmentation approach by suing automatic threshold selection. This approach divides the image into 2 class. The best threshold is got when the separation between the interclass variance and the variance between clasters is the maximal. Experimental results show this new approach can segment images automatically and quickly.
{"title":"A New Image Segmentation Approach by Using Automation Threshold Selection","authors":"Y. Zou, Bencheng Chai, Qili Xiao","doi":"10.1109/SKG.2010.72","DOIUrl":"https://doi.org/10.1109/SKG.2010.72","url":null,"abstract":"This paper presents a new image segmentation approach by suing automatic threshold selection. This approach divides the image into 2 class. The best threshold is got when the separation between the interclass variance and the variance between clasters is the maximal. Experimental results show this new approach can segment images automatically and quickly.","PeriodicalId":105513,"journal":{"name":"2010 Sixth International Conference on Semantics, Knowledge and Grids","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125743091","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
扫码关注我们
求助内容：
应助结果提醒方式：