• Journal of the Korea Society of Computer and Information
• /
• v.18 no.12
• /
• pp.91-101
• /
• 2013

One issue with keyword search in general is its ambiguity which can ultimately impact the effectiveness of the search in terms of the quality of the search results. This ambiguity is primarily due to the ambiguity of the contextual meaning of each term in the query. In addition to the query ambiguity itself, the relationships between the keywords in the search results are crucial for the proper interpretation of the search results by the user and should be clearly presented in the search results. We address the keyword search ambiguity issue by adapting some of the existing approaches for keyword mapping from the query terms to the schema terms/instances. The approaches we have adapted for term mapping capture both the syntactic similarity between the query keywords and the schema terms as well as the semantic similarity of the two and give better mappings and ultimately 50% raised accurate results. Finally, to address the last issue of lacking clear relationships among the terms appearing in the search results, our system has leveraged semantic web technologies in order to enrich the knowledgebase and to discover the relationships between the keywords.

• Journal of the Korean Home Economics Association
• /
• v.39 no.7
• /
• pp.125-144
• /
• 2001

The purpose of this study is to make a preliminary investigation about the diagnostic process for marital preparation against future divorce which will be necessary for developing tools for the process. Delphi tests have been twice held among 23 professionals regarding the concept of marital diagnosis and the areas of marital preparation to be estimated including definitions of the marital preparation for marriage and the status in which marriage has been prepared, and the categorization of the preparation The result of the study is as follows : Firstly, the concept of marital preparation is comprehensive, for it does include various kinds of preparation necessary for adjustment to marital life except the preparation for wedding ceremony. Secondly, the status in which marriage has been prepared can be divided into individual preparation, a couple's relational preparation, and preparation for marital life. Thirdly, premarital preparation education or counselling will be provided for young persons who are not in status of marital preparation. The areas of marital preparation to be estimated are maturity, independence from parents, and good health in terms of individual preparation, and the depth of love, understanding each other, similarity, harmonization, supplementation, capacity of communication, self-control, and all that sort of thing in terms of relational preparation, sex, views about marriage, information about marital life, role division, giving birth to child and rearing, financial management, and understanding both families of husband and wife.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.752-759
• /
• 2022

The instantiation of spaces as a discrete entity allows users to utilize BIM models in a wide range of analyses. However, in practice, their utility has been limited as spaces are erroneously entered due to human error and often omitted entirely. Recent studies attempted to automate space allocation using artificial intelligence approaches. However, there has been limited success as most studies focused solely on the use of geometric features to distinguish spaces. In this study, in addition to geometric features, semantic relations between spaces and elements were modeled and used to improve space classification in BIM models. Graph Convolutional Networks (GCN), a deep learning algorithm specifically tailored for learning in graphs, was deployed to classify spaces via a similarity graph that represents the relationships between spaces and their surrounding elements. Results confirmed that accuracy (ACC) was +0.08 higher than the baseline model in which only geometric information was used. Most notably, GCN was able to correctly distinguish spaces with no apparent difference in geometry by discriminating the specific elements that were provided by the similarity graph.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.25-34
• /
• 2009

As the trend of the Web is changing toward 'Web 2.0', OpenAPIs, Web 2.0's core technology, are used in many web sites. In the past, services in websites are used in its own, but recently it is possible to use services in other websites by using OpenAPI. In u-GIS many vendors also can provide combined service by using OpenAPI. There are already lots of OpenAPIs and the numer of OpenAPI increases very fast. So it is difficult to find a service that we want to use, and also difficult to find services for mashup. In this paper, we developed retrieval methods for OpenAPIs and mashup capable services based on similarity. First we define the integrated service information model to cover various protocols of OpenAPI, then developed a retrieval methods based on it. By implementing system according these methods by using relational database and JSP, we prove that the system can provide an ranked result sets based on similarity, OpenAPI's integration retrieval results and mashup capable service retrieval results.

• Journal of the Korea Society for Simulation
• /
• v.15 no.3
• /
• pp.115-124
• /
• 2006

XML is rapidly becoming technologies for information exchange and representation. It causes many research issues such as semantic modeling methods, security, conversion far interoperability with other models, and so on. Especially, the most important issue for its practical application is how to achieve the interoperability between XML model and relational model. Until now, many suggestions have been proposed to achieve it. However several problems still remain. Most of all, the exiting methods do not consider implicit referential integrity relations, and it causes incorrect data delivery. One method to do this has been proposed with the restriction where one semantic is defined as only one same name in a given database. In real database world, this restriction cannot provide the application and extensibility. This paper proposes a noble conversion (RDB-to-XML) algorithm based on the similarity checking technique. The key point of our method is how to find implicit referential integrity relations between different field names presenting one same semantic. To resolve it, we define an enhanced implicity referentiai integrity relations extraction algorithm based on a widely used ontology, WordNet. The proposed conversion algorithm is more practical than the previous-similar approach.

• The Journal of Society for e-Business Studies
• /
• v.14 no.2
• /
• pp.95-116
• /
• 2009

Ontologies have provided supports in integrating heterogeneous and distributed information. More and more ontologies and tools have been developed in various domains. However, building ontologies requires much time and effort. Therefore, ontologies need to be shared and reused among users. Specifically, finding the desired ontology from an ontology repository will benefit users. In the past, most of the studies on retrieving and ranking ontologies have mainly focused on lexical level supports. In those cases, it is impossible to find an ontology that includes concepts that users want to use at the semantic level. Most ontology libraries and ontology search engines have not provided semantic matching capability. Retrieving an ontology that users want to use requires a new ontology selection and ranking mechanism based on semantic similarity matching. We propose an ontology selection and ranking model consisting of selection criteria and metrics which are enhanced in semantic matching capabilities. The model we propose presents two novel features different from the previous research models. First, it enhances the ontology selection and ranking method practically and effectively by enabling semantic matching of taxonomy or relational linkage between concepts. Second, it identifies what measures should be used to rank ontologies in the given context and what weight should be assigned to each selection measure.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.141-144
• /
• 2007

일반적으로 의사결정의 대상이 되는 현실 시스템은 매우 가변적 (variable)이며 때로는 많은 불확실성(uncertainty)이 포함된 상황에 놓일 수 있다. 이러한 문제의 처리를 위한 통계적 방법으로 유의수준이나 확신도, 민감도 분석 등이 사용된다. 본 논문에서는 먼저 근접관계 행렬에서 근접도를 구하는 방법으로 상대적 해밍거리와 max-min방법을 이용한 다음, 다중임계치를 사용하여 최적구간분할을 하는 방법을 제안한다. 결과적으로 max-min방법을 이용하여 다중임계치을 적용한 근접관계의 분류가 상대적 해밍거리로 근접도를 구하여 다중임계치를 구하는 방법보다 계산과정이 더 간단하고 명확하며 분할과정을 줄일 수 있고 최적의 의사결정에 효율적이라는 것을 알 수 있다.

• Korean Institute of Interior Design Journal
• /
• v.21 no.5
• /
• pp.77-84
• /
• 2012

Single formative language created by the standardization of industrial society carries a cell constructive aspect. Such space structural form made gigantic buildings, which has a symbolism as an independent object. Such space shows a morphological symbolism by public preference but it did not establish essential meaning of a shape or concentrated relation. In this regard, this paper tries to show organic similarity of structural formality of small commercial space (patterned space), which was made by the continuity of concentrated patterns not an object of dualistic unit features. Therefore, this study analyzed the cultural, commercial and public space based upon systematical concept and features. Systematical space formality that makes multilateral relation between human, environment and a thing is a concentrated view point by relational features not by the cluster displayed by hierarchical features. Systematical space of small patterned space emphasized its appropriateness of expansion and creating diversified spaces unlike gigantic symbolic buildings.

• The Journal of the Korea Contents Association
• /
• v.6 no.10
• /
• pp.25-33
• /
• 2006

For semantic retrieval in semantic web environment, it is an important factor to manage and manipulate distributed resources. Ontology is essential for efficient search in distributed resources, but it is almost impossible to construct an unified ontology for all distributed resources in the web. In this paper, we assumed that most information in the web environment exist in the form of RDBMS, and propose a matching method between domain ontology and the existing RDBMS tables for semantic retrieval. Most previous studies about matching between RDBMS tables and domain ontology have extracted a local ontology from RDBMS tables at first, and conducted the matching between the local ontology and domain ontology. However in the processing of extracting a local ontology, some problems such as losing domain information can be occurred since its correlation with domain ontology has not been considered at all. In this paper, we propose a methods to prevent the loss of domain information through the similarity measure between instances of RDBMS tables and instances of ontology. And using the relational information between RDBMS tables and the relational information between classes in domain ontology, more efficient instance-based matching becomes possible.

• Journal of KIISE:Software and Applications
• /
• v.33 no.7
• /
• pp.646-654
• /
• 2006

Directory searching and index searching methods are two main methods in web search engines. Both of the methods are applied to most of the well-known Internet search engines, which enable users to choose the other method if they are not satisfied with results shown by one method. That is, Index searching tends to come up with too many search results, while directory searching has a difficulty in selecting proper categories, frequently mislead to false ones. In this paper, we propose a novel method in which a category hierarchy is dynamically constructed. To do this, a category is regarded as a fuzzy set which includes keywords. Similarly extensible subcategories of a category can be found using fuzzy relational products. The merit of this method is to enhance the recall rate of directory search by expanding subcategories on the basis of similarity.