• The Journal of Society for e-Business Studies
• /
• v.9 no.3
• /
• pp.243-258
• /
• 2004

Building a domain-suited ontology, as a means to implement the Semantic Web, is widely believed to offer users the benefit of exploiting the semantic knowledge constrained in the application. Electronic Catalog, shortly e-Catalog, manages the information about the goods or conditions play an important role in e-commerce domain. Consequently, semantically enriched yet precise information by the ontology may elaborate the business transactions. In this paper, we analyze the semantic relationships embodied within the catalog domain, as the first step towards the ontological modeling of e-catalog. Exploring ontology should leverage not only the representation of semantic knowledge but also provide the inferencing capability for the model. We employ the EER(extended Entity Relationships) for the basic model. Each modeling construct can be directly translated by DL(Description Logics). Semantic constraints that can be hardly represented in EER are directly modeled in DL.

• The Journal of the Korea Contents Association
• /
• v.9 no.3
• /
• pp.1-8
• /
• 2009

This paper proposes a new document clustering system using fuzzy logic-based genetic algorithm (GA) and semantic vector expansion technology. It has been known in many GA papers that the success depends on two factors, the diversity of the population and the capability to convergence. We use the fuzzy logic-based operators to adaptively adjust the influence between these two factors. In traditional document clustering, the most popular and straightforward approach to represent the document is vector space model (VSM). However, this approach not only leads to a high dimensional feature space, but also ignores the semantic relationships between some important words, which would affect the accuracy of clustering. In this paper we use latent semantic analysis (LSA)to expand the documents to corresponding semantic vectors conceptually, rather than the individual terms. Meanwhile, the sizes of the vectors can be reduced drastically. We test our clustering algorithm on 20 news groups and Reuter collection data sets. The results show that our method outperforms the conventional GA in various document representation environments.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2006.06a
• /
• pp.53-90
• /
• 2006

• Korean Journal of Logic
• /
• v.17 no.2
• /
• pp.233-253
• /
• 2014

The Pinocchio paradox that Eldridge-Smith suggested is a version of the semantic paradox. But it is unique in the sense that this paradox does not contain a semantic predicate. Tarski's solution which appeals to the hierarchy of language and Kripke's para-completeness which accepts the third truth value cannot solve the Pinocchio paradox. This paper argues that Eldridge-Smith's trial to criticize semantical dialetheism is not successful and that the paradox implies the rule of the truth predicate is inconsistent. That is, the proper diagnosis to this paradox is that the Pinocchio principle should be considered to be potentially inconsistent, which suggests that semantic paradoxes such as the liar paradox arise because the rule of the truth-predicate is inconsistent. The Pinocchio paradox teaches us that consistent view of truth cannot be successful to solve the semantic paradoxes and that we should accept the inconsistent view of truth.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.609-610
• /
• 2006

This paper introduces a methodology for construction of ontology-based product knowledge Map. For CPC(Collaborative Product Commerce) environment, engineering application of ontology has been studied . However, there are no generic and comprehensive methodologies for ontology construction yet because of such problems: dependency on experience of ontologist and domain experts and insufficiency of detail stages or rules. To solve those problems, we propose a methodology to construct ontology from engineering documents in semi-automatic. We use middle-out strategy and term's axioms, sub-definitions, to build ontology map. 5-turple ontology structure, semantic network and First order logic (FOL) are used for ontology definition in this study.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.4
• /
• pp.438-451
• /
• 1994

A low complexity, fault detecting computer architecture for utilisation in programmable logic controllers is designed. The cyclic operating mode of PLCs and a specification level, graphical programming paradigm based on the interconnection of application oriented standard software function modules are architecturally supported. Thus, by design, there is no semantic gap between the programming and machine execution levels enabling the safety licensing of application software by an extremely simple, but rigorous method, viz, diverse back translation.

• Journal of Digital Convergence
• /
• v.11 no.3
• /
• pp.285-292
• /
• 2013

The method of recent information retrieval passes into an semantic search to provide more accurate results than keyword-based search. But in common user case, they are still accustomed to using existing keyword-based search. Hence they are hard to create a typed structured query language. In this paper, we propose to ontology knowledge-base scheme for query interpretation of these user. The proposed scheme was designed based on the OWL-DL for description logic reasoning, it can provide a richer representation of the relationship between the object by using SWRL(Semantic Web Rule Language). Finally, we are describe the experimental results of the similarity measurement for verification of a user query semantic interpretation.

• Journal of The Korean Association of Information Education
• /
• v.8 no.3
• /
• pp.353-360
• /
• 2004

World Wide Web is not more meaningless sea of information but is becoming the Semantic Web that provides many users with meaningful information. The starting point is the XML and metadata, RDF is a stopover which gives technique to relate arbitrary web resources. And now, the semantic and logic of web resources can be settled in the Ontology. A lot of educational multimedia web resources in Korea have produced their metadata with KERIS's KEM(Korea Educational Metadata). Therefore our country have to start the study of the semantic and logic in web resources. But, many researchers in Korea are more eager to study Dublin Core's DC and SCORM's LOM metadata specification than KEM. Thus the study of method about sharing and integrating these three metadata specifications should be performed before the study of semantic and logic in web resources in Korea. We design the Ontology to integrate these three metadata specifications and implement the prototype system using this Ontology. These three metadata have some elements that have same labels and meanings, and other elements have different labels and same meanings. To match these different labels which have same meanings, we adapted the one-to-one mapping technique in designing our Ontology. This designed Ontology was imported as "integrated schema" in our prototype searching system to integrate three different metadata in databases. Moreover we know that the more specific property design of class in Ontology was needed in order to provide users with more informed searching results such as synonym, antonym, hierarchy and associations.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.238-246
• /
• 2011

This paper proposes a new semantic representation and its associated similarity measure. The representation expresses textual context observed in a context of a certain term as a network where nodes are terms and edges are the number of cooccurrences between connected terms. To compare terms represented in networks, a graph kernel is adopted as a similarity measure. The proposed representation has two notable merits compared with previous semantic representations. First, it can process polysemous words in a better way than a vector representation. A network of a polysemous term is regarded as a combination of sub-networks that represent senses and the appropriate sub-network is identified by context before compared by the kernel. Second, the representation permits not only words but also senses or contexts to be represented directly from corresponding set of terms. The validity of the representation and its similarity measure is evaluated with two tasks: synonym test and unsupervised word sense disambiguation. The method performed well and could compete with the state-of-the-art unsupervised methods.

• Asia pacific journal of information systems
• /
• v.7 no.1
• /
• pp.85-97
• /
• 1997

This paper is concerned with knowledge representation schemes best suited for human resource management (HRM) problem domains including human resource planing, selection, placement, compensations, performance evaluation, training and labor-management relations. In order to suggest the scheme we consider two research gods. First, we evaluate and prioritize. The knowledge representation techniques of frames rules, semantic nets and predicate logic that hove been recommended to managerial domains. The combined Analytic Hierarchy Process technique is employed to combine individual judgments effectively between two different expert groups. As a result if we are to select a single knowledge representation technique, a frame representation is best for most HRM domains and to combine frames with others is another choice. Second as a strategy for knowledge representation schemes we show some examples for each damn in terms of labeled semantic nets and two types of rules derived from the semantic nets. We propose nine knowledge components as ontologies. The labeled semantic nets con provide some benefits compared with conventional one. More clearly definea node rode information maces it easy to find the ac information. In the rule sets, the variables are the node of the semantic nets. The consistency of rules is validated by the relationship of the knowledge components.