• Kyungpook Mathematical Journal
• /
• v.61 no.2
• /
• pp.409-439
• /
• 2021

We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a partial matching, and the lattice polytope associated with a pair of lattice presentations, and we investigate transformations with minimal area.

• Journal of Korea Multimedia Society
• /
• v.7 no.9
• /
• pp.1195-1207
• /
• 2004

Schema matching is prerequisite to an automated transformation of XML documents. Because previous works about schema matching compute all semantically-possible matchings, they produce many-to-many matching relationships. Such imprecise matchings are inappropriate for an automated transformation of XML documents. This paper presents an efficient schema matching algorithm that computes precise one-to-one matchings between two schemas. The proposed algorithm consists of two steps: preliminary matching relationships between leaf nodes in the two schemas are computed and one-to-one matchings are finally extracted based on a proposed path similarity. Specifically, for a sophisticated schema matching, the proposed algorithm is based on a domain ontology as well as a lexical database that includes abbreviations and synonyms. Experimental results with real schemas from an e-commerce field show that the proposed method is superior to previous works, resulting in an accuracy of 97% in average.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.727-740
• /
• 2006

Schema matching is important as a prerequisite to the transformation of XML documents. This paper presents a schema matching method for the transformation of XML documents. The proposed method consists of two steps: preliminary matching relationships between leaf nodes in the two XML schemas are computed based on proposed ontology and leaf node similarity, and final matchings are extracted based on a proposed path similarity. Particularly, for a sophisticated schema matching, the proposed ontology is incrementally updated by users' feedback. furthermore, since the ontology can describe various relationships between concepts, the proposed method can compute complex matchings as well as simple matchings. Experimental results with schemas used in various domains show that the proposed method is superior to previous works, resulting in a precision of 97% and a recall of 83 % on the average. Furthermore, the dynamic ontology increased by 9 percent overall.

• Bulletin of the Korean Mathematical Society
• /
• v.37 no.1
• /
• pp.121-125
• /
• 2000

In this paper, we obtain an algorithm for finding a maximum matching in the line graph L(G) of a graph G. The complexity of our algorithm is O($$\mid$E$\mid$$), where is the edge set of G($$\mid$E$\mid$$ is equal to the number of vertices in L(G)).

• Communications of the Korean Mathematical Society
• /
• v.11 no.1
• /
• pp.43-55
• /
• 1996

Explicit formulas for bi-Hermite polynomials are found and their combinatorial model is considered. This combinatorial model is a generalization of the combinatorial model of Hermite polynomials as matching polynomials.

• Journal of Broadcast Engineering
• /
• v.20 no.4
• /
• pp.641-644
• /
• 2015

In this paper, we propose a precise frame-level near-duplicate video matching algorithm. First, a binary frame descriptor for near-duplicate video matching is proposed. The binary frame descriptor divides a frame into patches and represent the relations between patches in bits. Seconds, we formulate a cost function for the matching, composed of matching costs and compensatory costs. Then, we roughly determine initial matchings and refine the matchings iteratively to minimize the cost function. Experimental results demonstrate that the proposed algorithm provides efficient performance for frame-level near duplicate video matching.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.2
• /
• pp.60-65
• /
• 2008

The matching preclusion set of a graph is a set of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. The matching preclusion number is the minimum cardinality over all matching preclusion sets. We show in this paper that, for any $m{\geq}4$, the matching preclusion numbers of both m-dimensional restricted HL-graph and recursive circulant $G(2^m,4)$ are equal to degree m of the networks, and that every minimum matching preclusion set is the set of edges incident to a single vertex.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.391-399
• /
• 2005

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10b
• /
• pp.55-57
• /
• 2004

본 논문은 온톨로지를 활용한 스키마 매칭 알고리즘을 제안한다. 기존의 대부분의 스키마 매칭 방법은 단순매칭을 대상으로 하는 반면, 제안된 방법은 계층적 구조의 온톨로지에 기반하여 복합매칭을 계산할 수 있다. 특히 제안된 온톨로지는 이전의 매칭결과에 대한 사용자의 피드백을 이용하여 자동으로 갱신됨에 따라 적절한 도메인 정보를 유지할 수 있다. 성능평가를 위한 실험결과, 온톨로지의 적용이 매칭 성능을 향상시킴을 확인할 수 있었다.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.17-20
• /
• 2000

This paper describes a shape-based object recognition algorithm using multiple distance images. For the images containing dense edge points and noise, previous Hausdorff distance (HD) measures yield a high ms error for object position and many false matchings for recognition. Extended version of HD measure considering edge position and orientation simultaneously is proposed for accurate matching. Multiple distance images are used to calculate proposed matching measure efficiently. Results are presented for visual images and infrared images.