• Title/Summary/Keyword: 엔트로피 모델

Search Result 154, Processing Time 0.026 seconds

Implementation of Modeller and Simulator for Fish Farming Environmental Information using Petri-Net (페트리넷을 이용한 어류양식 환경 정보 모델러 및 시뮬레이터 구현)

  • Ceong, Hee-Taek;Cho, Hyug-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.16 no.3
    • /
    • pp.626-634
    • /
    • 2012
  • It is required that system can seamlessly identify and manage change history and comprehensive assessment of several types of data as well as individual information of feeding and water environment for scientific and systematic management of fish farming environment and fish farmer. In this study, we implemented the system which can present and simulate current status of water quality and feeding based on th historical data of them, and check changes of state step by step using visual C++. In addition, we proposed the entropy model which can be comprehensive analysis about water quality and feed status information based on knowledge of fisheries. It can be the foundation to create high-level environment model reflecting the more diverse fisheries knowledge such as disease.

Techniques for improving performance of POS tagger based on Maximum Entropy Model (최대 엔트로피 모텔 기반 품사 태거의 성능 향상 기법)

  • Cho, Min-Hee;Kim, Myoung-Sun;Park, Jae-Han;Park, Eui-Kyu;Ra, Dong-Yul
    • Annual Conference on Human and Language Technology
    • /
    • 2004.10d
    • /
    • pp.73-81
    • /
    • 2004
  • 한국어에서의 품사 결정 문제는 형태론적 중의성 문제도 있지만, 영어에는 발생하지 않는 동품사 중의성 문제로 더 까다롭다. 이러한 문제들은 어휘 문맥을 고려하지 않고서는 해결하기 어렵다. 통계 자료 부족 문제에 쉽게 대처하는 모델이 필요하며 문맥에 따른 품사를 결정하고자 할 때 서로 다른 형태의 여러 가지 어휘 문맥 정보를 반영할 수 있는 모델이 필요하다. 본 논문에서는 이런 점에 가장 적합한 최대 엔트로피(maximum entropy : ME) 모델을 품사태깅 작업에 이용하는 문제에 대해 다룬다. 어휘 문맥 정보를 이용하기 위한 자질함수가 매우 많아지는 문제에 대처하기 위해 필요에 따라 어휘 문맥 정보를 사전화 한다. 본 시스템의 특징으로는 어절 단위 품사 태깅을 위한 처리 기법. 어절의 형태소 분석열에 대한 어절 내부 확률 계산. ME 모델의 정규화 과정 생략에 의한 성능 향상, 디코딩 경로의 확장과 같은 점들이 있다. 실험을 통하여 본 연구의 기법이 높은 성능의 시스템을 달성할 수 있음을 알게 되었다.

  • PDF

A Method for the Classification of Water Pollutants using Machine Learning Model with Swimming Activities Videos of Caenorhabditis elegans (예쁜꼬마선충의 수영 행동 영상과 기계학습 모델을 이용한 수질 오염 물질 구분 방법)

  • Kang, Seung-Ho;Jeong, In-Seon;Lim, Hyeong-Seok
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.7
    • /
    • pp.903-909
    • /
    • 2021
  • Caenorhabditis elegans whose DNA sequence was completely identified is a representative species used in various research fields such as gene functional analysis and animal behavioral research. In the mean time, many researches on the bio-monitoring system to determine whether water is contaminated or not by using the swimming activities of nematodes. In this paper, we show the possibility of using the swimming activities of C. elegans in the development of a machine learning based bio-monitoring system which identifies chemicals that cause water pollution. To characterize swimming activities of nematode, BLS entropy is computed for the nematode in a frame. And, BLS entropy profile, an assembly of entropies, are classified into several patterns using clustering algorithms. Finally these patterns are used to construct data sets. We recorded images of swimming behavior of nematodes in the arenas in which formaldehyde, benzene and toluene were added at a concentration of 0.1 ppm, respectively, and evaluate the performance of the developed HMM.

Self-Organizing Fuzzy Modeling Using Creation of Clusters (클러스터 생성을 이용한 자기구성 퍼지 모델링)

  • Koh, Taek-Beom
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.334-340
    • /
    • 2002
  • This paper proposes a self-organizing fuzzy modeling which can create a new hyperplane-shaped cluster by applying multiple regression to input/output data with relatively large fuzzy entropy, add the new cluster to fuzzy rule base and adjust parameters of the fuzzy model in repetition. Tn the coarse tuning, weighted recursive least squared algorithm and fuzzy C-regression model clustering are used and in the fine tuning, gradient descent algorithm is used to adjust parameters of the fuzzy model precisely And learning rates are optimized by utilizing meiosis-genetic algorithm. To check the effectiveness and feasibility of the suggested algorithm, four representative examples for system identification are examined and the performance of the identified fuzzy model is demonstrated in comparison with that of the conventional fuzzy models.

A Reexamination on the Influence of Fine-particle between Districts in Seoul from the Perspective of Information Theory (정보이론 관점에서 본 서울시 지역구간의 미세먼지 영향력 재조명)

  • Lee, Jaekoo;Lee, Taehoon;Yoon, Sungroh
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.2
    • /
    • pp.109-114
    • /
    • 2015
  • This paper presents a computational model on the transfer of airborne fine particles to analyze the similarities and influences among the 25 districts in Seoul by quantifying a time series data collected from each district. The properties of each district are driven with the model of a time series of the fine particle concentrations, and the calculation of edge-based weights are carried out with the transfer entropies between all pairs of the districts. We applied a modularity-based graph clustering technique to detect the communities among the 25 districts. The result indicates the discovered clusters correspond to a high transfer-entropy group among the communities with geographical adjacency or high in-between traffic volumes. We believe that this approach can be further extended to the discovery of significant flows of other indicators causing environmental pollution.

A Spam Filter System Based on Maximum Entropy Model Using Co-training with Spamminess Features and URL Features (스팸성 자질과 URL 자질의 공동 학습을 이용한 최대 엔트로피 기반 스팸메일 필터 시스템)

  • Gong, Mi-Gyoung;Lee, Kyung-Soon
    • The KIPS Transactions:PartB
    • /
    • v.15B no.1
    • /
    • pp.61-68
    • /
    • 2008
  • This paper presents a spam filter system using co-training with spamminess features and URL features based on the maximum entropy model. Spamminess features are the emphasizing patterns or abnormal patterns in spam messages used by spammers to express their intention and to avoid being filtered by the spam filter system. Since spammers use URLs to give the details and make a change to the URL format not to be filtered by the black list, normal and abnormal URLs can be key features to detect the spam messages. Co-training with spamminess features and URL features uses two different features which are independent each other in training. The filter system can learn information from them independently. Experiment results on TREC spam test collection shows that the proposed approach achieves 9.1% improvement and 6.9% improvement in accuracy compared to the base system and bogo filter system, respectively. The result analysis shows that the proposed spamminess features and URL features are helpful. And an experiment result of the co-training shows that two feature sets are useful since the number of training documents are reduced while the accuracy is closed to the batch learning.

English to Korean transliteration using Sequence to Sequence model (Sequence to Sequence 모델을 이용한 영단어 음차 표기)

  • Shin, Hyeong Jin;Yuk, Dae Bum;Lee, Jae Sung
    • Annual Conference on Human and Language Technology
    • /
    • 2018.10a
    • /
    • pp.627-629
    • /
    • 2018
  • 영단어를 음역 하는 방법으로 규칙 기반 방법, 통계 기반 방법, 최대 엔트로피 기반 방법 등이 연구되어 왔다. 본 연구에서는 최근 기계 번역에서 우수한 성능을 보인 Sequence-to-Sequence 모델을 영어-한글 음차 표기에 적용해보았다. 실험결과, 다른 방법에 비해 우수한 성능을 보였다.

  • PDF

Maximum-Entropy Image Enhancement Using Brightness Mean and Variance (영상의 밝기 평균과 분산을 이용한 엔트로피 최대화 영상 향상 기법)

  • Yoo, Ji-Hyun;Ohm, Seong-Yong;Chung, Min-Gyo
    • Journal of Internet Computing and Services
    • /
    • v.13 no.3
    • /
    • pp.61-73
    • /
    • 2012
  • This paper proposes a histogram specification based image enhancement method, which uses the brightness mean and variance of an image to maximize the entropy of the image. In our histogram specification step, the Gaussian distribution is used to fit the input histogram as well as produce the target histogram. Specifically, the input histogram is fitted with the Gaussian distribution whose mean and variance are equal to the brightness mean(${\mu}$) and variance(${\sigma}2$) of the input image, respectively; and the target Gaussian distribution also has the mean of the value ${\mu}$, but takes as the variance the value which is determined such that the output image has the maximum entropy. Experimental results show that compared to the existing methods, the proposed method preserves the mean brightness well and generates more natural looking images.

Cluster Feature Selection using Entropy Weighting and SVD (엔트로피 가중치 및 SVD를 이용한 군집 특징 선택)

  • Lee, Young-Seok;Lee, Soo-Won
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.4
    • /
    • pp.248-257
    • /
    • 2002
  • Clustering is a method for grouping objects with similar properties into a same cluster. SVD(Singular Value Decomposition) is known as an efficient preprocessing method for clustering because of dimension reduction and noise elimination for a high dimensional and sparse data set like E-Commerce data set. However, it is hard to evaluate the worth of original attributes because of information loss of a converted data set by SVD. This research proposes a cluster feature selection method, called ENTROPY-SVD, to find important attributes for each cluster based on entropy weighting and SVD. Using SVD, one can take advantage of the latent structures in the association of attributes with similar objects and, using entropy weighting one can find highly dense attributes for each cluster. This paper also proposes a model-based collaborative filtering recommendation system with ENTROPY-SVD, called CFS-CF and evaluates its efficiency and utilization.

Texture Image Database Retrieval Using JPEG-2000 Partial Entropy Decoding (JPEG-2000 부분 엔트로피 복호화에 의향 질감 영상 데이터베이스 검색)

  • Park, Ha-Joong;Jung, Ho-Youl
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.5C
    • /
    • pp.496-512
    • /
    • 2007
  • In this paper, we propose a novel JPEG-2000 compressed image retrieval system using feature vector extracted through partial entropy decoding. Main idea of the proposed method is to utilize the context information that is generated during entropy encoding/decoding. In the framework of JPEG-2000, the context of a current coefficient is determined depending on the pattern of the significance and/or the sign of its neighbors in three bit-plane coding passes and four coding modes. The contexts provide a model for estimating the probability of each symbol to be coded. And they can efficiently describe texture images which have different pattern because they represent the local property of images. In addition, our system can directly search the images in the JPEG-2000 compressed domain without full decompression. Therefore, our proposed scheme can accelerate the work of retrieving images. We create various distortion and similarity image databases using MIT VisTex texture images for simulation. we evaluate the proposed algorithm comparing with the previous ones. Through simulations, we demonstrate that our method achieves good performance in terms of the retrieval accuracy as well as the computational complexity.