• Journal of Intelligence and Information Systems
• /
• v.10 no.2
• /
• pp.1-13
• /
• 2004

This paper presents a method for the multilingual product retrieval agent through XML and the semantic networks in e-commerce. Retrieval for products is an important process, since it represents interfaces of the customer contact to the e-commerce. Keyword-based retrieval is efficient as long as the product information is structured and organized. But when the product information is expressed across many online shopping malls, especially when it is expressed in different languages with cultural backgrounds, buyers' product retrieval needs language translation with ambiguities resolved in a specific context. This paper presents a RDF modeling case that resolves semantic problems in the representation of product information and across the boundaries of language domains. With adoption of UNSPSC code system, this paper designs and implements an architecture for the multilingual product retrieval agents. The architecture is based on the central repository model of product catalog management with distributed updating processes. It also includes the perspectives of buyers and suppliers. And the consistency and version management of product information are controlled by UNSPSC code system. The multilingual product names are resolved by semantic networks, thesaurus and ontology dictionary for product names.

• Journal of KIISE:Databases
• /
• v.35 no.4
• /
• pp.333-344
• /
• 2008

In recent years, the web services composition has received much attention. By web services composition, we mean providing a new service that does not exist on the repository. In this paper, we propose a new system called PSR for web services composition search using a relational database. We also propose algorithms for pre-computing web services composition using joins and indices. We store ontologies from web services in RDBMS, so that the PSR system returns web services composition in order of similarity with user query through the degree of the ontology matching. We demonstrated that our pre-computing web services composition approach in RDBMS yields lower execution time and good scalability when handling a large number of web services and user queries.

• Journal of Korea Spatial Information System Society
• /
• v.12 no.1
• /
• pp.100-104
• /
• 2010

Recently with advent of Web 2.0, RESTful Web Services are becoming increasing trend to emphasize Web as platform. There are already many services and the number of service increases in very fast pace. So it is difficult to find the service what we want by keyword based search. To solve this problem, we developed the search method using sem antic technologies about RESTful Web Services. For that, first we define the system structure and model the description format based on the integrated search system for OpenAPIs, and then we add Semantic Markup (tagging, semantic annotation) on the HTML description pages. Next we extract RDF document from them and store it in service repository. Based on the keywords that are extended by means of ontology, the developed system provides more purified and extended results than similarity-based keyword searching system.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.31 no.1
• /
• pp.379-392
• /
• 2020

The purpose of this study is to present technical elements to improve the data utilization of the ISNI Korea Consortium, which is operated by the National Library of Korea, which is responsible for the registration of Korean names. The ISNI Korea Consortium aims to register various creation-related information in addition to bibliographic-related individual and organization name information. To this end, this study examines the ISNI Korea consortium, which is a data provider's consultative body, among other things, the metadata status of copyright organizations and the linked data specification of ISNI. As a result, data acquisition, refining, storage, identifier management, consortium metadata management, five in total, and RDF data management (repository) in terms of linked data, RDF data issuance, RDF data retrieval, RDF data inquiry, RDF data Eight technical elements, including download, ontology inquiry, standard term inquiry and mapping information management, were derived.

• Journal of KIISE
• /
• v.42 no.1
• /
• pp.54-67
• /
• 2015

Nowadays, studies on the fusion of Semantic Web technologies are being carried out to promote the interoperability and value of sensor data in an IoT environment. To accomplish this, the semantic translation of sensor data is essential for convergence with service domain knowledge. The existing semantic translation technique, however, involves translating from static metadata into semantic data(RDF), and cannot properly process real-time and large-scale features in an IoT environment. Therefore, in this paper, we propose a technique for translating large-scale streaming sensor data generated in an IoT environment into semantic data, using real-time and parallel processing. In this technique, we define rules for semantic translation and store them in the semantic repository. The sensor data is translated in real-time with parallel processing using these pre-defined rules and an ontology-based semantic model. To improve the performance, we use the Apache Storm, a real-time big data analysis framework for parallel processing. The proposed technique was subjected to performance testing with the AWS observation data of the Meteorological Administration, which are large-scale streaming sensor data for demonstration purposes.

• 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.