• Title/Summary/Keyword: 계층적인 모델

Search Result 518, Processing Time 0.026 seconds

Hierarchical and Incremental Clustering for Semi Real-time Issue Analysis on News Articles (준 실시간 뉴스 이슈 분석을 위한 계층적·점증적 군집화)

  • Kim, Hoyong;Lee, SeungWoo;Jang, Hong-Jun;Seo, DongMin
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.6
    • /
    • pp.556-578
    • /
    • 2020
  • There are many different researches about how to analyze issues based on real-time news streams. But, there are few researches which analyze issues hierarchically from news articles and even a previous research of hierarchical issue analysis make clustering speed slower as the increment of news articles. In this paper, we propose a hierarchical and incremental clustering for semi real-time issue analysis on news articles. We trained siamese neural network based weighted cosine similarity model, applied this model to k-means algorithm which is used to make word clusters and converted news articles to document vectors by using these word clusters. Finally, we initialized an issue cluster tree from document vectors, updated this tree whenever news articles happen, and analyzed issues in semi real-time. Through the experiment and evaluation, we showed that up to about 0.26 performance has been improved in terms of NMI. Also, in terms of speed of incremental clustering, we also showed about 10 times faster than before.

Modeling a Multi-Agent based Web Mining System on the Hierarchical Web Environment (계층적 웹 환경에서의 멀티-에이전트 기반 웹 마이닝 시스템 설계)

  • Yoon, Hee-Byung;Kim, Hwa-Soo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.13 no.6
    • /
    • pp.643-648
    • /
    • 2003
  • In order to provide efficient retrieving results for user query on the web environment, the various searching algorithms have developed and considered user's preference and convenience. However, the searching algorithms are developed on the horizontal and non hierarchical web environment in general and could not apply to the complex hierarchical and functional web environments such like the enterprise network. In this paper, we purpose the multi-agent based web mining system which can provide the efficient mining results to the user on the special web environment. For doing this, we suggest the network model with the hierarchical web environment and model the multi agent based web mining system which has four corporation agents and fourteen process modules. Then, we explain the detailed functions of each agent considered the hierarchical environment according to the module. Especially, we purpose the new merging agent and improved ranking algorithm by using the graph theory.

A Design and Implementation of Dynamic Hybrid P2P System with Hierarchical Group Management and Maintenance of Reliability (계층적 그룹관리와 신뢰성을 위한 동적인 변형 P2P 시스템 설계 및 구현)

  • Lee, Seok-Hee;Cho, Sang;Kim, Sung-Yeol
    • The KIPS Transactions:PartD
    • /
    • v.11D no.4
    • /
    • pp.975-982
    • /
    • 2004
  • In current P2P concept, pure P2P and Hybrid P2P structures are used commonly. Gnutella and Ktella are forms of pure P2P. and forms of Hybrid P2P are innumerable. File searching models exist in these models. These models provide group management for file sharing, searching and indexing. The general file sharing model is good at maintaining connectivity. However, it is defective in group management. Therefore, this study approaches hierarchical structure in file sharing models through routing technique and backup system. This system was designed so that the user was able to maintain group efficiency and connection reliability in large-scale network.

Hierarchical 3D modeling using disparity-motion relationship and feature points (변이-움직임 관계와 특징점을 이용한 계층적 3차원 모델링)

  • Lee, Ho-Geun;Han, Gyu-Pil;Ha, Yeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.39 no.1
    • /
    • pp.9-16
    • /
    • 2002
  • This paper proposes a new 3D modeling technique using disparity-motion relationship and feature points. To generate the 3D model from real scene, generally, we need to compute depth of model vertices from the dense correspondence map over whole images. It takes much time and is also very difficult to get accurate depth. To improve such problems, in this paper, we only need to find the correspondence of some feature points to generate a 3D model of object without dense correspondence map. The proposed method consists of three parts, which are the extraction of object, the extraction of feature points, and the hierarchical 3D modeling using classified feature points. It has characteristics of low complexity and is effective to synthesize images with virtual view and to express the smoothness of Plain regions and the sharpness of edges.

A Study of Library Grouping using Cluster Analysis Methods (군집분석 기법을 이용한 공공도서관 그룹화에 대한 연구)

  • Kwak, Chul Wan
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.31 no.3
    • /
    • pp.79-99
    • /
    • 2020
  • The purpose of this study is to investigate the model of cluster analysis techniques for grouping public libraries and analyze their characteristics. Statistical data of public libraries of the National Library Statistics System were used, and three models of cluster analysis were applied. As a result of the study, cluster analysis was conducted based on the size of public libraries, and it was largely divided into two clusters. The size of the cluster was largely skewed to one side. For grouping based on size, the ward method of hierarchical cluster analysis and the k-means cluster analysis model were suitable. Three suggestions were presented as implications of the grouping method of public libraries. First, it is necessary to collect library service-related data in addition to statistical data. Second, an analysis model suitable for the data set to be analyzed must be applied. Third, it is necessary to study the possibility of using cluster analysis techniques in various fields other than library grouping.

Hierarchical Hidden Markov Model for Finger Language Recognition (지화 인식을 위한 계층적 은닉 마코프 모델)

  • Kwon, Jae-Hong;Kim, Tae-Yong
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.9
    • /
    • pp.77-85
    • /
    • 2015
  • The finger language is the part of the sign language, which is a language system that expresses vowels and consonants with hand gestures. Korean finger language has 31 gestures and each of them needs a lot of learning models for accurate recognition. If there exist mass learning models, it spends a lot of time to search. So a real-time awareness system concentrates on how to reduce search spaces. For solving these problems, this paper suggest a hierarchy HMM structure that reduces the exploration space effectively without decreasing recognition rate. The Korean finger language is divided into 3 categories according to the direction of a wrist, and a model can be searched within these categories. Pre-classification can discern a similar finger Korean language. And it makes a search space to be managed effectively. Therefore the proposed method can be applied on the real-time recognition system. Experimental results demonstrate that the proposed method can reduce the time about three times than general HMM recognition method.

Proposing for Component Model Based on Tree Structure (트리 구조 기반의 컴포넌트 모델 제안)

  • Huh, Je-Min;Kim, Ji-Hong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2008.06a
    • /
    • pp.47-50
    • /
    • 2008
  • CBSE(Component-Based Software Engineering)는 현재 많은 연구를 통해 소프트웨어 컴포넌트 모델에 관한 상당한 성과를 이루었다. 하지만 기존의 모델들은 각각이 제안한 프레임웍이 존재하고 그와 관련된 컴포넌트 명세들을 요구한다. 그리고 이를 사용하기 위한 방법을 학습해야한다. 이런 이유로 시장에서 바라는 소프트웨어 컴포넌트의 재사용이 쉽게 이루어지지 않았다. 따라서 컴포넌트의 재사용을 위한 많은 연구들의 공통점들을 연구하여 이상적인 컴포넌트 생명주기가 제안되었고 이를 따르는 모델 또한 제안되었다. 그러나 이 모델은 간접 메시지 전달 방법을 사용한 Exogenous 커넥터를 사용하여 컴포넌트를 조합한다. 이는 커넥터 수의 증가를 피할 수 없어 컴포넌트 간의 의사소통이 비효율 적으로 이루어지는 문제가 발생한다. 본 논문에서는 계층적 메시지 전달 방식을 제안하고 이를 사용한 조합 방법을 통해 이상적인 컴포넌트 생명 주기를 따르는 새로운 소프트웨어 컴포넌트 모델인 트리 아키텍처 컴포넌트 모델을 제안한다. 아울러 제안된 모델의 적용을 통해서 컴포넌트 사이를 중재하는 객체를 사용하지 않고도 쉽게 재사용가능할 뿐만 아니라 의사소통도 효율적으로 가능함을 발견할 수 있었다.

  • PDF

Hierarchical Automated Essay Evaluation Model Using Korean Sentence-Bert Embedding (한국어 Sentence-BERT 임베딩을 활용한 자동 쓰기 평가 계층적 구조 모델)

  • Minsoo Cho;Oh Woog Kwon;Young Kil Kim
    • Annual Conference on Human and Language Technology
    • /
    • 2022.10a
    • /
    • pp.526-530
    • /
    • 2022
  • 자동 쓰기 평가 연구는 쓰기 답안지를 채점하는데 드는 시간과 비용을 절감할 수 있어, 교육 분야에서 큰 관심을 가지고 있다. 본 연구의 목적은 쓰기 답안지의 문서 구조를 효과적으로 학습하여 평가하고, 문장단위의 피드백을 제공하는데 있다. 그 방법으로는 문장 레벨에서 한국어 Sentence-BERT 모델을 활용하여 각 문장을 임베딩하고, LSTM 어텐션 모델을 활용하여 문서 레벨에서 임베딩 문장을 모델링한다. '한국어 쓰기 텍스트-점수 구간 데이터'를 활용하여 해당 모델의 성능 평가를 진행하였으며, 다양한 KoBERT 기반 모델과 비교 평가를 통해 제안하는 모델의 방법론이 효과적임을 입증하였다.

  • PDF

Plant-wide On-line Monitoring and Diagnosis Based on Hierarchical Decomposition and Principal Component Analysis (계층적 분해 방법과 PCA를 이용한 공장규모 실시간 감시 및 진단)

  • Cho Hyun-Woo;Han Chong-hun
    • Journal of the Korean Institute of Gas
    • /
    • v.1 no.1
    • /
    • pp.27-32
    • /
    • 1997
  • Continual monitoring of abnormal operating conditions i a key issue in maintaining high product quality and safe operation, since the undetected process abnormality may lead to the undesirable operations, finally producing low quality products, or breakdown of equipment. The statistical projection method recently highlighted has the advantage of easily building reference model with the historical measurement data in the statistically in-control state and not requiring any detailed mathematical model or knowledge-base of process. As the complexity of process increases, however, we have more measurement variables and recycle streams. This situation may not only result in the frequent occurrence of process Perturbation, but make it difficult to pinpoint trouble-making causes or at most assignable source unit due to the confusing candidates. Consequently, an ad hoc skill to monitor and diagnose in plat-wide scale is needed. In this paper, we propose a hierarchical plant-wide monitoring methodology based on hierarchical decomposition and principal component analysis for handling the complexity and interactions among process units. This have the effect of preventing special events in a specific sub-block from propagating to other sub-blocks or at least delaying the transfer of undesired state, and so make it possible to quickly detect and diagnose the process malfunctions. To prove the performance of the proposed methodology, we simulate the Tennessee Eastman benchmark process which is operated continuously with 41 measurement variables of five major units. Simulation results have shown that the proposed methodology offers a fast and reliable monitoring and diagnosis for a large scale chemical plant.

  • PDF

Data Modeling for Cell-Signaling Pathway Database (세포 신호전달 경로 데이타베이스를 위한 데이타 모델링)

  • 박지숙;백은옥;이공주;이상혁;이승록;양갑석
    • Journal of KIISE:Databases
    • /
    • v.30 no.6
    • /
    • pp.573-584
    • /
    • 2003
  • Recent massive data generation by genomics and proteomics requires bioinformatic tools to extract the biological meaning from the massive results. Here we introduce ROSPath, a database system to deal with information on reactive oxygen species (ROS)-mediated cell signaling pathways. It provides a structured repository for handling pathway related data and tools for querying, displaying, and analyzing pathways. ROSPath data model provides the extensibility for representing incomplete knowledge and the accessibility for linking the existing biochemical databases via the Internet. For flexibility and efficient retrieval, hierarchically structured data model is defined by using the object-oriented model. There are two major data types in ROSPath data model: ‘bio entity’ and ‘interaction’. Bio entity represents a single biochemical entity: a protein or protein state involved in ROS cell-signaling pathways. Interaction, characterized by a list of inputs and outputs, describes various types of relationship among bio entities. Typical interactions are protein state transitions, chemical reactions, and protein-protein interactions. A complex network can be constructed from ROSPath data model and thus provides a foundation for describing and analyzing various biochemical processes.