• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.526-535
• /
• 2005

Ontology is a methodology on describing specific concepts and their relationships, and it is being considered important more and more as semantic web and variety of knowledge management systems are being highlighted. Ontology uses the relationships among concerts to represent some concrete semantics of specific concept. When we want to get some useful information from ontology, we severely have to process the transitive relationships because most of relationships among concepts represent transitivity. Technically, it causes recursive calls to process such transitive closure queries with heavy costs. This paper describes the efficient technique for processing transitive closure queries in ontology. To the purpose of it, we examine some approaches of current systems for transitive closure queries, and propose a technique by graph labeling scheme. Basically, we assume large size of ontology, and then we show that our approach gives relative efficiency in processing of transitive closure, queries.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.163-181
• /
• 2005

We study some properties of intuitionistic fuzzy equivalence relations. Also we introduce the concepts of intuitionistic fuzzy transitive closures and level sets of an intuitionistic fuzzy relation and we investigate some of their properties.

• Journal of applied mathematics & informatics
• /
• v.28 no.1_2
• /
• pp.99-107
• /
• 2010

This paper is a study about the relationships among topologies and intuitionistic fuzzy topology induced, respectively, by approximation operators and an intuitionistic fuzzy approximation operator associated with an approximation space (X, R), when the relation R on X is precisely reflexive and transitive. In particular, we consider an intuitionistic fuzzy approximation operator on an approximation space X (i.e., a set X with a reflexive and transitive relation on it), which turns out to be an intuitionistic fuzzy closure operator. This intuitionistic fuzzy closure operator gives rise to two saturated fuzzy topologies on X and it turns out that all the level topologies of one of the fuzzy topology coincide and equal to the topology analogously induced on X by a crisp approximation operator. These observations are then applied to intuitionistic fuzzy automata.

• Journal of Korea Multimedia Society
• /
• v.9 no.1
• /
• pp.1-10
• /
• 2006

In document clustering methods, the k-means algorithm and the Hierarchical Alglomerative Clustering(HAC) are often used. The k-means algorithm has the advantage of a processing time and HAC has also the advantage of a precision of classification. But both methods have mutual drawbacks, a slow processing time and a low quality of classification for the k-means algorithm and the HAC, respectively. Also both methods have the serious problem which is to compute a document similarity whenever new document is inserted into a cluster. A main property of web resource is to accumulate an information by adding new documents frequently. Therefore, we propose a new method of transitive closure tree based on the HAC method which can improve a processing time for a document clustering, and also propose a superior incremental clustering method for an insertion of a new document and a deletion of a document contained in a cluster. The proposed method is compared with those existing algorithms on the basis of a pre챠sion, a recall, a F-Measure, and a processing time and we present the experimental results.

• The KIPS Transactions:PartD
• /
• v.12D no.4 s.100
• /
• pp.637-646
• /
• 2005

There are various problems while applying classification or clustering algorithm in that document classification which requires post processing or classification after getting as a web search result due to my keyword. Among those, two problems are severe. The first problem is the need to categorize the document with the help of the expert. And, the second problem is the long processing time the document classification takes. Therefore we propose a new method of web document clustering which can dramatically decrease the number of times to calculate a document similarity using the Transitive Closure Tree(TCT) and which is able to speed up the processing without loosing the precision. We also compare the effectivity of the proposed method with those existing algorithms and present the experimental results.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.12
• /
• pp.3069-3077
• /
• 1997

This paper is concerned with a new paradigm for parallel evaluation of linear recursion rules which contain transitive dependency in a shared-nothing parallel architecture. For parallel evaluation of rules, we consider a shared-nothing parallel architecture that consists of a set of nodes and a message passing network to these nodes. An evaluation of normalized rules is a computation of the proof theoretic meaning of a collection of rules. We shall here define normalized recursion rules which contain transitive dependency, present an equivalent expression for the rule, propose a paradigm for Parallel evaluation of normalized rule based on the equivalent expression using join, partition, and transitive closure operations, and analyze response-time complexity.

• Structural Monitoring and Maintenance
• /
• v.3 no.4
• /
• pp.315-333
• /
• 2016

This study aims to perform damage identification for Da-Sheng-Guan (DSG) high-speed railway truss arch bridge using fuzzy clustering analysis. Firstly, structural health monitoring (SHM) system is established for the DSG Bridge. Long-term field monitoring strain data in 8 different cases caused by high-speed trains are taken as classification reference for other unknown cases. And finite element model (FEM) of DSG Bridge is established to simulate damage cases of the bridge. Then, effectiveness of one fuzzy clustering analysis method named transitive closure method and FEM results are verified using the monitoring strain data. Three standardization methods at the first step of fuzzy clustering transitive closure method are compared: extreme difference method, maximum method and non-standard method. At last, the fuzzy clustering method is taken to identify damage with different degrees and different locations. The results show that: non-standard method is the best for the data with the same dimension at the first step of fuzzy clustering analysis. Clustering result is the best when 8 carriage and 16 carriage train in the same line are in a category. For DSG Bridge, the damage is identified when the strain mode change caused by damage is more significant than it caused by different carriages. The corresponding critical damage degree called damage threshold varies with damage location and reduces with the increase of damage locations.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.2
• /
• pp.289-305
• /
• 2011

To efficiently analyze complex and voluminous data, OLAP systems increasingly provide functionalities for visual exploration of the data allowing end-users to navigate the desired view of the data cube. This paper only deals with data cubes whose schemas represented like the exclusive symmetric hierarchy which is not addressed by current OLAP implementations. This paper presents a conceptual classification of abstraction hierarchies, and an approach to navigating data cubes with a hierarchical visualization technique. The hierarchical visualization technique is developed by using the transitive closure of a binary relation. The approach is exemplified using a real-world study from the domain of national license administration.

• Bulletin of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.117-123
• /
• 1992

The dimension problem has been one of central themes in the theory of ordered sets. In this paper we focus on amalgamated ordered sets. Although some results can be obviously applied to infinite cases, we assume throughout that all ordered set are finite. If A and B are ordered sets whose orders agree on A.cap.B, then the amalgam of A and B is defined to the the set A.cup.B in which the order is the transitive closure of the union of the two orders, i.e., the smallest order containing the two orders, and is denoted by A .or. B .leq. dim A + dim B for any ordered sets A and B. But it is quite surprising that the dimension of the amalgam of certain 2-dimensional ordered sets can be arbitrarily large.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.1-13
• /
• 1993

In this paper, the problems of the conventional special-purpose array processor such as the deficiency of flexibility have been investigated. Then, a new modified methodology has been suggested and applied to obtain the common solution of the three typical App algorithms like SP(Shortest Path), TC(Transitive Closure), and MST(Minimun Spanning Tree) among the various APP algorithms using the similar method to obtain the solution. In the newly proposed APP parallel algorithm, real-time Processing is possible, without the structure enhancement and the functional restriction. In addition, we design 2-demensional bit-parallel low-triangular systolic array processor and the 1-PE in detail. For its evaluation, we consider its computational complexity according to bit-processing method and describe relationship of total chip size and execution time. Therefore, the proposed processor obtains, on which a large data inputs in real-time, 3n-4 execution time which is optimal o(n) time complexity, o(n$^{2}$) space complexity which is the number of total gate and pipeline period rate is one.