• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.267-272
• /
• 2007

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching fur expanding results from an exact matching engine to query the OWL MIT Process Handbook. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We perform retrieval experiments to compare the performance of the devised similarity algorithms.

• Proceedings of the CALSEC Conference
• /
• 2003.09a
• /
• pp.191-196
• /
• 2003

The Semantic web service is able to intelligently discover, execute, composite and monitor the Web Service. It constructs the ontology on Web Service and describes the Semantic Markup in the machine-readable form. The currently developing technologies of the Semantic Web Service discovery are DAML-S matchmaker in Carnegie Mellon University, Process Handbook in MIT and etc. In this paper, we propose the ontology language based on Topic Maps that supports the benefits and solves the problems of the Semantic Web Service discovery technologies .

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.109-111
• /
• 2004

대표적인 시맨틱 웹 서비스 발견 기술은 OWL-S와 MIT의 Process Handbook이 있다. 그러나. OWL-S는 개발 초기 단계이기 때문에, 아직 효과적인 웹 서비스 발견을 제공하기에는 몇 가지 제약 조건을 가지고 있다. 예를 들어. 정보 전송을 위한 제악 조건과 실행에 따른 상태 변환 정보를 정의하고 있지 않다. 또한. 사용자가 원하는 프로세스들의 시맨틱 정보들을 정의하고 있지 않다. 반면, MIT Process Handbook은 OWL-S와 같이 서비스 모델에 대한 상세한 정보들을 정의하고 있지 않아, 서비스 작성에 필요한 서비스들을 찾기가 어렵다. 그러므로, 본 논문에서는 Topic Maps 기반의 TM-S(Topic Maps for Service)를 제안하였다.

• Asia pacific journal of information systems
• /
• v.18 no.1
• /
• pp.79-96
• /
• 2008

One of the roles of the Semantic Web services is to execute dynamic intra-organizational services including the integration and interoperation of business processes. Since different organizations design their processes differently, the retrieval of similar semantic business processes is necessary in order to support inter-organizational collaborations. Most approaches for finding services that have certain features and support certain business processes have relied on some type of logical reasoning and exact matching. This paper presents our approach of using imprecise matching for expanding results from an exact matching engine to query the OWL(Web Ontology Language) MIT Process Handbook. MIT Process Handbook is an electronic repository of best-practice business processes. The Handbook is intended to help people: (1) redesigning organizational processes, (2) inventing new processes, and (3) sharing ideas about organizational practices. In order to use the MIT Process Handbook for process retrieval experiments, we had to export it into an OWL-based format. We model the Process Handbook meta-model in OWL and export the processes in the Handbook as instances of the meta-model. Next, we need to find a sizable number of queries and their corresponding correct answers in the Process Handbook. Many previous studies devised artificial dataset composed of randomly generated numbers without real meaning and used subjective ratings for correct answers and similarity values between processes. To generate a semantic-preserving test data set, we create 20 variants for each target process that are syntactically different but semantically equivalent using mutation operators. These variants represent the correct answers of the target process. We devise diverse similarity algorithms based on values of process attributes and structures of business processes. We use simple similarity algorithms for text retrieval such as TF-IDF and Levenshtein edit distance to devise our approaches, and utilize tree edit distance measure because semantic processes are appeared to have a graph structure. Also, we design similarity algorithms considering similarity of process structure such as part process, goal, and exception. Since we can identify relationships between semantic process and its subcomponents, this information can be utilized for calculating similarities between processes. Dice's coefficient and Jaccard similarity measures are utilized to calculate portion of overlaps between processes in diverse ways. We perform retrieval experiments to compare the performance of the devised similarity algorithms. We measure the retrieval performance in terms of precision, recall and F measure? the harmonic mean of precision and recall. The tree edit distance shows the poorest performance in terms of all measures. TF-IDF and the method incorporating TF-IDF measure and Levenshtein edit distance show better performances than other devised methods. These two measures are focused on similarity between name and descriptions of process. In addition, we calculate rank correlation coefficient, Kendall's tau b, between the number of process mutations and ranking of similarity values among the mutation sets. In this experiment, similarity measures based on process structure, such as Dice's, Jaccard, and derivatives of these measures, show greater coefficient than measures based on values of process attributes. However, the Lev-TFIDF-JaccardAll measure considering process structure and attributes' values together shows reasonably better performances in these two experiments. For retrieving semantic process, we can think that it's better to consider diverse aspects of process similarity such as process structure and values of process attributes. We generate semantic process data and its dataset for retrieval experiment from MIT Process Handbook repository. We suggest imprecise query algorithms that expand retrieval results from exact matching engine such as SPARQL, and compare the retrieval performances of the similarity algorithms. For the limitations and future work, we need to perform experiments with other dataset from other domain. And, since there are many similarity values from diverse measures, we may find better ways to identify relevant processes by applying these values simultaneously.

• The Journal of Society for e-Business Studies
• /
• v.9 no.4
• /
• pp.85-102
• /
• 2004

Currently, developed technologies for semantic web services discovery are based on ontologies. These ontologies are DAML-S(DARPA Agent Markup Language for Services) and Process Handbook Project of MIT. These technologies have some problems for intelligent web services discovery. So, in this paper we analyzed those ontologies and proposed TM-S, Topic Maps for Services. TM-S is the presentation model for semantic web services. And TM-S includes benefits and complements weaknesses of those ontologies. And we proposed TMS-QL, TM-S Query Language. TMS-QL is query language for intelligent web services discovery. At last, we designed and implemented intelligent web service discovery system that deals TM-S ontology and TMS-QL

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.5
• /
• pp.519-524
• /
• 2010

In this paper, we will introduce our approach for composing operation based on user tasks. It is based on Service Component Architecture (SCA). In addition, we developed ontology based on OWL and the MIT process handbook, called u-TO(universal task ontology), which can be used for users describing and specifying semantically their needs. We represent the hierarchy of tasks, and classify tasks according to views in u-TO. It aims at facilitating the modeling of complex demands or systems without regarding details of technical aspects of underlying infrastructure.