• Title/Summary/Keyword: information entropy

Search Result 887, Processing Time 0.025 seconds

A Cooperative Transmission Strategy using Entropy-based Relay Selection in Mobile Ad-hoc Wireless Sensor Networks with Rayleigh Fading Environments

  • An, Beong-Ku;Duy, Tran Trung;Kong, Hyung-Yun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.2
    • /
    • pp.147-162
    • /
    • 2009
  • In this paper, we propose a Cooperative Transmission Strategy using Entropy-based Relay Selection in Mobile Ad-hoc Wireless Sensor Networks(MAWSN) with Rayleigh Fading Environments. The main features and contributions of the proposed cooperative transmission strategy are as follows. First, entropy-based relay selection is used to improve data transmission reliability from a source node to a destination node. Second, we present a theoretical analysis model for the proposed cooperative transmission strategy with the outage probability of the end-to-end performance. The performance of our protocol is evaluated using analysis and simulation.

Some Characterization Results Based on Dynamic Survival and Failure Entropies

  • Abbasnejad, Maliheh
    • Communications for Statistical Applications and Methods
    • /
    • v.18 no.6
    • /
    • pp.787-798
    • /
    • 2011
  • In this paper, we develop some characterization results in terms of survival entropy of the first order statistic. In addition, we generalize the cumulative entropy recently proposed by Di Crescenzo and Logobardi (2009) to a new measure of information (called the failure entropy) and study some properties of it and its dynamic version. Furthermore, power distribution is characterized based on dynamic failure entropy.

A Consideration on Easter Convergence and Higher Reliability of The New Blind Equalization Algorithm using The Minimum Entropy Method

  • Matsumoto, Hiroki;Kusakari, Shinya;Furukawa, Toshihiro
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1467-1470
    • /
    • 2002
  • The minimum entropy method is one of blind equalization method. A conventional algorithm using the minimum entropy method has two problems : slower convergence and lower reliability of recovered signals. We propose a new algorithm using the minimum entropy method for solving the two problems. Pina31y, we confirm the validity of the proposed algorithm through computer simulation.

  • PDF

Improved Collaborative Filtering Using Entropy Weighting

  • Kwon, Hyeong-Joon
    • International Journal of Advanced Culture Technology
    • /
    • v.1 no.2
    • /
    • pp.1-6
    • /
    • 2013
  • In this paper, we evaluate performance of existing similarity measurement metric and propose a novel method using user's preferences information entropy to reduce MAE in memory-based collaborative recommender systems. The proposed method applies a similarity of individual inclination to traditional similarity measurement methods. We experiment on various similarity metrics under different conditions, which include an amount of data and significance weighting from n/10 to n/60, to verify the proposed method. As a result, we confirm the proposed method is robust and efficient from the viewpoint of a sparse data set, applying existing various similarity measurement methods and Significance Weighting.

  • PDF

Maximum entropy test for infinite order autoregressive models

  • Lee, Sangyeol;Lee, Jiyeon;Noh, Jungsik
    • Journal of the Korean Data and Information Science Society
    • /
    • v.24 no.3
    • /
    • pp.637-642
    • /
    • 2013
  • In this paper, we consider the maximum entropy test in in nite order autoregressiv models. Its asymptotic distribution is derived under the null hypothesis. A bootstrap version of the test is discussed and its performance is evaluated through Monte Carlo simulations.

Resolving Prepositional Phrase Attachment Using a Maximum Entropy Boosting Model (최대 엔트로피 부스팅 모델을 이용한 전치사 접속 모호성 해소)

  • 박성배;장병탁
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10d
    • /
    • pp.670-672
    • /
    • 2002
  • Park과 Zhang은 최대 엔트로피 모델(maximum entropy model)을 실제 자연언어 처리에 적용함에 있어서 나타날 수 있는 여러가지 문제를 해결하기 위한 최대 엔트로피 모델(maximum entropy boosting model)을 제시하여 문서 단위화(text chunking)에 성공적으로 적용하였다. 최대 엔트로피 부스팅 모델은 쉬운 모델링과 높은 성능을 보이는 장점을 가지고 있다. 본 논문에서는 최대 엔트로피 부스팅 모델을 영어 전치사 접속 모호성 해소에 적용한다. Wall Street Journal 말뭉치에 대한 실험 결과, 아주 작은 노력을 들였음에도 84.3%의 성능을 보여 지금까지 알려진 최고의 성능과 비슷한 결과를 보였다.

  • PDF

MEC; A new decision tree generator based on multi-base entropy (다중 엔트로피를 기반으로 하는 새로운 결정 트리 생성기 MEC)

  • 전병환;김재희
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.3
    • /
    • pp.423-431
    • /
    • 1997
  • A new decision tree generator MEC is proposed in this paper, which uses the difference of multi-base entropy as a consistent criterion for discretization and selection of attributes. To evaluate the performance of the proposed generator, it is compared to other generators which use criteria based on entropy and adopt different discretization styles. As an experimental result, it is shown that the proposed generator produces the most efficient classifiers, which have the least number of leaves at the same error rate, regardless of whether attribute values constituting the training set are discrete or continuous.

  • PDF

Which country's end devices are most sharing vulnerabilities in East Asia? (거시적인 관점에서 바라본 취약점 공유 정도를 측정하는 방법에 대한 연구)

  • Kim, Kwangwon;Won, Yoon Ji
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.5
    • /
    • pp.1281-1291
    • /
    • 2015
  • Compared to the past, people can control end devices via open channel. Although this open channel provides convenience to users, it frequently turns into a security hole. In this paper, we propose a new human-centered security risk analysis method that puts weight on the relationship between end devices. The measure derives from the concept of entropy rate, which is known as the uncertainty per a node in a network. As there are some limitations to use entropy rate as a measure in comparing different size of networks, we divide the entropy rate of a network by the maximum entropy rate of the network. Also, we show how to avoid the violation of irreducible, which is a precondition of the entropy rate of a random walk on a graph.

Copula entropy and information diffusion theory-based new prediction method for high dam monitoring

  • Zheng, Dongjian;Li, Xiaoqi;Yang, Meng;Su, Huaizhi;Gu, Chongshi
    • Earthquakes and Structures
    • /
    • v.14 no.2
    • /
    • pp.143-153
    • /
    • 2018
  • Correlation among different factors must be considered for selection of influencing factors in safety monitoring of high dam including positive correlation of variables. Therefore, a new factor selection method was constructed based on Copula entropy and mutual information theory, which was deduced and optimized. Considering the small sample size in high dam monitoring and distribution of daily monitoring samples, a computing method that avoids causality of structure as much as possible is needed. The two-dimensional normal information diffusion and fuzzy reasoning of pattern recognition field are based on the weight theory, which avoids complicated causes of the studying structure. Hence, it is used to dam safety monitoring field and simplified, which increases sample information appropriately. Next, a complete system integrating high dam monitoring and uncertainty prediction method was established by combining Copula entropy theory and information diffusion theory. Finally, the proposed method was applied in seepage monitoring of Nuozhadu clay core-wall rockfill dam. Its selection of influencing factors and processing of sample data were compared with different models. Results demonstrated that the proposed method increases the prediction accuracy to some extent.