• Title/Summary/Keyword: 순서구조(順序構造)

Search Result 939, Processing Time 0.025 seconds

A Study on the Construction of Stable Clustering by Minimizing the Order Bias (순서 바이어스 최소화에 의한 안정적 클러스터링 구축에 관한 연구)

  • Lee, Gye-Seong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.6
    • /
    • pp.1571-1580
    • /
    • 1999
  • When a hierarchical structure is derived from data set for data mining and machine learning, using a conceptual clustering algorithm, one of the unsupervised learning paradigms, it is not unusual to have a different set of outcomes with respect to the order of processing data objects. To overcome this problem, the first classification process is proceeded to construct an initial partition. The partition is expected to imply the possible range in the number of final classes. We apply center sorting to the data objects in the classes of the partition for new data ordering and build a new partition using ITERATE clustering procedure. We developed an algorithm, REIT that leads to the final partition with stable and best partition score. A number of experiments were performed to show the minimization of order bias effects using the algorithm.

  • PDF

Gugo Wonlyu of Jeong Yag-yong (정약용의 구고원류)

  • Kim, Young Wook
    • Journal for History of Mathematics
    • /
    • v.32 no.3
    • /
    • pp.97-108
    • /
    • 2019
  • This paper is an outgrowth of a study on recent papers and presentations of Hong Sung Sa, Hong Young Hee and/or Lee Seung On on Gugo Wonlyu which is believed to be written by the famous Joseon scholar Jeong Yag-yong. Most of what is discussed here is already explained in these papers and presentations but due to brevity of the papers it is not understood by most of us. Here we present them in more explicit and mathematical ways which, we hope, will make them more accessible to those who have little background in history of classical Joseon mathematics. We also explain them using elementary projective geometry which allow us to visualize Pythagorean polynomials geometrically.

A Study on the Application to Network Analysis on the Importance of Author Keyword based on the Position of Keyword (학술논문의 저자키워드 출현순서에 따른 저자키워드 중요도 측정을 위한 네트워크 분석방법의 적용에 관한 연구)

  • Kwon, Sun-Young
    • Journal of the Korean Society for information Management
    • /
    • v.31 no.2
    • /
    • pp.121-142
    • /
    • 2014
  • This study aims to investigate the importance of author keyword with analysis the position of author keyword in journal. In the first stage, an analysis was carried out on the position of author keyword. We examined the importance of author keyword by using degree centrality, closeness centrality, betweenness centrality, eigenvector centrality and effective size of structural hole. In the next stage, We performed analysis on correlation between network centrality measures and the position of author keyword. The result of correlation analysis on network centrality measures and the position of author keyword shows that there are the more significant areas of the result of the correlation analysis on degree centrality, betweenness centrality and the position of keyword. In addition, These results show that we need to consider that the possible way as measuring the importance of author keyword in journal is not only a term frequency but also degree centrality and betweenness centrality.

A Study on a Computer Program Visualization Method Effective for the e-Learning Contents (이 러닝 콘텐츠에 효과적인 컴퓨터 프로그램 시각화 방안에 대한 연구)

  • Ha, Sang-Ho
    • Journal of Engineering Education Research
    • /
    • v.10 no.3
    • /
    • pp.109-124
    • /
    • 2007
  • With the advance of the Internet and computing technologies, e-learning is now a hot issue worldwide for providing the effective learning on the cyber-space. However, most of existing e-learning contents have been developed mainly based on text, including simple multimedia elements such as images, animations, and voices. This paper suggests a method effective for the computer programming e-learning. The method is based on program visualization using flowcharts. It features the stepwise hierarchical program visualization on the level of statements, the flowchart based visualization for control constructs of languages, visualization over whole programs, visualization compared with source codes, and interaction with users. Finally, we implement a system to realize the suggested method, and execute it for an example program.

Structural Analysis of Game Quest-storytelling -Foucing on Applying Narrative Functions of Folk-tale by Propp- (게임 퀘스트 스토리텔링 구조분석 -프롭의 민담기능대입을 중심으로-)

  • Kim, Yong-Jae
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.10
    • /
    • pp.69-76
    • /
    • 2011
  • As a smallest unit of the game story, quest needs to be analyzed in terms of structure in order to study quest storytelling. This thesis introduces structuralist theory of narrative function of folk-tale by Propp to determine the structure of the quest. Propp proposed immutable elements of the characters as 31 kinds of Folk-tale functions. I analyzed assigning quests in MMORPG. As a result, 13 essential functions of the Quest, and 5 add-ons were drawn and the order among functions was figured out. Most quests in MMORPG followed the order of the essential functions and optional add-ons and showed a repeating pattern. The essential and optional functions and its order can be utilized to arrange appropriate element for quest storytelling and to strengthen and lead the various ways of the quest storytelling.

Representation of Uncertain Time Information (불확실한 시간정보 표현)

  • 김희철;오경환
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.1 no.2
    • /
    • pp.43-54
    • /
    • 1991
  • 임시지식을 표현하고 추론하는 것은 인공지능 분야에서 중요한 문제로 되어왔다. 그런데 우리는 또한 일상생활에서 불확실성을 지니고 있는 임시지식을 자주 대하게 된다. 최근에 Dubois와 Prade는 시간의 기본단위로 시간점을, Dutta는 구간을 사용하여 이를 표현하였다. 본 논문에서 우리는 구간을 시간의 기본단위로 하면서 그 구간들이 점들과 같은 순서구조를 갖는 특성을 가진 새로운 표현모델을 제안한다. 그리고 간단한 추론규칙들을 제시하며 발생시기가 불확실한 사건들사이의 임시관계를 표현하되 convex한 사건과 non-convex한 사건을 나누어 설명한다.

  • PDF

A Study on Structure of a Faceted Classification for Organizing Korean Food Information (한식 정보 조직을 위한 패싯 구조화에 관한 연구)

  • Chung, Yeon-Kyoung
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.47 no.1
    • /
    • pp.15-37
    • /
    • 2013
  • The purpose of this study is to develop a faceted classification that enables the conceptualization and the organization of Korean food information. 23,470 terms were collected, categorized, and analyzed from the table of contents in 776 monographs and directory headings in portal sites related to Korean food. In order to develop the Korean food classification, common properties were analyzed in the process of categorizing terms. Then basic facets and subfacets were defined and assigned, and hierarchies among facets and concepts, citation orders, and notations were decided. As a result, the classification scheme consisted of 16 basic facets and 85 subfacets. The citation order of facets was proposed in order of Personality facet (kinds of dishes), Matter facet (materials, cooking utensils/equipment/containers, and nutrients), Energy facet (cooking processes and techniques, eating sense, type of cooking, table services, and agents of cooking), Space facet (countries/ethnic groups/geography, and eating places), Time facet (situation/purposes, season, time of meals, periods, and ages). The result of this study will be used for organizing, searching, retrieving, and providing Korean food information effectively around the world. Also, it will provide a foundation for developing subject-oriented classification using facet analysis in other disciplines.

A Variable Ordering Method for OPKFDDs using Complex Terms (Complex term을 이용한 OPKFDD의 입력변수 순서 방법)

  • Jung, Mi-Gyoung;Kim, Mi-Young;Lee, Guee-Sang
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.9
    • /
    • pp.759-767
    • /
    • 2000
  • OPKFDD(Ordered Pseudo-Kronecker Functional Decision Diagram)는 각 노드에서 다양한 decomposition을 취할 수 있는 Ordered-DD(Decision Diagram)의 한 종류이다. OBDD(Ordered Binary Decision Diagram)에서 각 노드는 Shannon decomposition 만을 이용하는 반면, OPKFDD는 각 노드마다 Shannon, positive Davio, negative Davio decomposition 중의 하나를 사용하도록 하며 많은 경우 매우 적은 수의 노드로 함수를 표현할 수 있다. 그러나 각 노드마다 각기 다른 확장 방법을 선택할 수 있는 특징 때문에 입력 노드에 대한 확장 방밥과 입력 변수 순서의 결정에 의해서 OPKFDD의 크기가 좌우되며 이에 대한 최적의 해를 구하는 것은 매우 어려운 문제로 알려져 있다. 본 논문에서는 DD 크기를 기준을 노드 수로 하여 기존의 BDD(Binary Decision Diagram) 자료구조에서 OPKFDD를 효율적으로 유도해내는 방법을 제시하고 complex term을 이용하여 이를 최소화하는 알고리즘을 제시한다. 그리고 입력변수 순서 결정을 위하여 다출력함수의 경우 함수간의 포함관계를 고려한 그룹-sifting과 각 노드의 확장 방법을 제안하고 실험 결과를 제시한다.

  • PDF

Design of Web-based Index Sequence Relation Information Model Using Pattern-In Repository (패턴정보저장소를 이용한 웹기반의 인덱스 순서관계정보모텔 설계)

  • Sun, Su-Kyun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2003.05b
    • /
    • pp.955-958
    • /
    • 2003
  • 최근에는 웹 환경에 적합한 개방형과 컴포넌트들을 효율적으로 분류하고 추출하는 방법이 진행되고 있다. 본 논문에서는 인터넷환경 하에서 생성되는 산출물을 컴포넌트 객체 형태로 통합 관리하고, 데이터베이스와 연결하여 객체들을 효율적으로 관리해 주는 웹기반 인덱스순서관계정보모델을 설계한다. 이 제안의 장점은 "인덱스 순서관계정보"로 클래스(class)들 사이의 관련된 여러 관계정보를 UML 설계방법에 적응할 수 있는 구조로 변형함으로서 개발자가 관계정보를 쉽게 파악하여 모델링 선계언어인 UML 선계방법에 쉽게 적응할 수 있게 한다. 이 모델로 기존의 시스템을 재사용하고 급변하는 소프트웨어 산업에 능동적으로 대체와 소프트웨어 개발에 시간을 단축함으로써 현존하는 다양한 데이터베이스 군들을 최소한의 코드 수정을 통하여 구동할 수 있게 함으로써 소프트웨어 개발 경제성을 높이는 데 있다.

  • PDF