• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.809-824
• /
• 2002

we propose two methods which separate the variable selection step and the split-point selection step. We call these two algorithms as CHITES method and F&CHITES method. They adapted some of the best characteristics of CART, CHAID, and QUEST. In the first step the variable, which is most significant to predict the target class values, is selected. In the second step, the exhaustive search method is applied to find the splitting point based on the selected variable in the first step. We compared the proposed methods, CART, and QUEST in terms of variable selection bias and power, error rates, and training times. The proposed methods are not only unbiased in the null case, but also powerful for selecting correct variables in non-null cases.

• Journal of Broadcast Engineering
• /
• v.13 no.1
• /
• pp.128-136
• /
• 2008

In this paper, we propose a variable step search fast motion estimation algorithm using local statistics of neighboring motion vectors. Using the degree of correlation between neighboring motion vectors, motion search range is adaptively adjusted to reduce unnecessary search points. Based on the adjusted search range, motion vector is obtained by variable search step. Experimental results show that the proposed algorithm has the capability to dramatically reduce the search points and computing cost for motion estimation, comparing to fast full spiral search motion estimation and other fast motion estimation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11C
• /
• pp.1091-1097
• /
• 2005

In this paper, we propose fast motion estimation algorithm. Local statistics of a motion vector is highly correlated to motion vectors of its neighboring blocks. According to the property, block-based motion search range is adaptively determined in order to reduce unnecessary search points. Based on the determined search range, motion vector is obtained by variable step search motion estimation. Experimental results show that comparing to Full search motion estimation, the motion searching points of proposed algorithm is reduced as much as $98\%$. Moreover, PSNR and Bit Rate are almost same to Full search method.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.529-538
• /
• 2015

Due to the high efficiency and compact mechanical structure, direct drive variable speed generators are used for power conversion in wind turbines. The wind energy conversion system (WECS) considered in this paper consists of a permanent magnet synchronous generator (PMSG), uncontrolled rectifier, dc-dc boost converter controlled with maximum power point tracking (MPPT) and adaptive hysteresis controlled voltage source inverter (VSI). For high utilization of the converter's power capability and stabilizing voltage and power flow, constant DC-link voltage is essential. Step and search MPPT algorithm which senses the rectified voltage ($V_{DC}$) alone and controls the same is used to effectively maximize the output power. The adaptive hysteresis band current control is characterized by fast dynamic response and constant switching frequency. With MPPT and adaptive hysteresis band current control in VSI, the DC link voltage is maintained constant under variable wind speeds and transient grid currents respectively.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.119-130
• /
• 2023

We propose a quantized gradient search algorithm that can achieve global optimization by monotonically reducing the quantization step with respect to time when quantization is composed of integer or fixed-point fractional values applied to an optimization algorithm. According to the white noise hypothesis states, a quantization step is sufficiently small and the quantization is well defined, the round-off error caused by quantization can be regarded as a random variable with identically independent distribution. Thus, we rewrite the searching equation based on a gradient descent as a stochastic differential equation and obtain the monotonically decreasing rate of the quantization step, enabling the global optimization by stochastic analysis for deriving an objective function. Consequently, when the search equation is quantized by a monotonically decreasing quantization step, which suitably reduces the round-off error, we can derive the searching algorithm evolving from an optimization algorithm. Numerical simulations indicate that due to the property of quantization-based global optimization, the proposed algorithm shows better optimization performance on a search space to each iteration than the conventional algorithm with a higher success rate and fewer iterations.

• The Journal of Information Systems
• /
• v.26 no.3
• /
• pp.171-185
• /
• 2017

Purpose Recently, there has been an increase in attempts to analyze social phenomena, consumption trends, and consumption behavior through a vast amount of customer data such as web search traffic information and social buzz information in various fields such as flu prediction and real estate price prediction. Internet portal service providers such as google and naver are disclosing web search traffic information of online users as services such as google trends and naver trends. Academic and industry are paying attention to research on information search behavior and utilization of online users based on the web search traffic information. Although there are many studies predicting social phenomena, consumption trends, political polls, etc. based on web search traffic information, it is hard to find the research to explain and predict tourism demand and establish tourism policy using it. In this study, we try to use web search traffic information to explain the tourism demand for major cities in Gangwon-do, the representative tourist area in Korea, and to develop a nowcasting model for the demand. Design/methodology/approach In the first step, the literature review on travel demand and web search traffic was conducted in parallel in two directions. In the second stage, we conducted a qualitative research to confirm the information retrieval behavior of the traveler. In the next step, we extracted the representative tourist cities of Gangwon-do and confirmed which keywords were used for the search. In the fourth step, we collected tourist demand data to be used as a dependent variable and collected web search traffic information of each keyword to be used as an independent variable. In the fifth step, we set up a time series benchmark model, and added the web search traffic information to this model to confirm whether the prediction model improved. In the last stage, we analyze the prediction models that are finally selected as optimal and confirm whether the influence of the keywords on the prediction of travel demand. Findings This study has developed a tourism demand forecasting model of Gangwon-do, a representative tourist destination in Korea, by expanding and applying web search traffic information to tourism demand forecasting. We compared the existing time series model with the benchmarking model and confirmed the superiority of the proposed model. In addition, this study also confirms that web search traffic information has a positive correlation with travel demand and precedes it by one or two months, thereby asserting its suitability as a prediction model. Furthermore, by deriving search keywords that have a significant effect on tourism demand forecast for each city, representative characteristics of each region can be selected.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.9
• /
• pp.77-83
• /
• 1997

We present a fast adaptive block matching algorithm using variable search area and subsampling to estimate motion vector more exactly. In the presented method, the block is classified into one of three motion categories: zero motion vector block, medium-motion bolck or high-motion block according to mean absolute difference of the block. By the simulation, the computation amount of the presented methoe comparable to three step search algorithm and new three step search algorithm. In the fast image sequence, the PSNR of our algorithm increased more than TSS and NTSS, because our algorithm estimated motion vector more accurately.

• Journal of applied mathematics & informatics
• /
• v.8 no.1
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.285-286
• /
• 2008

In this paper, we propose adaptive search channel estimate algorithm. The proposed algorithm is modified LMS algorithm which has a variable step size and parallel convolution. In simulation result, a error estimate accuracy of the proposed algorithm is about -20 dB and general LMS algorithm is about 10 dB. The proposed algorithm is better error estimate accuracy than general LMS algorithm.

• Journal of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.79-85
• /
• 2004

We developed an algorithm to identify and determine periods of variable sources. With its robustness and high speed, it is expected to become an useful tool for surveys with large volume of data. This new scheme consists of an initial coarse. process of finding several candidate periods followed by a secondary process of much finer period search. With this multi-step approach, best candidates among statistically possible periods are produced without human supervision and also without any prior assumption on the nature of the variable star in question. We tested our algorithm with 381 stars taken from the ASAS survey and the result is encouraging. In about $76\%$ cases, our results are nearly identical as their published periods. Our algorithm failed to provide convincing periods for only about $10\%$ cases. For the remaining $14\%$, our results significantly differ from their periods. We show that, in many of these cases, our periods are superior and much closer to the true periods. However, the existence of failures, and also periods sometimes worse than manually controlled results, indicates that this algorithm needs further improvement. Nevertheless, the present experiment shows that this is a positive step toward a fully automated period analysis for future variability surveys.