• 한국어정보학회:학술대회논문집
• /
• 2016.10a
• /
• pp.157-161
• /
• 2016

본 논문에서는 클러스터 간의 중복을 허용한 계층적 클러스터링(hierarchical clustering) 기법에 적합한 클러스터 간 유사도 평가방법(linkage metric)을 제안하였다. 클러스터 간 유사도 평가방법은 계층적 클러스터링에서 클러스터를 통합하거나 분해하는데 쓰이며 사용된 방법에 따라 클러스터링의 결과가 다르게 형성된다. 기존의 클러스터 간 유사도 평가방법인 single linkage, complete linkage, average linkage 중 single linkage와 complete linkage는 클러스터 간 중복이 허용된 환경에서 정확도가 낮은 문제점이 있고, average linkage는 정확도가 두 방법에 비해 높지만 계산 시간 소요가 크다는 단점이 있다. 따라서 본 논문에서는 기존의 average linkage를 개선하여 중복된 데이터에 의한 필요 계산량을 크게 줄임으로써 시간적 성능이 우수한 클러스터 간 유사도 평가방법을 제안하였다. 또한, 제안된 방법을 기존 방법들과 비교실험하여 중복을 허용하는 계층적 클러스터링 환경에서 정확도는 비슷하거나 더 높고, average linkage에 비해 계산량이 감소됨을 확인하였다.

• Spatial Information Research
• /
• v.11 no.4
• /
• pp.453-464
• /
• 2003

The Competitive power of the country in knowledge information can be determined that how efficiently useful knowledge and information can be circulated. Korean government established the second National GIS Master Plan, and constructed National Geographic Information Clearinghouse to the goal 'whole nation's internet circulation of the geographic information and practical use'. But every departments of government are trying to circulate their geographic information individually, And this case, consumer group should approach to several dissemination network in various routing line to get the geographic information. In fact, it is difficult to present the solution for uilified single dissemination network. It is difficult to present suitable linkage plan coinciding in special environment and characteristics of all systems. Consequently, in this study, we suggested linkage element that should consider far link with National Geographic Information Clearinghouse, and presented linkage plan by linkage target type.

• Annual Conference on Human and Language Technology
• /
• 2016.10a
• /
• pp.157-161
• /
• 2016

본 논문에서는 클러스터 간의 중복을 허용한 계층적 클러스터링(hierarchical clustering) 기법에 적합한 클러스터 간 유사도 평가방법(linkage metric)을 제안하였다. 클러스터 간 유사도 평가방법은 계층적 클러스터링에서 클러스터를 통합하거나 분해하는데 쓰이며 사용된 방법에 따라 클러스터링의 결과가 다르게 형성된다. 기존의 클러스터 간 유사도 평가방법인 single linkage, complete linkage, average linkage 중 single linkage와 complete linkage는 클러스터 간 중복이 허용된 환경에서 정확도가 낮은 문제점이 있고, average linkage는 정확도가 두 방법에 비해 높지만 계산 시간 소요가 크다는 단점이 있다. 따라서 본 논문에서는 기존의 average linkage를 개선하여 중복된 데이터에 의한 필요 계산량을 크게 줄임으로써 시간적 성능이 우수한 클러스터 간 유사도 평가방법을 제안하였다. 또한, 제안된 방법을 기존 방법들과 비교 실험하여 중복을 허용하는 계층적 클러스터링 환경에서 정확도는 비슷하거나 더 높고, average linkage에 비해 계산량이 감소됨을 확인하였다.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.823-826
• /
• 2008

This paper shows linkage management for external services. There are many services for specific entities such as DBLP and OntoWorld. OntoFrame, as a Semantic Web-based research information service portal, aims at one-stop service in ways that it connects external services with hyperlinks. For managing the linkage, linkage rules are manually edited by human administrators and automatically verified and tested by linkage management system. It consists of linkage rule management, linkage rule verification, linkage test, and dynamic link generation. Linkage rule management creates and edits linkage rules to connect external services on the Web. After finished rule editing and verification step, linkage management invokes linkage test with entity list. Only valid links are visible to enable users to click on our system, and thus it increases user's reliability on the system.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.12
• /
• pp.73-80
• /
• 2018

Certification revocation list(CRL) is needed for excluding compromised, faulty, illegitimate vehicle nodes and preventing the use of compromised cryptographic materials in vehicular communications. It should be distributed to vehicles resource-efficiently and CRL computational load of vehicles should not impact on life-critical applications with delay sensitive nature such as the pre-crash sensing that affords under 50msec latency. However, in the existing scheme, when a vehicle receives CRL, the vehicle calculates linkage values from linkage seeds, which results in heavy computational load. This paper proposes, a new CRL distribution scheme is proposed, which minimizes the time for CRL processing of vehicles. In the proposed scheme, the linkage value calculation procedure is performed by road-side unit(RSU) instead of the vehicle, and then the extracted linkage values are relayed to the vehicle transparently. The simulation results show that the proposed scheme reduces the CRL computational load dramatically, which would minimize impact on life-critical applications' operations with low latency.

• Journal of Korean Library and Information Science Society
• /
• v.51 no.1
• /
• pp.115-143
• /
• 2020

With the era of the 4th Industrial Revolution, the number of data-centric integrated researches increases. The integrated researches make information identification and linkage more important, so it is necessary to seek a method to efficiently manage and share academic-information for supporting the researches. Therefore, this study aims to analyze identification system and linkable information types of 12 major academic search engines and bibliographic databases(ASEBDs) in Korea and abroad and to propose a method to identify and link academic-information. The analysis was conducted 2 times, and academic-information types, searchable fields, linkable information types, used identification system were investigated. As a result, the ASEBDs link directly or/and indirectly 3~4 information types based on their own identifiers with persistent identifiers. In addition, they identify academic-information semi-automatically based on machine learning methodology and collect and manage the related data. Finally, the method for academic-information linkage was proposed in terms of practice and society: linkage based on persistent identifiers and linkage based on collaborative network of institutions.

• The Korean Journal of Applied Statistics
• /
• v.34 no.5
• /
• pp.849-861
• /
• 2021

This paper aims to introduce the basic concept of probabilistic record linkage and its statistical framework, and describe the specific process and principle of performing it using a real example from Statistics Korea. First, we briefly describe the deterministic record linkage and compare it with probabilistic record linkage. We introduce the Fellegi-Sunter model framework for record linkage and the related paprameters: m-probability, u-probability, matched weight and decision rule. Finally, we show the detailed process of record linkage under Fellegi-Sunter model framework and evaluate the record linkage results, using sample data from the registered-based census and Population and Housing Census survey in Statistics Korea.

• Agribusiness and Information Management
• /
• v.3 no.1
• /
• pp.23-37
• /
• 2011

The development of informatization impacts all sectors, including agriculture. Agricultural informatization builds the knowledge linkage structures of agricultural innovation systems globally. This study investigated the global knowledge linkage structures in agricultural innovation pertinent to information technology (IT) for agricultural research and development (R&D) investments and activities. We explored the longitudinal trend of systemness within the networked research relationships in the triple helix (TH) of the university, industry and government (UIG). We collected data from publications in the Science Citation Index (SCI), the Social Sciences Citation Index (SSCI), and the Arts and Humanities Citation Index (A&HCI) to analyze the TH network dynamics. We also performed a scientometrics analysis to quantitatively identify the knowledge and insights of global agricultural innovation structures. These results could be informative for individual countries. Our findings reveal that the global knowledge linkage structures in the agricultural sector that are pertinent to IT fluctuate widely and fail to increase the capacity of agricultural innovation research due to a neglect of the network effects of the TH dynamics of UIG.

• Journal of the Korean Society for information Management
• /
• v.39 no.4
• /
• pp.99-125
• /
• 2022

In order to understand a record, not only the contents of the record but also the production background and work context of the record must be grasped. It also requires a function that makes it easy to find related records scattered across various departments and agencies. Accordingly, the 'linkage' of information in archival information services is becoming more important. NAK also emphasizes 'linkage' as a search service function of the archives management system, but some problems were identified at the National Archives Portal Service (NAPS) such as a lack of linkage with authority data, disruption of internal service, and absence of linkage with other related organizations. To solve the limitations of the NAPS, we selected and analyzed advanced record management institutions that have built an ideal linkage service; checked the overall linkage structure of these institutions; and identified characteristics that could not be seen by other institutions. Also, elements that can be adopted from the NAPS were derived. Next, the current status of the NAPS linkage structure was analyzed to identify the parts that were not linked and the items that need to be improved in the linkage method, and specific advancement plans were suggested to solve these problems. The purpose of this study is to increase users' satisfaction with search and to advance the accessibility and utilization of records and internal services through improved linkage services of NAPS.

• Journal of the Korean Society for information Management
• /
• v.21 no.1
• /
• pp.93-117
• /
• 2004

This study is to develop a hierarchic clustering model fur document classification and browsing in OPAC systems. Two automatic indexing techniques (with and without controlled terms), two term weighting methods (based on term frequency and binary weight), five similarity coefficients (Dice, Jaccard, Pearson, Cosine, and Squared Euclidean). and three hierarchic clustering algorithms (Between Average Linkage, Within Average Linkage, and Complete Linkage method) were tested on the document collection of 175 books and theses on library and information science. The best document clusters resulted from the Between Average Linkage or Complete Linkage method with Jaccard or Dice coefficient on the automatic indexing with controlled terms in binary vector. The clusters from Between Average Linkage with Jaccard has more likely decimal classification structure.