• Title/Summary/Keyword: Feature selection optimization

Search Result 94, Processing Time 0.022 seconds

Development of Tool Item Selection System Aiding CAM Procedure for Injection Mold (사출금형 CAM 작업 지원용 공구 항목 추천 시스템 개발)

  • 김성근;양학진;허영무;양진석
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.20 no.1
    • /
    • pp.118-125
    • /
    • 2003
  • As consumer's desire becomes various, agility of mold manufacturing is the most important factor for competitive mold manufacturer. Decision making process is required to produce optimal result of CAM systems in using commercial CAM system to generate tool path. The paper proposes a methodology fur computer-assisted tool selection procedures for various cutting type of rough, semi-rough and finish cuts. The procedure provides assistance for machining tool selection by analyzing sliced CAD model section of die cavity and core. Information about machining time for the generated NC-code is used to aid the tool selection. The module is developed with commercial CAM API. This module will be used fur the optimization of tool selection and planning process.

Development of an Optimized Feature Extraction Algorithm for Throat Signal Analysis

  • Jung, Young-Giu;Han, Mun-Sung;Lee, Sang-Jo
    • ETRI Journal
    • /
    • v.29 no.3
    • /
    • pp.292-299
    • /
    • 2007
  • In this paper, we present a speech recognition system using a throat microphone. The use of this kind of microphone minimizes the impact of environmental noise. Due to the absence of high frequencies and the partial loss of formant frequencies, previous systems using throat microphones have shown a lower recognition rate than systems which use standard microphones. To develop a high performance automatic speech recognition (ASR) system using only a throat microphone, we propose two methods. First, based on Korean phonological feature theory and a detailed throat signal analysis, we show that it is possible to develop an ASR system using only a throat microphone, and propose conditions of the feature extraction algorithm. Second, we optimize the zero-crossing with peak amplitude (ZCPA) algorithm to guarantee the high performance of the ASR system using only a throat microphone. For ZCPA optimization, we propose an intensification of the formant frequencies and a selection of cochlear filters. Experimental results show that this system yields a performance improvement of about 4% and a reduction in time complexity of 25% when compared to the performance of a standard ZCPA algorithm on throat microphone signals.

  • PDF

A Hybrid Soft Computing Technique for Software Fault Prediction based on Optimal Feature Extraction and Classification

  • Balaram, A.;Vasundra, S.
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.5
    • /
    • pp.348-358
    • /
    • 2022
  • Software fault prediction is a method to compute fault in the software sections using software properties which helps to evaluate the quality of software in terms of cost and effort. Recently, several software fault detection techniques have been proposed to classifying faulty or non-faulty. However, for such a person, and most studies have shown the power of predictive errors in their own databases, the performance of the software is not consistent. In this paper, we propose a hybrid soft computing technique for SFP based on optimal feature extraction and classification (HST-SFP). First, we introduce the bat induced butterfly optimization (BBO) algorithm for optimal feature selection among multiple features which compute the most optimal features and remove unnecessary features. Second, we develop a layered recurrent neural network (L-RNN) based classifier for predict the software faults based on their features which enhance the detection accuracy. Finally, the proposed HST-SFP technique has the more effectiveness in some sophisticated technical terms that outperform databases of probability of detection, accuracy, probability of false alarms, precision, ROC, F measure and AUC.

Optimization of Domain-Independent Classification Framework for Mood Classification

  • Choi, Sung-Pil;Jung, Yu-Chul;Myaeng, Sung-Hyon
    • Journal of Information Processing Systems
    • /
    • v.3 no.2
    • /
    • pp.73-81
    • /
    • 2007
  • In this paper, we introduce a domain-independent classification framework based on both k-nearest neighbor and Naive Bayesian classification algorithms. The architecture of our system is simple and modularized in that each sub-module of the system could be changed or improved efficiently. Moreover, it provides various feature selection mechanisms to be applied to optimize the general-purpose classifiers for a specific domain. As for the enhanced classification performance, our system provides conditional probability boosting (CPB) mechanism which could be used in various domains. In the mood classification domain, our optimized framework using the CPB algorithm showed 1% of improvement in precision and 2% in recall compared with the baseline.

Development of Tool Selection System Aiding CAM Works for Injection Mold (사출금형 CAM 작업 지원용 공구 선정 시스템 개발)

  • 양학진;김성근;허영무;양진석
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1997.10a
    • /
    • pp.175-179
    • /
    • 1997
  • As consumer's desire becomes various, agility of mold manufacturing is most important factor for competence of manufacturer. In common works to use commercial CAM system to generate tool path, some decision making process is required to produce optimal result of CAM systems. We propose tool selection procedures to aid the decision making process. The system provides available tool size for machining of design model part of injection mold die by analyzing sliced CAD model of die cavity and core. Also, the tool size information is used to calculate machining time. The system is developed with commercial CAM using API. This module will be used for optimization of tool selection and planning process.

  • PDF

Two dimensional reduction technique of Support Vector Machines for Bankruptcy Prediction

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae;Lee, Ki-Chun
    • 한국경영정보학회:학술대회논문집
    • /
    • 2007.06a
    • /
    • pp.608-613
    • /
    • 2007
  • Prediction of corporate bankruptcies has long been an important topic and has been studied extensively in the finance and management literature because it is an essential basis for the risk management of financial institutions. Recently, support vector machines (SVMs) are becoming popular as a tool for bankruptcy prediction because they use a risk function consisting of the empirical error and a regularized term which is derived from the structural risk minimization principle. In addition, they don't require huge training samples and have little possibility of overfitting. However. in order to Use SVM, a user should determine several factors such as the parameters ofa kernel function, appropriate feature subset, and proper instance subset by heuristics, which hinders accurate prediction results when using SVM In this study, we propose a novel hybrid SVM classifier with simultaneous optimization of feature subsets, instance subsets, and kernel parameters. This study introduces genetic algorithms (GAs) to optimize the feature selection, instance selection, and kernel parameters simultaneously. Our study applies the proposed model to the real-world case for bankruptcy prediction. Experimental results show that the prediction accuracy of conventional SVM may be improved significantly by using our model.

  • PDF

Feature Selection Applied to Recommender Systems for Reverse Logistics Internet Auction (역 물류 환경 인터넷 경매를 위한 요소 선택응용 추천 시스템)

  • Yang, Jae-Kyung;Yu, Woo-Yeon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.1
    • /
    • pp.76-86
    • /
    • 2006
  • 다양한 데이터 마이닝 기법들의 발전과 더불어, 속성(Feature 또는 Attribute)의 범위(Dimension)를 줄이기 위해 많은 요소 선택 방법이 개발되었다. 이는 확장성(Scalability)을 향상시킬 수 있고 학습 모델(Learning Model)을 더욱 쉽게 해석할 수 있도록 한다. 이 논문에서는 네스티드 분할(Nested Partition, 이하 NP)을 이용한 새로운 최적화 기반 속성 선택 방법을 NP 기본 구조와 다양한 실험 문제의 수치적 결과들과 함께 제시하여 어떻게 NP의 최적화 구조가 속성 선택 과정에 기여를 하고 있는지 보여준다. 그리고 이 새로운 지능적인 분할 방법이 어떻게 매우 효율적인 분할을 수행하는지를 제시한다. 이 새로운 속성 선택 방법은 필터(Filter)방법과 래퍼(Wrapper)방법 두 가지로 구현될 수 있다. 사례 연구로서, B2B e-비즈니스 시스템에서 효과적으로 사용될 수 있는 추천 시스템(Recommender System)을 제안하였다. 이 추천 시스템은 분류 기법(Classification Rule)과 제시된 NP 기반 요소 선택 방법을 사용하고 있다. 이 추천 시스템은 사용자의 인터넷 경매 참여를 추천하는데 사용되며, 이 때 제안된 요소 선택 앨고리듬은 추천 규칙들이 쉽게 이해될 수 있도록 모델을 간략화 하는데 사용된다.

Cyber Threat Intelligence Traffic Through Black Widow Optimisation by Applying RNN-BiLSTM Recognition Model

  • Kanti Singh Sangher;Archana Singh;Hari Mohan Pandey
    • International Journal of Computer Science & Network Security
    • /
    • v.23 no.11
    • /
    • pp.99-109
    • /
    • 2023
  • The darknet is frequently referred to as the hub of illicit online activity. In order to keep track of real-time applications and activities taking place on Darknet, traffic on that network must be analysed. It is without a doubt important to recognise network traffic tied to an unused Internet address in order to spot and investigate malicious online activity. Any observed network traffic is the result of mis-configuration from faked source addresses and another methods that monitor the unused space address because there are no genuine devices or hosts in an unused address block. Digital systems can now detect and identify darknet activity on their own thanks to recent advances in artificial intelligence. In this paper, offer a generalised method for deep learning-based detection and classification of darknet traffic. Furthermore, analyse a cutting-edge complicated dataset that contains a lot of information about darknet traffic. Next, examine various feature selection strategies to choose a best attribute for detecting and classifying darknet traffic. For the purpose of identifying threats using network properties acquired from darknet traffic, devised a hybrid deep learning (DL) approach that combines Recurrent Neural Network (RNN) and Bidirectional LSTM (BiLSTM). This probing technique can tell malicious traffic from legitimate traffic. The results show that the suggested strategy works better than the existing ways by producing the highest level of accuracy for categorising darknet traffic using the Black widow optimization algorithm as a feature selection approach and RNN-BiLSTM as a recognition model.

Using GAs to Support Feature Weighting and Instance Selection in CBR for CRM

  • Ahn, Hyun-Chul;Kim, Kyoung-Jae;Han, In-Goo
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2005.11a
    • /
    • pp.516-525
    • /
    • 2005
  • Case-based reasoning (CBR) has been widely used in various areas due to its convenience and strength in complex problem solving. Generally, in order to obtain successful results from CBR, effective retrieval of useful prior cases for the given problem is essential. However, designing a good matching and retrieval mechanism for CBR systems is still a controversial research issue. Most prior studies have tried to optimize the weights of the features or selection process of appropriate instances. But, these approaches have been performed independently until now. Simultaneous optimization of these components may lead to better performance than in naive models. In particular, there have been few attempts to simultaneously optimize the weight of the features and selection of the instances for CBR. Here we suggest a simultaneous optimization model of these components using a genetic algorithm (GA). We apply it to a customer classification model which utilizes demographic characteristics of customers as inputs to predict their buying behavior for a specific product. Experimental results show that simultaneously optimized CBR may improve the classification accuracy and outperform various optimized models of CBR as well as other classification models including logistic regression, multiple discriminant analysis, artificial neural networks and support vector machines.

  • PDF

On-demand Allocation of Multiple Mutual-compensating Resources in Wireless Downlinks: a Multi-server Case

  • Han, Han;Xu, Yuhua;Huang, Qinfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.921-940
    • /
    • 2015
  • In this paper, we investigate the multi-resource allocation problem, a unique feature of which is that the multiple resources can compensate each other while achieving the desired system performance. In particular, power and time allocations are jointly optimized with the target of energy efficiency under the resource-limited constraints. Different from previous studies on the power-time tradeoff, we consider a multi-server case where the concurrent serving users are quantitatively restricted. Therefore user selection is investigated accompanying the resource allocation, making the power-time tradeoff occur not only between the users in the same server but also in different servers. The complex multivariate optimization problem can be modeled as a variant of 2-Dimension Bin Packing Problem (V2D-BPP), which is a joint non-linear and integer programming problem. Though we use state decomposition model to transform it into a convex optimization problem, the variables are still coupled. Therefore, we propose an Iterative Dual Optimization (IDO) algorithm to obtain its optimal solution. Simulations show that the joint multi-resource allocation algorithm outperforms two existing non-joint algorithms from the perspective of energy efficiency.