• Journal of the Korean Society for information Management
• /
• v.13 no.2
• /
• pp.5-18
• /
• 1996

For the construction of thesaurus, a thesaurus management system is needed which can process dynamic variations fast and exactly such as input. correction and deletion of words, and definition of new relationship between words. In this paper, I developed a thesaurus management system based on the object-oriented technique and GUI(graphic user interface) screen, and to enhance the effectiveness of information retrieval. I put emphasis on the expansion of synonym, English and Korean words containing the same concept.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.64-78
• /
• 2000

In this paper, we design and implement a system for managing domain specific thesauri, where object-oriented paradigm is applied to thesaurus construction, concept browsing and query-based reference. This system provides an objected-oriented mechanism to assist domain experts in constructing thesauri; it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain eIn this paper, we design and implement a system for managing domain specific thesauri, where object oriented paradigm is applied to thesaurus construction, concept browsing and query based reference. This system provides an objected mechanism to assist domain experts in constructing thesauri: it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed. This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain experts caused from the exhaustive specification of individual relationship. This system also provides an abstracted browsing and a query based reference, which allow users to easily verify thesaurus terms before they are used in usual boolean queries. The verification is made by actively searching for them in the thesaurus. Reference queries and abstracted browsing views facilitate this searching. The facility is indispensable especially when precision counts for much.

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.168-179
• /
• 2000

In reusable component retrieval systems with facet-based schemes, facet queries are generally used for representing the characteristics of components relevant to users. This paper proposes an expanded facet query equipped with an object-based thesaurus to precisely formulate user's intents. To evaluate the query, a component retrieval system is also designed and implemented. For exactly retrieving the components, user's query should include relevant facet values capable of fully specifying their characteristics. However, simply listing a series of facet values directly inputted by users, conventional queries fails to precisely represent user's intents. Our query, called expanded facet query, employs fuzzy boolean operators and object-based thesaurus; the former logically expresses the fuzzy connectives between facet queries and required components, whereas the latter helps users appropriately select the specific facet values into the query. A thesaurus query is provided to recommend the relevant facet values with their fuzzy degrees from the thesaurus as well. Furthermore, our retrieval system can automatically formulate queries with the recommended facet values, if necessary.

• Journal of KIISE:Software and Applications
• /
• v.31 no.9
• /
• pp.1204-1217
• /
• 2004

Numerous statistical and machine learning techniques have been studied for automatic text classification. However, because they train the classifiers using only feature vectors of documents, ambiguity between two possible categories significantly degrades precision of classification. To remedy the drawback, we propose a new method which incorporates relationship information of categories into extant classifiers. In this paper, we first perform the document classification using the k-NN classifier which is generally known for relatively good performance in spite of its simplicity. We employ the relationship information from an object-based thesaurus to reduce the ambiguity. By referencing various relationships in the thesaurus corresponding to the structured categories, the precision of k-NN classification is drastically improved, removing the ambiguity. Experiment result shows that this method achieves the precision up to 13.86% over the k-NN classification, preserving its recall.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.303-317
• /
• 2002

In this paper, we design and implement E-COIRS enabling users to query with concepts and image features used for further refining the concepts. For example, E-COIRS supports the query "retrieve images containing black home appliance to north of reception set. "The query includes two types of concepts: IS-A and composite. "home appliance"is an IS-A concept, and "reception set" is a composite concept. For evaluating such a query. E-COIRS includes three important components: a visual image indexer, thesauri and a query processor. Each pair of objects in an mage captured by the visual image indexer is converted into a triple. The triple consists of the two object identifiers (oids) and their spatial relationship. All the features of an object is referenced by its old. A composite concept is detected by the triple thesaurus and IS-A concept is recolonized by the fuzzy term thesaurus. The query processor obtains an image set by matching each triple in a user with an inverted file and CS-Tree. To support efficient storage use and fast retrieval on high-dimensional feature vectors, E-COIRS uses Cell-based Signature tree(CS-Tree). E-COIRS is a more advanced content-based image retrieval system than other systems which support only concepts or image features.

• The KIPS Transactions:PartD
• /
• v.10D no.5
• /
• pp.753-762
• /
• 2003

Many Methodologies have proposed for component retrieval. Among them, thesaurus concept has introduced for similar component retrieval. This paper classified classes by concept according to inheritance relation for efficient retrieval of component, and applied fuzzy logic to thesaurus method and constructed object-oriented thesaurus. Proposed method could express category between concepts automatically, and calculate fuzzy degree between classes by comparing matching and mismatching degree to each class and category and construct thesaurus. Component retrieval is that using classes of component, candidate components are retrieved according to priority order using fuzzy similarity. Also, we improved retrieval performance by thesaurus greatly, setting critical of most suitable through simulation.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.2 no.1
• /
• pp.73-79
• /
• 2009

Analyze semantic of files recorded in the user's computer file system based on C++ program language which pursue modularization program and object-oriented programming language. And this refers to it, it design that clustering semantic of filename with thesaurus for user convenience. WTPM makes User Write Files into Cluster with thesaurus semantic structure and reserved words. WTPM process has designed for Icon file's display Mashup structure and implemented by automation algorithm of classification.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.275-278
• /
• 2012

웹 서비스는 SOA를 웹 상에서 구현한 기술로, 서비스들간의 느슨한 결합을 실현함으로써 재사용 가능한 서비스들의 활용을 극대화 한다. 본 논문에서는 확장 객체 기반 시소러스(eXtended Object-based Thesaurus, XOT)를 사용하여 적응 가능한 오케스트레이션 명세가 가능한 개념 기반 오케스트레이션 기법을 제안한다. XOT는 재사용 가능한 서비스들이 속하는 범주들을 개념으로 표현하고 상호 합성 패턴 관계를 포함한 개념간 상관 관계를 명시한 일종의 지식베이스이다. 이 기법은 오케스트레이션에 참여하는 복합 서비스를 포함한 여러 다양한 서비스들을 구체적으로 명세하는 대신 XOT 내의 개념들로 변수화 하고, 이들을 오케스트레이션 시 적절한 재사용 가능한 서비스 또는 구성 서비스들의 조합으로 대체시킴으로써 서비스들의 재사용성을 획기적으로 개선할 수 있다.

• Journal of KIISE:Software and Applications
• /
• v.34 no.9
• /
• pp.828-847
• /
• 2007

In this paper we propose a formal data model of an object-based thesaurus system supporting multi-dimensional facets. According to facets reflecting on respective user perspectives, it supports systematic construction, browsing, navigating and referencing of thesauri. Unlike other faceted thesaurus systems, it systematically manages its complexity by appropriately ing sophisticated conceptual structure through visualized browsing and navigation as well as construction. The browsing and navigation is performed by dynamically generating multi-dimensional virtual thesaurus hierarchies called "faceted thesaurus hierarchies." The hierarchies are automatically constructed by combining facets, each representing a dimension of view. Such automatic construction may make it possible the flexible extension of thesauri for they can be easily upgraded by pure insertion or deletion of facets. With a well defined set of self-referential queries, the thesauri can also be effectively referenced from multiple view points since they are structured by appropriately interpreting the semantics of instances based on facets. In this paper, we first formalize the underlying model and then implement its prototype to demonstrate its feasibility.

• The Journal of the Korea Contents Association
• /
• v.6 no.3
• /
• pp.20-27
• /
• 2006

In this paper we constructed semantic net that can efficiently conform retrieval and reuse of object-oriented source code. In order that initial relevance of semantic net was constructed using thesaurus to represent concept of object-oriented inheritance between each node. Also we made up for the weak points in spreading activation method that use to activate node and line of semantic net and to impulse activation value. Therefore we proposed the method to enhance retrieval time and to keep the quality of spreading activation.