• 제목/요약/키워드: Improved entropy

검색결과 126건 처리시간 0.023초

Improving Sample Entropy Based on Nonparametric Quantile Estimation

  • Park, Sang-Un;Park, Dong-Ryeon
    • Communications for Statistical Applications and Methods
    • /
    • 제18권4호
    • /
    • pp.457-465
    • /
    • 2011
  • Sample entropy (Vasicek, 1976) has poor performance, and several nonparametric entropy estimators have been proposed as alternatives. In this paper, we consider a piecewise uniform density function based on quantiles, which enables us to evaluate entropy in each interval, and study the poor performance of the sample entropy in terms of the poor estimation of lower and upper quantiles. Then we propose some improved entropy estimators by simply modifying the quantile estimators, and compare their performances with some existing estimators.

Vertical Handoff Decision Algorithm combined Improved Entropy Weighting with GRA for Heterogeneous Wireless Networks

  • Zhao, Shasha;Wang, Fei;Ning, Yueqiang;Xiao, Yi;Zhang, Dengying
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권11호
    • /
    • pp.4611-4624
    • /
    • 2020
  • Future network scenario will be a heterogeneous wireless network environment composed of multiple networks and multimode terminals (MMT). Seamless switching and optimal connectivity for MMT among different networks and different services become extremely important. Here, a vertical handoff algorithm combined an improved entropy weighting method based on grey relational analysis (GRA) is proposed. In which, the improved entropy weight method is used to obtain the objective weights of the network attributes, and GRA is done to rank the candidate networks in order to choose the best network. Through simulation and comparing the results with other vertical handoff decision algorithms, the number of handoffs and reversal phenomenon are reduced with the proposed algorithm, which shows a better performance.

Cross Entropy 기반의 주파수 영역에서 스펙트럼 센싱 성능 개선 (An Improved Cross Entropy-Based Frequency-Domain Spectrum Sensing)

  • 타사미아;구준롱;장성진;김재명
    • 대한전자공학회논문지TC
    • /
    • 제48권3호
    • /
    • pp.50-59
    • /
    • 2011
  • 본 논문은 주파수 영역에서 과거와 현재에 센싱된 결과들의 관계를 이용한 스펙트럼 센싱기법을 제안하였다. 기존에 제안된 대부분의 스펙트럼 센싱기법은 해당 시간에 센싱된 우선사용자의 신호만을 다루고 있다. 해당 시간 이전의 우선사용자의 상태는 조건부확률을 사용하여 검출기의 신뢰성을 증가시킬 수 있다. 따라서, 본 논문은 이전 시간과 해당 시간의 스펙트럼 센싱 결과를 사용하는 cross entropy 기반의 스펙트럼 센싱기법을 제안하며 이를 통해 우선사용자 신호 검출 성능을 향상시키고 잡음에 강인한 성능을 가질 수 있다. 이전 시간에 검출된 신호가 잡음인 경우 cross entropy 기반의 스펙트럼 센싱 성능 감소는 기존의 entropy 기반의 센싱기법과 동일하게 된다. 이러한 문제를 해결하기 위해 본 논문에서는 보다 향상된 cross entropy 센싱기법을 제안하였다. 본 논문은 시뮬레이션을 통해 가장 최근에 제안된 주파수 영역에서의 entropy 기반 스펙트럼 센싱기법 보다 제안된 방법이 더 나은 성능을 보이는 것을 보였다.

PSS Evaluation Based on Vague Assessment Big Data: Hybrid Model of Multi-Weight Combination and Improved TOPSIS by Relative Entropy

  • Lianhui Li
    • Journal of Information Processing Systems
    • /
    • 제20권3호
    • /
    • pp.285-295
    • /
    • 2024
  • Driven by the vague assessment big data, a product service system (PSS) evaluation method is developed based on a hybrid model of multi-weight combination and improved TOPSIS by relative entropy. The index values of PSS alternatives are solved by the integration of the stakeholders' vague assessment comments presented in the form of trapezoidal fuzzy numbers. Multi-weight combination method is proposed for index weight solving of PSS evaluation decision-making. An improved TOPSIS by relative entropy (RE) is presented to overcome the shortcomings of traditional TOPSIS and related modified TOPSIS and then PSS alternatives are evaluated. A PSS evaluation case in a printer company is given to test and verify the proposed model. The RE closeness of seven PSS alternatives are 0.3940, 0.5147, 0.7913, 0.3719, 0.2403, 0.4959, and 0.6332 and the one with the highest RE closeness is selected as the best alternative. The results of comparison examples show that the presented model can compensate for the shortcomings of existing traditional methods.

Deriving a New Divergence Measure from Extended Cross-Entropy Error Function

  • Oh, Sang-Hoon;Wakuya, Hiroshi;Park, Sun-Gyu;Noh, Hwang-Woo;Yoo, Jae-Soo;Min, Byung-Won;Oh, Yong-Sun
    • International Journal of Contents
    • /
    • 제11권2호
    • /
    • pp.57-62
    • /
    • 2015
  • Relative entropy is a divergence measure between two probability density functions of a random variable. Assuming that the random variable has only two alphabets, the relative entropy becomes a cross-entropy error function that can accelerate training convergence of multi-layer perceptron neural networks. Also, the n-th order extension of cross-entropy (nCE) error function exhibits an improved performance in viewpoints of learning convergence and generalization capability. In this paper, we derive a new divergence measure between two probability density functions from the nCE error function. And the new divergence measure is compared with the relative entropy through the use of three-dimensional plots.

An Improved Defect Detection Algorithm of Jean Fabric Based on Optimized Gabor Filter

  • Ma, Shuangbao;Liu, Wen;You, Changli;Jia, Shulin;Wu, Yurong
    • Journal of Information Processing Systems
    • /
    • 제16권5호
    • /
    • pp.1008-1014
    • /
    • 2020
  • Aiming at the defect detection quality of denim fabric, this paper designs an improved algorithm based on the optimized Gabor filter. Firstly, we propose an improved defect detection algorithm of jean fabric based on the maximum two-dimensional image entropy and the loss evaluation function. Secondly, 24 Gabor filter banks with 4 scales and 6 directions are created and the optimal filter is selected from the filter banks by the one-dimensional image entropy algorithm and the two-dimensional image entropy algorithm respectively. Thirdly, these two optimized Gabor filters are compared to realize the common defect detection of denim fabric, such as normal texture, miss of weft, hole and oil stain. The results show that the improved algorithm has better detection effect on common defects of denim fabrics and the average detection rate is more than 91.25%.

Improved Collaborative Filtering Using Entropy Weighting

  • Kwon, Hyeong-Joon
    • International Journal of Advanced Culture Technology
    • /
    • 제1권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

An Improved Entropy Based Sensing by Exploring Phase Information

  • Lee, Haowei;Gu, Junrong;Sohn, Sung-Hwan;Jang, Sung-Jeen;Kim, Jae-Moung
    • 한국통신학회논문지
    • /
    • 제35권9A호
    • /
    • pp.896-905
    • /
    • 2010
  • In this paper, we present a new sensing method based on phase entropy. Entropy is a measurement which quantifies the information content contained in a signal. For the PSK modulation, the information is encoded in the phase of the transmitted signal. By focusing on phase, more information is collected during sensing, which suggests a superior performance. The sensing based on Phase entropy is not limited to PSK signal. We generalize it to PAM signal as well. It is more advantageous to detect the phase. The simulation results have confirmed the excellent performance of this novel sensing algorithm.

Crack identification with parametric optimization of entropy & wavelet transformation

  • Wimarshana, Buddhi;Wu, Nan;Wu, Christine
    • Structural Monitoring and Maintenance
    • /
    • 제4권1호
    • /
    • pp.33-52
    • /
    • 2017
  • A cantilever beam with a breathing crack is studied to improve the breathing crack identification sensitivity by the parametric optimization of sample entropy and wavelet transformation. Crack breathing is a special bi-linear phenomenon experienced by fatigue cracks which are under dynamic loadings. Entropy is a measure, which can quantify the complexity or irregularity in system dynamics, and hence employed to quantify the bi-linearity/irregularity of the vibration response, which is induced by the breathing phenomenon of a fatigue crack. To improve the sensitivity of entropy measurement for crack identification, wavelet transformation is merged with entropy. The crack identification is studied under different sinusoidal excitation frequencies of the cantilever beam. It is found that, for the excitation frequencies close to the first modal frequency of the beam structure, the method is capable of detecting only 22% of the crack depth percentage ratio with respect to the thickness of the beam. Using parametric optimization of sample entropy and wavelet transformation, this crack identification sensitivity is improved up to 8%. The experimental studies are carried out, and experimental results successfully validate the numerical parametric optimization process.

Practical evaluation of encrypted traffic classification based on a combined method of entropy estimation and neural networks

  • Zhou, Kun;Wang, Wenyong;Wu, Chenhuang;Hu, Teng
    • ETRI Journal
    • /
    • 제42권3호
    • /
    • pp.311-323
    • /
    • 2020
  • Encrypted traffic classification plays a vital role in cybersecurity as network traffic encryption becomes prevalent. First, we briefly introduce three traffic encryption mechanisms: IPsec, SSL/TLS, and SRTP. After evaluating the performances of support vector machine, random forest, naïve Bayes, and logistic regression for traffic classification, we propose the combined approach of entropy estimation and artificial neural networks. First, network traffic is classified as encrypted or plaintext with entropy estimation. Encrypted traffic is then further classified using neural networks. We propose using traffic packet's sizes, packet's inter-arrival time, and direction as the neural network's input. Our combined approach was evaluated with the dataset obtained from the Canadian Institute for Cybersecurity. Results show an improved precision (from 1 to 7 percentage points), and some application classification metrics improved nearly by 30 percentage points.