KLI

情報要素에 관한 Binary Term-Property Matrix로 부터 木構造로서의 變換에 관한 Algoritym

Metadata Downloads
Alternative Title
An Algorithm about Hierarchical Arrangement of Information Terms based on Binary Term-Property Matrix
Abstract
情報의 要素들이 여러 가지 性質들을 가지는 度數에 따라, 情報要素들의 相互關係를 木構造로 구성하는 종래의 定量的 方法을 개선하여, 情報의 要素들이 여러 가지 性質들을 가지는 有無에만 의존하여, 情報 要素들의 相互關係를 木構造로 구성하는 定性的 方法을 연구하였으며, 一般的으로 情報要素들이 가지는 性質들에 관하여 우선순위를 매길수 있는 경우에 대해서, 木構造 形式으로 표현하는 方法과 Algorithm을 제시하고, 그 타당성을 증명하였다.
Some algorithms for a hierarchical arrangement of terms from a given term-property matrix was known. The elements of such matrix indicate property frequency of the corresponding terms. While :his term-property matrix is counted as quantitative, a binary term-property matrix is counted as Qualitative, for the elements of this matrix is represented by 1 or 0 corresponding to the presence or absence of property. I will show an algorithm which converts a binary term-property matrix into tree structure.
Some algorithms for a hierarchical arrangement of terms from a given term-property matrix was known. The elements of such matrix indicate property frequency of the corresponding terms. While :his term-property matrix is counted as quantitative, a binary term-property matrix is counted as Qualitative, for the elements of this matrix is represented by 1 or 0 corresponding to the presence or absence of property. I will show an algorithm which converts a binary term-property matrix into tree structure.
Author(s)
金熙承
Issued Date
1979
Type
Research Laboratory
URI
https://oak.ulsan.ac.kr/handle/2021.oak/4750
http://ulsan.dcollection.net/jsp/common/DcLoOrgPer.jsp?sItemId=000002024740
Alternative Author(s)
Kim,Heui-Seung
Publisher
연구논문집
Language
kor
Rights
울산대학교 저작물은 저작권에 의해 보호받습니다.
Citation Volume
10
Citation Number
1
Citation Start Page
9
Citation End Page
15
Appears in Collections:
Research Laboratory > University of Ulsan Report
Authorize & License
  • Authorize공개
Files in This Item:

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.