• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• 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.

• 한국전자거래학회:학술대회논문집
• /
• 한국전자거래학회 2003년도 종합학술대회 논문집
• /
• 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 .

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2004년도 봄 학술발표논문집 Vol.31 No.1 (B)
• /
• 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
• /
• 제18권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.

• 한국전자거래학회지
• /
• 제9권4호
• /
• pp.85-102
• /
• 2004

현재, 많은 연구가 진행되고 있는 시맨틱 웹 서비스 발견 기술은 DAML-S와 MIT의 Process Handbook 프로젝트의 온톨로지를 기반하고 있다. 하지만, 이러한 발견 기술들은 현재 상황에서 지능적으로 웹 서비스를 발견하기 위해서는 여러 가지 제약 상황을 가지고 있다. 따라서 본 논문에서는 지능적 웹 서비스 발견을 위해 시맨틱 웹 서비스 발견 기술에 이용되는 기존의 온톨로지를 분석하였으며, 기존의 온톨로지가 가지는 장점을 수용하면서 단점을 보완하는 시맨틱 웹 서비스 표현 모델과 지능적 웹서비스 발견이 가능하도록 질의 언어를 제안하였다.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제16권5호
• /
• pp.519-524
• /
• 2010

이 논문은 유비쿼터스 환경에서 사용자의 서비스 조합 요구를 만족시키기 위한 오퍼레이션 단위의 태스크 조합 방법을 제안한다. 이 방법은 서비스 컴포넌트 아키텍처를 따르며 태스크 조합 시 시스템의 자동화를 위해 시맨틱 웹을 활용한다. 또한, 태스크 조합을 지원하기 위한 태스크 온톨로지(universal Task Ontology)에 대해 소개한다. 태스크 온톨로지 u-TO에서는 태스크 간의 계층구조를 표현하고, 태스크를 관점(View)에 따라 분류함으로써 사용자가 보다 쉽게 자신의 태스크를 정의하고 태스크를 수행할 수 있는 오퍼레이션을 검색하고 활용할 수 있도록 하였다.