• 한국정보시스템학회지:정보시스템연구
• /
• 제14권3호
• /
• pp.37-47
• /
• 2005

Mining of association rules is to find associations among data items that appear together in some transactions or business activities. As of today, algorithms for association rule mining, as well as for other data mining tasks, are mostly applied to relational databases. As XML being adopted as the universal format for data storage and exchange, mining associations from XML data becomes an area of attention for researchers and developers. The challenge is that the semi-structured data format in XML is not directly suitable for traditional data mining algorithms and tools. In this paper we present an encoding method to encode XML tree-nodes. This method is used to store the XML data in Value Table and Transaction Table that can be easily accessed via indexing. The hierarchical relationship in the original XML tree structure is embedded in the encoding. We applied this method to association rules mining of XML data that may have missing data.

• 대한한의학원전학회지
• /
• 제32권1호
• /
• pp.105-116
• /
• 2019

Objectives : There are many secluded Chinese characters - so called Byeokja (僻字) in ancient classic literature, and Chinese characters that are not registered in Unicode and Variant characters (heterogeneous characters) that cannot be found in the current font sets often appear. In order to register all possible Chinese characters including such characters as units of information exchange, this study attempts to propose a method to encode the morphological information of Chinese characters according to certain rules. Methods : This study suggests the methods to encode the connection between the nodules constituting the Chinese character and the coordinates of the nodules. In addition to that, rules for expressing information about curves, expressions of aspect ratios of characters, rules for minimizing coordinate lines, and rules for expressing aggregation status of character components are added. Results : Through the proposed method, it is possible to generate codes of a certain length by extracting only information expressing the morphological configuration of characters. Conclusions : The method of character encoding proposed in this study can be used to distinguish variant characters with small variations in Byeokja, new Chinese characters and character strokes and to store and search them.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1995년도 추계학술대회 95 KFIS Workshop Realization of Human Friendly System Based on Soft Computiong Techniques
• /
• pp.124-140
• /
• 1995

The merit of fuzzy rule based systems stems from their capability of encoding qualitative knowledge of experts into quantitative rules. Recent advancement in automatic tuning or self-organization of fuzzy rules from experimental data further enhances their power, allowing the integration of the top-down encoding of knowledge with the bottom-up learning of rules. In this paper, methods of self-organizing fuzzy rules and of performing defuzzification and inference is presented based on a multi-resolution radial basis function network. The network learns an arbitrary input-output mapping from sample distribution as the union of hyper-ellipsoidal clusters of various locations, sizes and shapes. The hyper-ellipsoidal clusters, representing fuzzy rules, are self-organized based of global competition in such a way as to ensute uniform mapping errors. The cooperative interpolation among the multiple clusters associated with a mapping allows the network to perform a bidirectional many-to-many mapping, representing a particular from of defuzzification. Finally, an inference engine is constructed for the network to search for an optimal chain of rules or situation transitions under the constraint of transition feasibilities imposed by the learned mapping. Applications of the proposed network to skill acquisition are shown.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.987-990
• /
• 1998

An optical adder for a modified signed-digit(MSD) number system using joint spatial encoding method is proposed. In order to minimize the numbers of symbolic substitution rules, nine input patterns were divided into five groups of the same addition results. For recognizing the input reference patterns, masks and reference patterns without any other spatial operations are used. This adder is implemented by smaller system in size than a conventional adder.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.646-651
• /
• 1998

Fuzzy control has been used successfully in many practical applications. In traditional methods, experience and control knowledge of human experts are needed to design fuzzy controllers. However, it takes much time and cost. In this paper, an automatic design method for fuzzy controllers using genetic algorithms is proposed. In the method, we proposed an effective encoding scheme and new genetic operators. The maximum number of linguistic terms is restricted to reduce the number of combinatorial fuzzy rules in the research space. The proposed genetic operators maintain the correspondency between membership functions and control rules. The proposed method is applied to a cart centering problem. The result of the experiment has been satisfactory compared with other design methods using genetic algorithms.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 학술대회지
• /
• pp.723-728
• /
• 2004

Recently, because of the extensive use of geographic information in the various fields, the requirement for the easy circulation and utilization of the various geographic information among the individuals, organizations, societies and countries is raised. In order to support the interoperability of the heterogeneous geographic information in the various fields, OGC(Open GIS Consortium) proposed the GML(Geography Markup Language) specification that defines the XML encoding rule about the heterogeneous geographic information. In addition, ISO/TC 211 adopted the GML specification to make it as the international standard. Therefore, in this paper, we first analyzed the GML 3.0 specification in detail that can support the interoperability of the heterogeneous geographic information. And then we suggested and applied the mapping rule that define the encoding method to improve the encoding process easily and efficiently. Finally, we designed and implemented the GML 3.0 encoding system using the mapping rule to encode the geographic information that was constructed in spatial databases into the GML 3.0 document. Especially, we used ZEUS as a spatial database system to test our encoding system in this paper.

• 한국지능시스템학회논문지
• /
• 제2권2호
• /
• pp.42-60
• /
• 1992

An adaptive fuzzy system can efficiently classify subimages into four categories according to image activity level for image data compression. The system estimates fuzzy rules by clustering input-output data generated from a given adaptive transform image coding process. The system encodes different images without modification and reduces side information when encoding multiple images. In the second part, a fuzzy system estimates optimal bit maps for the four subimage classes in noisy channels assuming a Gauss-Markov image model. The fuzzy systems respectively estimate the sampled subimage classification and the bit-allocation processes without a mathematical model of how outputs depend on inputs and without rules articulated by experts.

• Journal of applied mathematics & informatics
• /
• 제27권5_6호
• /
• pp.1481-1488
• /
• 2009

A construction of Cartesian authentication codes over unitary geometry is presented and its size parameters are computed. Assuming that the encoding rules are chosen according to a uniform probability distribution, the probabilities of success for different types of attacks are also computed.

• 한국정보과학회논문지:시스템및이론
• /
• 제35권4호
• /
• pp.178-185
• /
• 2008

본 연구에서는 패턴을 갖는 항 개서 체계(TRS, Term Rewriting Systems)의 룰을 람다 계산법으로 코딩하는 변환 방법을 제시한다. Böhm의 분리성 이론에 따라 차별화된 룰 패턴을 갖는 분리 시스템은 람다 계산법으로 변환될 수 있음을 보인다. 또한, Böhm 동등 부류의 특성을 적용함으로써, 이 변환은 디폴트 룰로 된 개서 시스템을 코딩할 수 있으며 TRS의 '의미 없는 팀'들을 동일한 람다 팀으로 해석할 수 있도록 한다.

• 한국공간정보시스템학회 논문지
• /
• 제5권1호
• /
• pp.27-38
• /
• 2003

최근 여러 분야에서 지리공간 정보의 활용이 증가함에 따라 기존에 각자 구축해 두었던 각종 지리 공간 정보를 개인.조직 나아가 사회 국가 간에 자유롭게 유통 및 활용하려는 요구가 증가되고 있다. 이를 위해 OGC에서는 다양한 분야의 지리공간 정보를 손쉽게 상호 운용하기 위해 이질적인 환경의 지리공간 정보를 XML로 엔코딩하여 다양한 분야에 사용 가능하도록 하는 GML 명세를 제시하였으며, ISO/TC 211에서도 GML을 채택하여 국제 표준으로 추진 중에 있다. 따라서, 본 논문에서는 지리공간 정보 상호 운용 방법인 GML 3.0을 분석하고, 엔코딩 과정을 좀더 간편하고 효율적으로 바꾸기 위해 엔코딩 방법을 정의하는 매핑 규칙을 작성하여 활용하였다. 마지막으로 공간 데이타베이스에 구축된 지리공간 정보를 GML 3.0 문서로 엔코딩 할 수 있도록 매핑 규칙을 활용한 GML 3.0 엔코딩 시스템을 설계 및 구현하였다. 특히, 본 논문에서는 엔코딩 시스템을 테스트하기 위해 공간 데이타베이스 시스템으로 ZEUS를 사용하였다.