• Title/Summary/Keyword: grid-search

Search Result 274, Processing Time 0.025 seconds

Hyperparameter Optimization for Image Classification in Convolutional Neural Network (합성곱 신경망에서 이미지 분류를 위한 하이퍼파라미터 최적화)

  • Lee, Jae-Eun;Kim, Young-Bong;Kim, Jong-Nam
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.21 no.3
    • /
    • pp.148-153
    • /
    • 2020
  • In order to obtain high accuracy with an convolutional neural network(CNN), it is necessary to set the optimal hyperparameters. However, the exact value of the hyperparameter that can make high performance is not known, and the optimal hyperparameter value is different based on the type of the dataset, therefore, it is necessary to find it through various experiments. In addition, since the range of hyperparameter values is wide and the number of combinations is large, it is necessary to find the optimal values of the hyperparameters after the experimental design in order to save time and computational costs. In this paper, we suggest an algorithm that use the design of experiments and grid search algorithm to determine the optimal hyperparameters for a classification problem. This algorithm determines the optima values of the hyperparameters that yields high performance using the factorial design of experiments. It is shown that the amount of computational time can be efficiently reduced and the accuracy can be improved by performing a grid search after reducing the search range of each hyperparameter through the experimental design. Moreover, Based on the experimental results, it was shown that the learning rate is the only hyperparameter that has the greatest effect on the performance of the model.

A Study on Optimal Operation Method of Multiple Microgrid System Considering Line Flow Limits (선로제약을 고려한 복수개의 마이크로그리드 최적운영 기법에 관한 연구)

  • Park, Si-Na;An, Jeong-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.258-264
    • /
    • 2018
  • This paper presents application of a differential search (DS) meta-heuristic optimization algorithm for optimal operation of a micro grid system. The DS algorithm simulates the Brownian-like random-walk movement used by an organism to migrate. The micro grid system consists of a wind turbine, a diesel generator, a fuel cell, and a photovoltaic system. The wind turbine generator is modeled by considering the characteristics of variable output. Optimization is aimed at minimizing the cost function of the system, including fuel costs and maximizing fuel efficiency to generate electric power. The simulation was applied to a micro grid system only. This study applies the DS algorithm with excellence and efficiency in terms of coding simplicity, fast convergence speed, and accuracy in the optimal operation of micro grids based on renewable energy resources, and we compared its optimum value to other algorithms to prove its superiority.

A Path-Finding Algorithm on an Abstract Graph for Extracting Estimated Search Space (탐색 영역 추출을 위한 추상 그래프 탐색 알고리즘 설계)

  • Kim, Ji-Soo;Lee, Ji-Wan;Moon, Dae-Jin;Cho, Dae-Soo
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2008.10a
    • /
    • pp.147-150
    • /
    • 2008
  • The real road network is regarded as a grid, and the grid is divided by fixed-sized cells. The path-finding is composed of two step searching. First searching travels on the abstract graph which is composed of a set of psuedo vertexes and a set of psuedo edges that are created by real road network and fixed-sized cells. The result of the first searching is a psuedo path which is composed of a set of selected psuedo edges. The cells intersected with the psuedo path are called as valid cells. The second searching travels with $A^*$ algorithm on valid cells. As pruning search space by removing the invalid cells, it would be possible to reduce the cost of exploring on real road network. In this paper, we present the method of creating the abstract graph and propose a path-finding algorithm on the abstract graph for extracting search space before traveling on real road network.

  • PDF

A Study on Web Services for Sequence Similarity search in the Workflow Environment (워크플로우 환경에서의 대규모 서열 유사성 검색 웹 서비스에 관한 연구)

  • Jun, Jin-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.41-49
    • /
    • 2008
  • In recent years, a life phenomenon using a workflow management tool in bioinformatics has been actively researched. Workflow management tool is the base which enables researchers to collaborate through the re-use and sharing of service, and a variety of workflow management tools including MyGrid project's Taverna, Kepler and BioWMS have been developed and used as the open source. This workflow management tool can model and automate different services in spatially-distant area in one working space based on the web service technology. Many tools and databases used in the bioinformatics are provided in the web services form and are used in the workflow management tool. In such the situation, the web services development and stable service offering for a sequence similarity search which is basically used in the bioinformatics can be essential in the bioinformatics field. In this paper, the similarity retrieval speed of biology sequence data was improved based on a Linux cluster, and the sequence similarity retrieval could be done for a short time by linking with the workflow management tool through developing it in the web services.

  • PDF

Waveform inversion of shallow seismic refraction data using hybrid heuristic search method (하이브리드 발견적 탐색기법을 이용한 천부 굴절법 자료의 파형역산)

  • Takekoshi, Mika;Yamanaka, Hiroaki
    • Geophysics and Geophysical Exploration
    • /
    • v.12 no.1
    • /
    • pp.99-104
    • /
    • 2009
  • We propose a waveform inversion method for SH-wave data obtained in a shallow seismic refraction survey, to determine a 2D inhomogeneous S-wave profile of shallow soils. In this method, a 2.5D equation is used to simulate SH-wave propagation in 2D media. The equation is solved with the staggered grid finite-difference approximation to the 4th-order in space and 2nd-order in time, to compute a synthetic wave. The misfit, defined using differences between calculated and observed waveforms, is minimised with a hybrid heuristic search method. We parameterise a 2D subsurface structural model with blocks with different depth boundaries, and S-wave velocities in each block. Numerical experiments were conducted using synthetic SH-wave data with white noise for a model having a blind layer and irregular interfaces. We could reconstruct a structure including a blind layer with reasonable computation time from surface seismic refraction data.

Verification of Airborne Radar's Search Pattern Stabilization Capability Using SIL Environment (시스템 통합 시험 환경을 이용한 항공기 탑재 레이다의 탐색 패턴 안정화 기능 검증)

  • Ji-Eun Roh;Yong-Kil Kwak;Jin-Ju Won;Won-Jin Lee
    • Journal of Advanced Navigation Technology
    • /
    • v.28 no.2
    • /
    • pp.178-184
    • /
    • 2024
  • The radar installed on an aircraft has various operating modes depending on tactical purposes, allowing for the configuration of search areas according to each mode's operational objectives. active electronically scanned array (AESA) radar emits search beams sequentially according to a predefined search beam grid within the designated search area specified by the pilot to detect targets within it. It is crucial that the radar can stably search the area designated by the pilot for target detection, even as the aircraft's attitude changes. This paper focuses on stabilizing the search pattern in the air-to-air operational mode of aircraft-mounted radar to ensure stable target detection during roll and pitch maneuvers of the aircraft. The paper demonstrates its performance by simulating aircraft maneuvers and targets in a system integration laboratory (SIL) test environment.

Advanced Procedure and Computing System for Standardization of IEC Terminologies (선진화된 IEC 기술용어 표준화 구축절차 및 전산시스템)

  • Hwang, Humor;Kim, Jung-Hoon;Moon, Bong-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.3
    • /
    • pp.388-396
    • /
    • 2016
  • Through the correspondence works with international electrotechnical vocabulary(IEV) in the smart grid field and power information technology field, we analyzed cases for discussion of terms and definitions in the IEV and then proposed an advanced procedure and computing system for standardization of International Electronical Committee(IEC) terminologies. The standardization procedure consists of processes for existing terminology, new terminology and correspondent terminology which have different structures. An example of the standardization work of correspondent terminology is given. The standardization computing system are based on the process for terminology extraction, terminology verification and terminology management which could provide the Wikipedia type terminology search function. In order to prevent that there exist multiple terminologies in IEV, the database search system is needed to be developed. We proposed the 'IEV_Term_Search' program which is the database search system. Terminology standardization of different technical committees(TC) and completion of the IEV to promote cooperation between TC 1 and the TCs must be followed by revision and standardization using the standardization computing system.

Optimal Path Search using Variable Heuristic (가변적 휴리스틱을 적용한 최적경로탐색)

  • Lee, Hyoun-Sup;Ahn, Jun-Hwan;Kim, Jin-Doeg
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.206-209
    • /
    • 2005
  • Optimal path search systems to take continuously changed traffic flows into consideration is necessary in order to reduce the cost to get destination. However, to search optimal path in client terminals with low computing power yields high computational cost. Thus, a method with low cost and near optimal path as well is required. In this paper, we propose a path search method using variable heuristic for the sake of reducing operation time. The heuristic is determined by the change of the average speeds of cars located in grid which means a rectangle region.

  • PDF

An Effective Early Termination Motion Estimation Method for Multi-view Video Coding (다시점 비디오 부호화를 위한 효과적인 초기 종료 움직임 추정 기법)

  • Yoon, Hyo-Sun;Kim, Mi-Young
    • Journal of Korea Multimedia Society
    • /
    • v.17 no.3
    • /
    • pp.333-341
    • /
    • 2014
  • Multi-view video is obtained by capturing one three-dimensional scene with many cameras at different positions. Multi-view video coding requires high computational complexity. To reduce computational complexity and maintain the image quality, an effective early termination motion estimation method is proposed in this paper. The proposed method exploiting the characteristic of motion vector distribution uses a hierarchical search strategy. This strategy method consists of multi-grid square search pattern, modified diamond search pattern, small diamond search pattern and raster search pattern. Experiment results show that the speedup improvement of the proposed method over TZ search method and FS(Full Search) method JMVC (Joint Multiview Video Coding) can be up to 1.7~4.5 times and 90 times faster respectively while maintaining similar video quality and bit rates.

Customizable Global Job Scheduler for Computational Grid (계산 그리드를 위한 커스터마이즈 가능한 글로벌 작업 스케줄러)

  • Hwang Sun-Tae;Heo Dae-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.7
    • /
    • pp.370-379
    • /
    • 2006
  • Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.