• Journal of Power Electronics
• /
• v.17 no.5
• /
• pp.1288-1297
• /
• 2017

The estimation of the remaining useful life (RUL) of lithium-ion (Li-ion) batteries is important for intelligent battery management system (BMS). Data mining technology is becoming increasingly mature, and the RUL estimation of Li-ion batteries based on data-driven prognostics is more accurate with the arrival of the era of big data. However, the support vector machine (SVM), which is applied to predict the RUL of Li-ion batteries, uses the traditional single-radial basis kernel function. This type of classifier has weak generalization ability, and it easily shows the problem of data migration, which results in inaccurate prediction of the RUL of Li-ion batteries. In this study, a novel multi-kernel SVM (MSVM) based on polynomial kernel and radial basis kernel function is proposed. Moreover, the particle swarm optimization algorithm is used to search the kernel parameters, penalty factor, and weight coefficient of the MSVM model. Finally, this paper utilizes the NASA battery dataset to form the observed data sequence for regression prediction. Results show that the improved algorithm not only has better prediction accuracy and stronger generalization ability but also decreases training time and computational complexity.

• Communications for Statistical Applications and Methods
• /
• v.19 no.4
• /
• pp.517-526
• /
• 2012

In this paper a support vector method is proposed for use when the sample observations are contaminated by a normally distributed measurement error. The performance of deconvolution density estimators based on the support vector method is explored and compared with kernel density estimators by means of a simulation study. An interesting result was that for the estimation of kurtotic density, the support vector deconvolution estimator with a Gaussian kernel showed a better performance than the classical deconvolution kernel estimator.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.103-111
• /
• 2003

Kernel machines are used widely in real-world regression tasks. Kernel ridge regressions(KRR) and support vector machines(SVM) are typical kernel machines. Here, we focus on two types of KRR. One is inductive KRR. The other is transductive KRR. In this paper, we study how differently they work in the interpolation and extrapolation areas. Furthermore, we study prediction interval estimation method for KRR. This turns out to be a reliable and practical measure of prediction interval and is essential in real-world tasks.

• Communications for Statistical Applications and Methods
• /
• v.17 no.3
• /
• pp.451-457
• /
• 2010

This paper considers the problem of nonparametric deconvolution density estimation when sample observa-tions are contaminated by double exponentially distributed errors. Three different deconvolution density estima-tors are introduced: a weighted kernel density estimator, a kernel density estimator based on the support vector regression method in a RKHS, and a classical kernel density estimator. The performance of these deconvolution density estimators is compared by means of a simulation study.

• Journal of the Korean Statistical Society
• /
• v.31 no.3
• /
• pp.359-368
• /
• 2002

Nonparametric kernel regression problem is considered for a stationary dependent sequence ｛(Xi, Yj) 1 j $\geq$ 1 ｝. In particular consistency and rates of convergence are discussed, which gives some useful insight for the effect of dependence for stationary $\alpha$-mixing sequences.

• Journal of the Korean Mathematical Society
• /
• v.44 no.4
• /
• pp.835-844
• /
• 2007

This paper considers the problem of estimating the error distribution function in nonparametric regression models. Sufficient conditions are given under which the kernel estimator of the error distribution function based on nonparametric residuals satisfies the law of iterated logarithm.

• Communications for Statistical Applications and Methods
• /
• v.13 no.3
• /
• pp.503-512
• /
• 2006

In this paper, the Inverse Weibull distribution parameters have been estimated using a new estimation technique based on the non-parametric kernel density function that introduced as an alternative and reliable technique for estimation in life testing models. This technique will require bootstrapping from a set of sample observations for constructing the density functions of pivotal quantities and thus the confidence intervals for the distribution parameters. The performances of this technique have been studied comparing to the conditional inference on the basis of the mean lengths and the covering percentage of the confidence intervals, via Monte Carlo simulations. The simulation results indicated the robustness of the proposed method that yield reasonably accurate inferences even with fewer bootstrap replications and it is easy to be used than the conditional approach. Finally, a numerical example is given to illustrate the densities and the inferential methods developed in this paper.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.85-88
• /
• 2011

Fuzzy C-Means (FCM) 알고리듬은 가장 널리 사용되는 군집화 알고리듬 중 하나로 다양한 응용 분야에서 사용되고 있다. 하지만 FCM은 여러 가지 문제점을 가지고 있으며 초기 원형 설정이 그 중 하나이다. FCM은 국부 최적해에 수렴하므로 초기 원형 설정에 따라 클러스터링 결과가 달라진다. 이 논문에서는 이러한 FCM의 초기 원형 설정 문제를 개선하기 위하여 커널밀도 추정 (kernel density estimation) 기법을 활용하는 방법을 제안한다. 제안한 방법에서는 먼저 커널 밀도 추정을 수행한 후 밀도가 높은 지역에 클러스터의 초기 원형을 설정하고 원형이 설정된 영역의 밀도를 감소시키는 과정을 반복함으로써 효율적으로 초기 원형을 설정할 수 있다. 제안된 방법이 일반적으로 사용되는 무작위 초기화 방법에 비해 효율적이라는 사실은 실험결과를 통해 확인할 수 있다.

• ETRI Journal
• /
• v.34 no.5
• /
• pp.771-774
• /
• 2012

Typical channel allocation algorithms for secondary users do not include processes to reduce the frequency of switching from one channel to another caused by random interruptions by primary users, which results in high packet drops and delays. In this letter, with the purpose of decreasing the number of switches made between channels, we propose a nonparametric channel allocation algorithm that uses robust kernel density estimation to effectively schedule idle channel resources. Experiment and simulation results demonstrate that the proposed algorithm outperforms both random and parametric channel allocation algorithms in terms of throughput and packet drops.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.5
• /
• pp.905-912
• /
• 2009

We propose a doubly penalized kernel machine (DPKM) which uses heteroscedastic location-scale model as basic model and estimates both mean and volatility functions simultaneously by kernel machines. We also present the model selection method which employs the generalized approximate cross validation techniques for choosing the hyperparameters which affect the performance of DPKM. Artificial examples are provided to indicate the usefulness of DPKM for the mean and volatility functions estimation.