• Title/Summary/Keyword: Optimal Variable Selection

Search Result 95, Processing Time 0.028 seconds

Reducing Power Consumption of a Scheduling Algorithm for Optimal Selection of Supply Voltage under the Time Constraint (시간 제약 조건하에서의 최적 선택 공급 전압을 위한 전력 감소 스케줄링)

  • 최지영;김희석
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.27 no.11C
    • /
    • pp.1132-1138
    • /
    • 2002
  • This paper proposes a reducing power consumption of a scheduling algorithm for optimal selection of supply voltage. In scheduling of reduction power consumption, we determine the control steps of operations to be executed by exploiting the possibility of using variable voltage levels to reduce power consumption. In the optimal selection of supply voltage binding, we minimize the main factor of the power consumption of the switching activity on the registers using a graph coloring technique. From a set of experiments using high-level benchmark examples, we show that the proposed algorithm prefer to use optimal selection supply voltages rather than uniformed single voltage is effective in reducing power consumption.

Effect of Different Variable Selection and Estimation Methods on Performance of Fault Diagnosis (이상진단 성능에 미치는 변수선택과 추정방법의 영향)

  • Cho, Hyun-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.9
    • /
    • pp.551-557
    • /
    • 2019
  • Diagnosis of abnormal faults is essential for producing high quality products. The role of real-time diagnosis is quite increasing in the batch processes of producing high value-added products such as semiconductors, pharmaceuticals, and so forth. In this study, we evaluate the effect of variable selection and future-value estimation techniques on the performance of the diagnosis system, which is based on nonlinear classification and measurement data. The diagnostic performance can be improved by selecting only the variables that are important and have high contribution for diagnosis. Thus, the diagnostic performance of several variable selection techniques is compared and evaluated. In addition, missing data of a new batch, called future observations, should be estimated because the full data of a new batch is not available before the end of the cycle. In this work the use of different estimation techniques is analyzed. A case study on the polyvinyl chloride batch process was carried out so that optimal variable selection and estimation methods were obtained: maximum 21.9% and 13.3% improvement by variable selection and maximum 25.8% and 15.2% improvement by estimation methods.

Variable Selection in PLS Regression with Penalty Function (벌점함수를 이용한 부분최소제곱 회귀모형에서의 변수선택)

  • Park, Chong-Sun;Moon, Guy-Jong
    • Communications for Statistical Applications and Methods
    • /
    • v.15 no.4
    • /
    • pp.633-642
    • /
    • 2008
  • Variable selection algorithm for partial least square regression using penalty function is proposed. We use the fact that usual partial least square regression problem can be expressed as a maximization problem with appropriate constraints and we will add penalty function to this maximization problem. Then simulated annealing algorithm can be used in searching for optimal solutions of above maximization problem with penalty functions added. The HARD penalty function would be suggested as the best in several aspects. Illustrations with real and simulated examples are provided.

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.2
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

Optimal Road Maintenance Section Selection Using Mixed Integer Programming (혼합정수계획법을 활용한 도로포장 보수구간 선정 최적화 연구)

  • Cho, Geonyoung;Lim, Heejong
    • International Journal of Highway Engineering
    • /
    • v.19 no.3
    • /
    • pp.65-70
    • /
    • 2017
  • PURPOSES : Pavement Management System contains the data that describe the condition of the road. Under limited budget, the data can be utilized for efficient plans. The objective of this research is to develop a mixed integer program model that maximizes remaining durable years (or Lane-Kilometer-Years) in road maintenance planning. METHODS : An optimization model based on a mixed integer program is developed. The model selects a cluster of sectors that are adjacent to each other according to the road condition. The model also considers constraints required by the Seoul Metropolitan Facilities Management Corporation. They select two lanes at most not to block the traffic and limit the number of sectors for one-time construction to finish the work in given time. We incorporate variable cost constraints. As the model selects more sectors, the unit cost of the construction becomes smaller. The optimal choice of the number of sectors is implemented using piecewise linear constraints. RESULTS : Data (SPI) collected from Pavement Management System managed by Seoul Metropolitan City are fed into the model. Based on the data and the model, the optimal maintenance plans are established. Some of the optimal plans cannot be generated directly in existing heuristic approach or by human intuition. CONCLUSIONS:The mathematical model using actual data generates the optimal maintenance plans.

Machine Learning based Optimal Location Modeling for Children's Smart Pedestrian Crosswalk: A Case Study of Changwon-si (머신러닝을 활용한 어린이 스마트 횡단보도 최적입지 선정 - 창원시 사례를 중심으로 -)

  • Lee, Suhyeon;Suh, Youngwon;Kim, Sein;Lee, Jaekyung;Yun, Wonjoo
    • Journal of KIBIM
    • /
    • v.12 no.2
    • /
    • pp.1-11
    • /
    • 2022
  • Road traffic accidents (RTAs) are the leading cause of accidental death among children. RTA reduction is becoming an increasingly important social issue among children. Municipalities aim to resolve this issue by introducing "Smart Pedestrian Crosswalks" that help prevent traffic accidents near children's facilities. Nonetheless such facilities tend to be installed in relatively limited number of areas, such as the school zone. In order for budget allocation to be efficient and policy effects maximized, optimal location selection based on machine learning is needed. In this paper, we employ machine learning models to select the optimal locations for smart pedestrian crosswalks to reduce the RTAs of children. This study develops an optimal location index using variable importance measures. By using k-means clustering method, the authors classified the crosswalks into three types after the optimal location selection. This study has broadened the scope of research in relation to smart crosswalks and traffic safety. Also, the study serves as a unique contribution by integrating policy design decisions based on public and open data.

Rancidity Prediction of Soybean Oil by Using Near-Infrared Spectroscopy Techniques

  • Hong, Suk-Ju;Lee, Ah-Yeong;Han, Yun-hyeok;Park, Jongmin;So, Jung Duck;Kim, Ghiseok
    • Journal of Biosystems Engineering
    • /
    • v.43 no.3
    • /
    • pp.219-228
    • /
    • 2018
  • Purpose: This study evaluated the feasibility of a near-infrared spectroscopy technique for the rancidity prediction of soybean oil. Methods: A near-infrared spectroscopy technique was used to evaluate the rancidity of soybean oils which were artificially deteriorated. A soybean oil sample was collected, and the acid values were measured using titrimetric analysis. In addition, the transmission spectra of the samples were obtained for whole test periods. The prediction model for the acid value was constructed by using a partial least-squares regression (PLSR) technique and the appropriate spectrum preprocessing methods. Furthermore, optimal wavelength selection methods such as variable importance in projection (VIP) and bootstrap of beta coefficients were applied to select the most appropriate variables from the preprocessed spectra. Results: There were significantly different increases in the acid values from the sixth days onwards during the 14-day test period. In addition, it was observed that the NIR spectra that exhibited intense absorption at 1,195 nm and 1,410 nm could indicate the degradation of soybean oil. The PLSR model developed using the Savitzky-Golay $2^{nd}$ order derivative method for preprocessing exhibited the highest performance in predicting the acid value of soybean oil samples. onclusions: The study helped establish the feasibility of predicting the rancidity of the soybean oil (using its acid value) by means of a NIR spectroscopy together with optimal variable selection methods successfully. The experimental results suggested that the wavelengths of 1,150 nm and 1,450 nm, which were highly correlated with the largest absorption by the second and first overtone of the C-H, O-H stretch vibrational transition, were caused by the deterioration of soybean oil.

A Study on Optimal Allocation of Short Surface-to-Air Missile (단거리 지대공 미사일의 최적배치에 관한 연구)

  • 이영해;남상억
    • Journal of the military operations research society of Korea
    • /
    • v.26 no.1
    • /
    • pp.34-46
    • /
    • 2000
  • The object of this study is to construct a model for an optimal allocation of short surface to air missile defending our targets most efficiently from hostile aircraft´s attack. For the purpose of this, we analyze and establish facility allocation concept of existing models, apply set covering theory appropriate to problem´s properties, present the process of calculating the probability of target being protected, apply Sherali-Kim´s branching variable selection strategy, and then construct the model. As constructed model apply the reducing problem with application, we confirm that we can apply the large scale, real problem.

  • PDF

A Bayes Criterion for Selecting Variables in MDA (MDA에서 판별변수 선택을 위한 베이즈 기준)

  • 김혜중;유희경
    • The Korean Journal of Applied Statistics
    • /
    • v.11 no.2
    • /
    • pp.435-449
    • /
    • 1998
  • In this article we have introduced a Bayes criterion for the variable selection in multiple discriminant analysis (MDA). The criterion is a default Bayes factor for the comparision of homo/heteroscadasticity of the multivariate normal means. The default Bayes factor is obtained from a development of the imaginary training sample method introduced by Spiegelhalter and Smith (1982). Based an the criterion, we also provided a test for additional discrimination in MDA. The advantage of the criterion is that it is not only applicable for the optimal subset selection method but for the stepwise method. More over, the criterion can be reduced to that for two-group discriminant analysis. Thus the criterion can be regarded as an unified alternative to variable selection criteria suggested by various sampling theory approaches. To illustrate the performance of the criterion, a numerical study has bean done via Monte Carlo experiment.

  • PDF

Multiperiod Mean Absolute Deviation Uncertain Portfolio Selection

  • Zhang, Peng
    • Industrial Engineering and Management Systems
    • /
    • v.15 no.1
    • /
    • pp.63-76
    • /
    • 2016
  • Multiperiod portfolio selection problem attracts more and more attentions because it is in accordance with the practical investment decision-making problem. However, the existing literature on this field is almost undertaken by regarding security returns as random variables in the framework of probability theory. Different from these works, we assume that security returns are uncertain variables which may be given by the experts, and take absolute deviation as a risk measure in the framework of uncertainty theory. In this paper, a new multiperiod mean absolute deviation uncertain portfolio selection models is presented by taking transaction costs, borrowing constraints and threshold constraints into account, which an optimal investment policy can be generated to help investors not only achieve an optimal return, but also have a good risk control. Threshold constraints limit the amount of capital to be invested in each stock and prevent very small investments in any stock. Based on uncertain theories, the model is converted to a dynamic optimization problem. Because of the transaction costs, the model is a dynamic optimization problem with path dependence. To solve the new model in general cases, the forward dynamic programming method is presented. In addition, a numerical example is also presented to illustrate the modeling idea and the effectiveness of the designed algorithm.