• 제목/요약/키워드: Optimal bandwidth selection

검색결과 26건 처리시간 0.019초

Optimal bandwidth in nonparametric classification between two univariate densities

  • ;강기훈
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2002년도 춘계 학술발표회 논문집
    • /
    • pp.1-5
    • /
    • 2002
  • We consider the problem of optimal bandwidth choice for nonparametric classification, based on kernel density estimators, where the problem of interest is distinguishing between two univariate distributions. When the densities intersect at a single point, optimal bandwidth choice depends on curvatures of the densities at that point. The problem of empirical bandwidth selection and classifying data in the tails of a distribution are also addressed.

  • PDF

$L^1$ Bandwidth Selection in Kernel Regression Function Estimation

  • Jhun, Myong-Shic
    • Journal of the Korean Statistical Society
    • /
    • 제17권1호
    • /
    • pp.1-8
    • /
    • 1988
  • Kernel estimates of an unknown regression function are studied. Bandwidth selection rule minimizing integrated absolute error loss function is considered. Under some reasonable assumptions, it is shown that the optimal bandwidth is unique and can be computed by using bisection algorithm. Adaptive bandwidth selection rule is proposed.

  • PDF

Local Bandwidth Selection for Nonparametric Regression

  • Lee, Seong-Woo;Cha, Kyung-Joon
    • Communications for Statistical Applications and Methods
    • /
    • 제4권2호
    • /
    • pp.453-463
    • /
    • 1997
  • Nonparametric kernel regression has recently gained widespread acceptance as an attractive method for the nonparametric estimation of the mean function from noisy regression data. Also, the practical implementation of kernel method is enhanced by the availability of reliable rule for automatic selection of the bandwidth. In this article, we propose a method for automatic selection of the bandwidth that minimizes the asymptotic mean square error. Then, the estimated bandwidth by the proposed method is compared with the theoretical optimal bandwidth and a bandwidth by plug-in method. Simulation study is performed and shows satisfactory behavior of the proposed method.

  • PDF

The shifted Chebyshev series-based plug-in for bandwidth selection in kernel density estimation

  • Soratja Klaichim;Juthaphorn Sinsomboonthong;Thidaporn Supapakorn
    • Communications for Statistical Applications and Methods
    • /
    • 제31권3호
    • /
    • pp.337-347
    • /
    • 2024
  • Kernel density estimation is a prevalent technique employed for nonparametric density estimation, enabling direct estimation from the data itself. This estimation involves two crucial elements: selection of the kernel function and the determination of the appropriate bandwidth. The selection of the bandwidth plays an important role in kernel density estimation, which has been developed over the past decade. A range of methods is available for selecting the bandwidth, including the plug-in bandwidth. In this article, the proposed plug-in bandwidth is introduced, which leverages shifted Chebyshev series-based approximation to determine the optimal bandwidth. Through a simulation study, the performance of the suggested bandwidth is analyzed to reveal its favorable performance across a wide range of distributions and sample sizes compared to alternative bandwidths. The proposed bandwidth is also applied for kernel density estimation on real dataset. The outcomes obtained from the proposed bandwidth indicate a favorable selection. Hence, this article serves as motivation to explore additional plug-in bandwidths that rely on function approximations utilizing alternative series expansions.

커널 회귀함수 추정에서 점근최적인 평활량의 선택에 관한 연구 (Asymptotic optimal bandwidth selection in kernel regression function estimation)

  • 석경하;김대학
    • Journal of the Korean Data and Information Science Society
    • /
    • 제9권1호
    • /
    • pp.19-27
    • /
    • 1998
  • 본 논문에서는 커널 회귀함수의 추정방법에서 최적수렴율 $n^{-1/2}$을 가지는 평활량을 선택하는 방법에 대한 연구를 고려하였다. 이러한 평활량의 선택을 위하여 먼저 평활량의 수행측도인 기대평균제곱오차의 근사값을 4차항까지 테일러 급수전개를 하고 그 전개식을 최소화하는 평활량을 고려하였다. 이때 이 평활량이 포함하고 있는 미지의 범함수를 높은 차수의 커널함수를 이용하여 더욱 정확히 추정할 수 있음을 제안한다. 또한 이렇게 구한 평활량과 최적 평활량과의 상대적 수렴율이 $n^{-1/2}$가 됨을 보였다.

  • PDF

Adaptive Transcoding for Object-based MPEG-4 Scene using Optimal Configuration of Objects

  • Cha, Kyung-Ae
    • 한국멀티미디어학회논문지
    • /
    • 제9권12호
    • /
    • pp.1560-1571
    • /
    • 2006
  • In order to transmit multimedia streams over the network with a timely changing channel bandwidth such as Internet, scalable video coding schemes have been studied to represent video in flexible bitstream. Much research has been made on how to represent encoded media(such as video) bitstream in scalable ways. In this paper, rte propose an optimal selection of the objects for MPEG-4 bitstream adaptation to meet a given constraint. We adopt a multiple choice knapsack problem with multi-step selection for the MPEG-4 objects with different bit-rate scaling levels in the MPEG-4 bitstream. The bitstream adaptation based on the optimal selection result is then to fetch the necessary parts of the MPEG-4 bitstream to constitute an adapted version of the original MPEG-4 binary resource. The experiment results show that the optimal selection of MPEG-4 objects for a given constraint can promisingly be made which meets the given constraint.

  • PDF

Multiple Constraint Routing Protocol for Frequency Diversity Multi-channel Mesh Networks using Interference-based Channel Allocation

  • Torregoza, John Paul;Hwang, Won-Joo
    • 한국멀티미디어학회논문지
    • /
    • 제10권12호
    • /
    • pp.1632-1644
    • /
    • 2007
  • Wireless Mesh Networks aim to attain large connectivity with minimum performance degradation, as network size is increase. As such, scalability is one of the main characteristics of Wireless Mesh Networks that differentiates it from other wireless networks. This characteristic creates the need for bandwidth efficiency strategies to ensure that network performance does not degrade as the size of the network increase. Several researches have been done to realize mesh networks. However, the researches conducted were mostly focused on a per TCP/IP layer basis. Also, the studies on bandwidth efficiency and bandwidth improvement are usually dealt with as separate issues. This paper aims to simultaneously study bandwidth efficiency and improvement. Aside from optimizing the bandwidth given a fixed capacity, the capacity is also increased using results of physical layer studies. In this paper, the capacity is improved by using the concept of non-overlapping channels for wireless communication. A channel allocation scheme is conceptualized to choose the transmission channel that would optimize the network performance parameters with consideration of chosen Quality of Service (QoS) parameters. Network utility maximization is used to optimize the bandwidth after channel selection. Furthermore, a routing scheme is proposed using the results of the network utilization method and the channel allocation scheme to find the optimal path that would maximize the network gain.

  • PDF

Security Clustering Algorithm Based on Integrated Trust Value for Unmanned Aerial Vehicles Network

  • Zhou, Jingxian;Wang, Zengqi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권4호
    • /
    • pp.1773-1795
    • /
    • 2020
  • Unmanned aerial vehicles (UAVs) network are a very vibrant research area nowadays. They have many military and civil applications. Limited bandwidth, the high mobility and secure communication of micro UAVs represent their three main problems. In this paper, we try to address these problems by means of secure clustering, and a security clustering algorithm based on integrated trust value for UAVs network is proposed. First, an improved the k-means++ algorithm is presented to determine the optimal number of clusters by the network bandwidth parameter, which ensures the optimal use of network bandwidth. Second, we considered variables representing the link expiration time to improve node clustering, and used the integrated trust value to rapidly detect malicious nodes and establish a head list. Node clustering reduce impact of high mobility and head list enhance the security of clustering algorithm. Finally, combined the remaining energy ratio, relative mobility, and the relative degrees of the nodes to select the best cluster head. The results of a simulation showed that the proposed clustering algorithm incurred a smaller computational load and higher network security.

광굴절결정의 파장선택성을 이용한 투과형 대역통과필터 (Transission type bandpass filter using wavelength selectivity of photorefractive crystal)

  • 안준원;김남;이권연;안주헌
    • 한국통신학회논문지
    • /
    • 제23권4호
    • /
    • pp.1051-1058
    • /
    • 1998
  • 광굴절결정에서 두 기록빔의 입사각에 따른 파장선택성을 이용해 원하는 통과대역과 중심파장을 갖는 대역통과필터로의 응용을 제안하였다. 2광파결합을 통해 Fe가 0.02Wt.% 도핑된 $LiNbO_3$ 결정의 회절특성을 실험함으로써, 가장 우수한 회절효율을 갖는 조건을 도출하고, 이러한 조건에서 원하는 대역 및 파장을 선택해 낼 수 있는 대역통과필터를 전광학적으로 구현하였다. 또한, 기록빔의 입사각을 변화시킴으로써, 임의의 원하는 필터 특성을 얻을 수 있음을 실험적으로 증명하였다.

  • PDF

SMT 프로세서에 최적화된 명령어 페치 전략에 관한 연구 (An Optimal Instruction Fetch Strategy for SMT Processors)

  • 홍인표;문병인;김문경;이용석
    • 한국통신학회논문지
    • /
    • 제27권5C호
    • /
    • pp.512-521
    • /
    • 2002
  • 최근에 성능의 한계를 드러내고 있는 수퍼스칼라 RISC를 대체할 새로운 프로세서 구조로서 SMT(Simultaneous Multi-Threading)이 활발히 연구되고 있다. SMT는 하나의 프로세서에 여러 개의 스레드가 하드웨어 자원을 동적으로 공유하며 동시에 수행되는 구조이다. 이러한 환경에서는 프로세서 안에 존재하는 여러 스레드로부터 명령어를 원활하게 공급하여 주는 것이 중요하다. SMT 프로세서는 기존의 프로세서에 비하여 사이클 당 실제 처리되는 명령어 수가 월등히 많기 때문에, 사이클 당 명령어 페치량과 페치된 명령어를 임시 저장하는 페치 큐의 엔트리수가 신중하게 결정되어야 한다. 또한 사이클마다 페치할 스레드와 각 스레드의 페치량을 결정하는 것이 성능에 큰 영향을 미친다. 따라서 본 논문에서는 이러한 요소들이 프로세서 전체의 성능에 미치는 영향을 분석하고 그 결과를 바탕으로 SMT 프로세서에 최적화된 명령어 페치 전략에 대하여 논한다.