• The Korean Journal of Applied Statistics
• /
• v.25 no.5
• /
• pp.829-835
• /
• 2012

When the input features are generated by factors in a classification problem, it is more meaningful to identify important factors, rather than individual features. The $F_{\infty}$-norm support vector machine(SVM) has been developed to perform automatic factor selection in classification. However, the $F_{\infty}$-norm SVM may suffer from estimation inefficiency and model selection inconsistency because it applies the same amount of shrinkage to each factor without assessing its relative importance. To overcome such a limitation, we propose the adaptive $F_{\infty}$-norm ($AF_{\infty}$-norm) SVM, which penalizes the empirical hinge loss by the sum of the adaptively weighted factor-wise $L_{\infty}$-norm penalty. The $AF_{\infty}$-norm SVM computes the weights by the 2-norm SVM estimator and can be formulated as a linear programming(LP) problem which is similar to the one of the $F_{\infty}$-norm SVM. The simulation studies show that the proposed $AF_{\infty}$-norm SVM improves upon the $F_{\infty}$-norm SVM in terms of classification accuracy and factor selection performance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.19 no.1
• /
• pp.25-33
• /
• 2009

Recently, the TS fuzzy models that include the linear equations in the consequent part are widely used for time series forecasting, and the prediction performance of them is somewhat dependent on the characteristics of time series such as stationariness. Thus, a new prediction method is suggested in this paper which is especially effective to nonstationary time series prediction. First, data preprocessing is introduced to extract the patterns and regularities of time series well, and then multiple model TS fuzzy predictors are constructed. Next, an appropriate model is chosen for each input data by an adaptive model selection mechanism based on rough sets, and the prediction is going. Finally, the error compensation procedure is added to improve the performance by decreasing the prediction error. Computer simulations are performed on typical cases to verify the effectiveness of the proposed method. It may be very useful for the prediction of time series with uncertainty and/or nonstationariness because it handles and reflects better the characteristics of data.

• Communications for Statistical Applications and Methods
• /
• v.20 no.4
• /
• pp.259-270
• /
• 2013

This paper considers a penalized composite quantile regression (CQR) that performs a variable selection in the linear model with grouped variables. An adaptive sup-norm penalized CQR (ASCQR) is proposed to select variables in a grouped manner; in addition, the consistency and oracle property of the resulting estimator are also derived under some regularity conditions. To improve the efficiency of estimation and variable selection, this paper suggests the two-stage penalized CQR (TSCQR), which uses the ASCQR to select relevant groups in the first stage and the adaptive lasso penalized CQR to select important variables in the second stage. Simulation studies are conducted to illustrate the finite sample performance of the proposed methods.

• Communications for Statistical Applications and Methods
• /
• v.25 no.6
• /
• pp.591-604
• /
• 2018

The accelerated failure time (AFT) model is a linear model under the log-transformation of survival time that has been introduced as a useful alternative to the proportional hazards (PH) model. In this paper we propose variable-selection procedures of fixed effects in a parametric AFT model using penalized likelihood approaches. We use three popular penalty functions, least absolute shrinkage and selection operator (LASSO), adaptive LASSO and smoothly clipped absolute deviation (SCAD). With these procedures we can select important variables and estimate the fixed effects at the same time. The performance of the proposed method is evaluated using simulation studies, including the investigation of impact of misspecifying the assumed distribution. The proposed method is illustrated with a primary biliary cirrhosis (PBC) data set.

• Journal of Korea Multimedia Society
• /
• v.21 no.10
• /
• pp.1182-1194
• /
• 2018

The Dynamic Adaptive Streaming over HTTP(DASH) is envisioned to evolve to meet an increasing demand on providing seamless video streaming services in the near future. The DASH performance heavily depends on the client's adaptive quality selection algorithm that is not included in the standard. The existing conventional algorithms are basically based on a procedural algorithm that is not easy to capture and reflect all variations of dynamic network and traffic conditions in a variety of network environments. To solve this problem, this paper proposes a novel quality selection mechanism based on the Deep Q-Network(DQN) model, the DQN-based DASH Adaptive Bitrate(ABR) mechanism. The proposed mechanism adopts a new reward calculation method based on five major performance metrics to reflect the current conditions of networks and devices in real time. In addition, the size of the consecutive video segment to be downloaded is also considered as a major learning metric to reflect a variety of video encodings. Experimental results show that the proposed mechanism quickly selects a suitable video quality even in high error rate environments, significantly reducing frequency of quality changes compared to the existing algorithm and simultaneously improving average video quality during video playback.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.597-602
• /
• 1987

In this paper, an adaptive observe based upon the exponentially weighted least-squares method is implemented in the design of a model reference adaptive controller for an unknown time-invariant discrete single-input single-output linear plant. A method of selecting the state variable filter is proposed. In this scheme, all the past data are weithted exponentially with the weighting coefficient.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.12 no.2
• /
• pp.1-10
• /
• 1975

This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

• The Journal of the Korea Contents Association
• /
• v.9 no.4
• /
• pp.27-33
• /
• 2009

Selection of the Lagrangian multiplier is a key factor to determine the performance of Rate-Distortion Optimization (RDO) in video coding. JM, reference S/W of H.264, employs only one RDO model for all macroblock. However, since the characteristics of macroblocks are different, RDO model adaptive to their characteristics can give some performance improvement. In this paper, we propose an RDO algorithm adaptive to characteristics of macroblocks. We empirically obtain the optimal Lagrangian multipliers considering characteristics of macroblocks. For performance evaluation, the proposed method is applied to JM10.2 and, as a result, we have PSNR gain of 0.2dB on average.

• Industrial Engineering and Management Systems
• /
• v.3 no.2
• /
• pp.116-122
• /
• 2004

This paper presents a process plan selection model with multiple objectives. The process plans for all parts should be selected under multiple objective environment as follows: (1) minimizing the sum of machine processing and material handling time of all the parts considering realistic shop factors such as production volume, processing time, machine capacity, and capacity of transfer device. (2) balancing the load between machines. A multiple objective mathematical model is proposed and an evolutionary algorithm with the adaptive recombination strategy is developed to solve the model. To illustrate the efficiency of proposed approach, numerical examples are presented. The proposed approach is found to be effective in offering a set of satisfactory Pareto solutions within a satisfactory CPU time in a multiple objective environment.

• Journal of information and communication convergence engineering
• /
• v.22 no.1
• /
• pp.1-6
• /
• 2024

Energy efficiency in wireless sensor networks (WSNs) is a critical issue because batteries are used for operation and communication. In terms of scalability, energy efficiency, data integration, and resilience, WSN-cluster-based routing algorithms often outperform routing algorithms without clustering. Low-energy adaptive clustering hierarchy (LEACH) is a cluster-based routing protocol with a high transmission efficiency to the base station. In this paper, we propose an energy consumption model for LEACH and compare it with the existing LEACH, advanced LEACH (ALEACH), and power-efficient gathering in sensor information systems (PEGASIS) algorithms in terms of network lifetime. The energy consumption model comprises energy-sensitive cluster formation and a cluster head selection technique. The setup and steady-state phases of the proposed model are discussed based on the cluster head selection. The simulation results demonstrated that a low-energy-consumption network was introduced, modeled, and validated for LEACH.