• Title/Summary/Keyword: Algorithm Selection

Search Result 2,496, Processing Time 0.026 seconds

A Genetic Algorithm A, pp.oach for Process Plan Selection on the CAPP (CAPP에서 공정계획 선정을 위한 유전 알고리즘 접근)

  • 문치웅;김형수;이상준
    • Journal of Intelligence and Information Systems
    • /
    • v.4 no.1
    • /
    • pp.1-10
    • /
    • 1998
  • Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

  • PDF

Cooperative transmission protocol in the relay network (릴레이 네트워크에서의 협업전송 프로토콜)

  • Xiang, Gao;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1046-1048
    • /
    • 2009
  • Cooperative transmission is an effective technique to combat multi-path fading and reduce transmitted power. Relay selection and power allocation are important technical issues to determine the performance of cooperative transmission. In this paper, we proposed a new multi-relay selection and power allocation algorithm to increase network lifetime. The proposed relay selection scheme minimizes the transmitted power and increase the network lifetime by considering residual power as well as channel conditions. Simulation results show that proposed algorithm obtains much longer network lifetime than the conventional algorithm.

  • PDF

Pair-nodes Selection Algorithm for PBS (Pairwise Broadcast Synchronization) (PBS(Pairwise Broadcast Synchronization)를 위한 노드 쌍 선택 알고리즘)

  • Bae, Shi-Kyu
    • Journal of Korea Multimedia Society
    • /
    • v.21 no.11
    • /
    • pp.1288-1296
    • /
    • 2018
  • PBS(Pairwise Broadcast Synchronization) is a well-known synchronization scheme for WSN(Wireless Sensor Networks). As PBS needs the set of node-pairs for network-wide synchronization by over-hearing, GPA(Group-Wise Pair Selection Algorithm) was also proposed after PBS. However, GPA is complex and requires too many message transmissions, leading to much power consumption. Besides, GPA is not appropriate to topology change or mobile wireless sensor networks. So, we propose a new and energy-efficient pair-node selection algorithm for PBS. The proposed scheme's performance has been evaluated and compared with GPA by simulation. The results are shown to be better than GPA.

A study of creative human judgment through the application of machine learning algorithms and feature selection algorithms

  • Kim, Yong Jun;Park, Jung Min
    • International journal of advanced smart convergence
    • /
    • v.11 no.2
    • /
    • pp.38-43
    • /
    • 2022
  • In this study, there are many difficulties in defining and judging creative people because there is no systematic analysis method using accurate standards or numerical values. Analyze and judge whether In the previous study, A study on the application of rule success cases through machine learning algorithm extraction, a case study was conducted to help verify or confirm the psychological personality test and aptitude test. We proposed a solution to a research problem in psychology using machine learning algorithms, Data Mining's Cross Industry Standard Process for Data Mining, and CRISP-DM, which were used in previous studies. After that, this study proposes a solution that helps to judge creative people by applying the feature selection algorithm. In this study, the accuracy was found by using seven feature selection algorithms, and by selecting the feature group classified by the feature selection algorithms, and the result of deriving the classification result with the highest feature obtained through the support vector machine algorithm was obtained.

A Study on Selection of Split Variable in Constructing Classification Tree (의사결정나무에서 분리 변수 선택에 관한 연구)

  • 정성석;김순영;임한필
    • The Korean Journal of Applied Statistics
    • /
    • v.17 no.2
    • /
    • pp.347-357
    • /
    • 2004
  • It is very important to select a split variable in constructing the classification tree. The efficiency of a classification tree algorithm can be evaluated by the variable selection bias and the variable selection power. The C4.5 has largely biased variable selection due to the influence of many distinct values in variable selection and the QUEST has low variable selection power when a continuous predictor variable doesn't deviate from normal distribution. In this thesis, we propose the SRT algorithm which overcomes the drawback of the C4.5 and the QUEST. Simulations were performed to compare the SRT with the C4.5 and the QUEST. As a result, the SRT is characterized with low biased variable selection and robust variable selection power.

A Hybrid Method for Improvement of Evolutionary Computation (진화 연산의 성능 개선을 위한 하이브리드 방법)

  • Chung, Jin-Ki;Oh, Se-Young
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.317-322
    • /
    • 2002
  • The major operations of Evolutionary Computation include crossover, mutation, competition and selection. Although selection does not create new individuals like crossover or mutation, a poor selection mechanism may lead to problems such as taking a long time to reach an optimal solution or even not finding it at all. In view of this, this paper proposes a hybrid Evolutionary Programming (EP) algorithm that exhibits a strong capability to move toward the global optimum even when stuck at a local minimum using a synergistic combination of the following three basic ideas. First, a "local selection" technique is used in conjunction with the normal tournament selection to help escape from a local minimum. Second, the mutation step has been improved with respect to the Fast Evolutionary Programming technique previously developed in our research group. Finally, the crossover and mutation operations of the Genetic Algorithm have been added as a parallel independent branch of the search operation of an EP to enhance search diversity.

A Low-Complexity Antenna Selection Algorithm for Quadrature Spatial Modulation Systems

  • Kim, Sangchoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.9 no.1
    • /
    • pp.72-80
    • /
    • 2017
  • In this work, an efficient transmit antenna selection approach for the quadrature spatial modulation (QSM) systems is proposed. The conventional Euclidean distance antenna selection (EDAS)-based schemes in QSM have too high computational complexity for practical use. The proposed antenna selection algorithm is based on approximation of the EDAS decision metric employed for QSM. The elimination of imaginary parts in the decision metric enables decoupling of the approximated decision metric, which enormously reduces the complexity. The proposed method is also evaluated via simulations in terms of symbol error rate (SER) performance and compared with the conventional EDAS methods in QSM systems.

Informative Gene Selection Method in Tumor Classification

  • Lee, Hyosoo;Park, Jong Hoon
    • Genomics & Informatics
    • /
    • v.2 no.1
    • /
    • pp.19-29
    • /
    • 2004
  • Gene expression profiles may offer more information than morphology and provide an alternative to morphology- based tumor classification systems. Informative gene selection is finding gene subsets that are able to discriminate between tumor types, and may have clear biological interpretation. Gene selection is a fundamental issue in gene expression based tumor classification. In this report, techniques for selecting informative genes are illustrated and supervised shaving introduced as a gene selection method in the place of a clustering algorithm. The supervised shaving method showed good performance in gene selection and classification, even though it is a clustering algorithm. Almost selected genes are related to leukemia disease. The expression profiles of 3051 genes were analyzed in 27 acute lymphoblastic leukemia and 11 myeloid leukemia samples. Through these examples, the supervised shaving method has been shown to produce biologically significant genes of more than $94\%$ accuracy of classification. In this report, SVM has also been shown to be a practicable method for gene expression-based classification.

Formwork System Selection Model for Tall Building Construction Using the Adaboost Algorithm

  • Shin, Yoon-Seok
    • Journal of the Korea Institute of Building Construction
    • /
    • v.11 no.5
    • /
    • pp.523-529
    • /
    • 2011
  • In a tall building construction with reinforced concrete structures, the selection of an appropriate formwork system is a crucial factor for the success of the project. Thus, selecting an appropriate formwork system affects the entire construction duration and cost, as well as subsequent construction activities. However, in practice, the selection of an appropriate formwork system has depended mainly on the intuitive and subjective opinion of working level employees with restricted experience. Therefore, in this study, a formwork system selection model using the Adaboost algorithm is proposed to support the selection of a formwork system that is suitable for the construction site conditions. To validate the applicability of the proposed model, the selection models Adaboost and ANN were both applied to actual case data of tall building construction in Korea. The Adaboost model showed slightly better accuracy than that of the ANN model. The Adaboost model can assist engineers to determine the appropriate formwork system at the inception of future projects.

Ensemble Based Optimal Feature Selection Algorithm for Efficient Intrusion Detection in Wireless Sensor Network

  • Shyam Sundar S;R.S. Bhuvaneswaran;SaiRamesh L
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.8
    • /
    • pp.2214-2229
    • /
    • 2024
  • Wireless sensor network (WSN) consists of large number of sensor nodes that are deployed in geographical locations to collect sensed information, process data and communicate it to the control station for further processing. Due the unfriendly environment where the sensors are deployed, there exist many possibilities of malicious nodes which performs malicious activities in the network. Therefore, the security threats affect performance and life time of sensor networks, whereas various security aspects are there to address security issues in WSN namely Cryptography, Trust Management, Intrusion Detection System (IDS) and Intrusion Prevention Systems (IPS). However, IDS detect the malicious activities and produce an alarm. These malicious activities exploit vulnerabilities in the network layer and affect all layers in the network. Existing feature selection methods such as filter-based methods are not considering the redundancy of the selected features and wrapper method has high risk of overfitting the classification of intrusion. Due to overfitting, the classification algorithm fails to detect the intrusion in better manner. The main objective of this paper is to provide the efficient feature selection algorithm which was suitable for any type classification algorithm to detect the intrusion in an effective manner. This paper, the security of the network is addressed by proposing Feature Selection Algorithm using Chi Squared with Ensemble Method (FSChE). The proposed scheme employs the combination of decision tree along with the random forest classification algorithm to form ensemble classifier. The experimental results justify the feasibility of the proposed scheme in terms of attack detection, packet delivery ratio and time analysis by employing NSL KDD cup data Set. The obtained results shows that the proposed ensemble method increases the overall performance by 10% to 25% with respect to mentioned parameters.