• Communications for Statistical Applications and Methods
• /
• v.3 no.2
• /
• pp.175-185
• /
• 1996

For the Change-point problem in a sequence of binomial variables we consider the maximum likelihood estimator (MLE) of unknown change-point. Its asymptotic distribution is quite limited in the case of binomial variables with different numver of trials at each time point. Hinkley and Hinkley (1970) gives an asymptotic distribution of the MLE for a sequence of Bernoulli random variables. To find the asymptotic distribution a numerical method such as bootstrap can be used. Another concern of our interest in the inference on the change-point and we derive confidence sets based on the liklihood ratio test(LRT). We find approximate confidence sets from the bootstrap distribution and compare the two results through an example.

• Communications for Statistical Applications and Methods
• /
• v.29 no.3
• /
• pp.373-391
• /
• 2022

The distribution of observations in most econometric studies with spatial heterogeneity is skewed. Usually, a single transformation of the data is used to approximate normality and to model the transformed data with a normal assumption. This assumption is however not always appropriate due to the fact that panel data often exhibit non-normal characteristics. In this work, the normality assumption is relaxed in spatial mixed models, allowing for spatial heterogeneity. An inference procedure based on Bayesian mixed modeling is carried out with a multivariate skew-elliptical distribution, which includes the skew-t, skew-normal, student-t, and normal distributions as special cases. The methodology is illustrated through a simulation study and according to the empirical literature, we fit our models to non-life insurance consumption observed between 1998 and 2002 across a spatial panel of 103 Italian provinces in order to determine its determinants. Analyzing the posterior distribution of some parameters and comparing various model comparison criteria indicate the proposed model to be superior to conventional ones.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.50-56
• /
• 2001

As the fuzzy control is applied to servo system, the hardware implementation of the fuzzy information systems requires the high speed operations, short real time control and the small size systems. The aims of this study is to develop hardware of the fuzzy information systems to be apply to servo system. In this paper, we propose a calculation method of approximate reasoning for fuzzy control based on $\alpha$ -level set decomposition of fuzzy sets by quantize $\alpha$ -cuts. This method can be easily implemented with analog hardware. The influence of quantization Bevels of $\alpha$-cuts on output from fuzzy inference engine is investigated. It is concluded that 4 quantization levels give sufficient result for fuzzy control performance of dc servo system. The hardware implementation of proposed operation method and of the defuzzification by gravity center method which is directly converted to PWM actuating signal is also presented. It is verified useful with experiment for dc servo system.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.5
• /
• pp.1050-1057
• /
• 2004

The purpose of study is development of a fuzzy controller which independent of a computer and its software for fuzzy control of servo system. This paper describes a method of approximate reasoning for fuzzy control of servo system, based on decomposition of $\alpha$-level fuzzy sets, It is propose that fuzzy logic algorithm is a body from fuzzy inference to defuzzificaion in cases where the output variable u directly is generated PWM. The effectiveness of quantified $\alpha$-levels on input/output characteristics of fuzzy controller and output response of DC servo system is investigated. It is concluded that $\alpha$-cut 4 levels give a sufficient result for fuzzy control performance of DC servo system. The experimental results shows that the proposed hardware method is effective for practical applications of DC servo system.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.231-238
• /
• 2002

As a modeling method where the merits of fuzzy inference system and evolutionary computation are put together, evolutionary fuzzy modeling performs global approximate optimization. The paper proposes fuzzy clustering as fuzzy rule generation process which is one of the most important steps in evolutionary fuzzy modeling. With application of fuzzy clustering into the experiment or simulation results, fuzzy rules which properly describe non-linear and complex design problem can be obtained. The efficiency of evolutionary fuzzy modeling can be improved utilizing the membership degrees of data to clusters from the results of fuzzy clustering. To ensure the validity of the proposed method, the real design problem of an automotive inner trim is applied and the global approximation is achieved. Evolutionary fuzzy modeling is performed for several cases which differ in the number of clusters and the criterion of rule selection and their results are compared to prove that the proposed method can provide proper fuzzy rules for a given system and reduce computation time while maintaining the errors of modeling as a satisfactory level.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.951-958
• /
• 1998

In this paper, we propose a backward reasoning algorithm which can be utilized in the fuzzy Petri-net representation representing fuzzy production rules. The fuzzy Petri-net representation can be used to model a approximate reasoning system and implement a fuzzy inference engine. The proposed algorithm, which uses the proper belief evaluation functions according to fuzzy concepts in antecedentes and consequents of fuzzy production rules, is more closer to human intuition and reasoning than other methods. This algorithm generates the backward reasoning path from the goal to the initial nodes and evaluates the belief value of the goal node using belief evaluation functions.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1093-1101
• /
• 2009

Quantile regression has become a more widely used technique to describe the distribution of a response variable given a set of explanatory variables. This paper proposes a novel modelfor quantile regression using doubly penalized kernel machine with support vector machine iteratively reweighted least squares (SVM-IRWLS). To make inference about the shape of a population distribution, the widely popularregression, would be inadequate, if the distribution is not approximately Gaussian. We present a likelihood-based approach to the estimation of the regression quantiles that uses the asymmetric Laplace density.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.33 no.6
• /
• pp.861-868
• /
• 2023

One of the key technologies in providing data analysis in the deep learning while maintaining security is fully homomorphic encryption. Due to constraints in operations on fully homomorphically encrypted data, non-arithmetic functions used in deep learning must be approximated by polynomials. Until now, the degrees of approximation polynomials with composite minimax polynomials have been uniformly set across layers, which poses challenges for effective network designs on fully homomorphic encryption. This study theoretically proves that setting different degrees of approximation polynomials constructed by composite minimax polynomial in each layer does not pose any issues in the inference on convolutional neural networks.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.257-267
• /
• 2017

Compressed Sensing(CS) deals with linear inverse problems. The theoretical results of CS have had an impact on inference problems and presented amazing research achievements in the related fields including signal processing and information theory. However, in order for CS to be applied in practical environments, there are two significant challenges to be solved. One is to guarantee in real time recovery of CS signals, and the other is that the signals have to be sparse. To this end, the latest researches using deep learning technology have emerged. In this paper, we consider CS problems based on deep learning and discuss the latest research results. And the approaches for CS signal reconstruction using deep learning show superior results in terms of recovery time and performance. It is expected that the approaches for CS reconstruction using deep learning shown in recent studies can not only raise the possibility of utilization of CS, but also be highly exploited in the fields of signal processing and communication areas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.7
• /
• pp.2414-2434
• /
• 2015

Among numerous localization schemes proposed specifically for Wireless Sensor Network (WSN), the range-free localization algorithms based on the received signal strength indication (RSSI) have attracted considerable research interest for their simplicity and low cost. As a typical range-free algorithm, Approximate Point In Triangulation test (APIT) suffers from significant estimation errors due to its theoretical defects and RSSI inaccuracy. To address these problems, a novel localization method called FIAPIT, which is a combination of an improved APIT (IAPIT) and a fuzzy logic system, is proposed. The proposed IAPIT addresses the theoretical defects of APIT in near (it's defined as a point adjacent to a sensor is closer to three vertexes of a triangle area where the sensor resides simultaneously) and far (the opposite case of the near case) cases partly. To compensate for negative effects of RSSI inaccuracy, a fuzzy system, whose logic inference is based on IAPIT, is applied. Finally, the sensor's coordinates are estimated as the weighted average of centers of gravity (COGs) of triangles' intersection areas. Each COG has a different weight inferred by FIAPIT. Numerical simulations were performed to compare four algorithms with varying system parameters. The results show that IAPIT corrects the defects of APIT when adjacent nodes are enough, and FIAPIT is better than others when RSSI is inaccuracy.