RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재후보

      Dropout Genetic Algorithm Analysis for Deep Learning Generalization Error Minimization

      한글로보기

      https://www.riss.kr/link?id=A105057064

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA(Dropout Genetic Algorithm) which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.
      번역하기

      Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a ...

      Recently, there are many companies that use systems based on artificial intelligence. The accuracy of artificial intelligence depends on the amount of learning data and the appropriate algorithm. However, it is not easy to obtain learning data with a large number of entity. Less data set have large generalization errors due to overfitting. In order to minimize this generalization error, this study proposed DGA(Dropout Genetic Algorithm) which can expect relatively high accuracy even though data with a less data set is applied to machine learning based genetic algorithm to deep learning based dropout. The idea of this paper is to determine the active state of the nodes. Using Gradient about loss function, A new fitness function is defined. Proposed Algorithm DGA is supplementing stochastic inconsistency about Dropout. Also DGA solved problem by the complexity of the fitness function and expression range of the model about Genetic Algorithm As a result of experiments using MNIST data proposed algorithm accuracy is 75.3%. Using only Dropout algorithm accuracy is 41.4%. It is shown that DGA is better than using only dropout.

      더보기

      참고문헌 (Reference)

      1 "http://yann.lecun.com/exdb/mnist/"

      2 Lipowski, A., "Roulette-wheel selection via stochastic acceptance" 391 (391): 2193-2196, 2012

      3 Marsland, S., "Machine learning: an algorithmic perspective" CRC press 2015

      4 Forrest, S., "Genetic algorithms- Principles of natural selection applied to computation" 261 (261): 872-878, 1993

      5 D.E. Goldberg, "Genetic Algorithms in search, optimization, and machine learning" Addison-Wesley 1999

      6 Kim, Y, J., "Future society change that artificial intelligence technology development will bring" 12 : 52-65, 2016

      7 Srivastava, N., "Dropout : a simple way to prevent neural networks from overfitting" 15 (15): 1929-1958, 2014

      8 Park, J. S., "Designing Neural Network Using Genetic Algorithm" 4 (4): 2309-2314, 1997

      9 Umbarkar, A, J., "Crossover Operators in Genetic Algorithms : a revice" 6 (6): 1083-1092, 2015

      10 Mitchell, M., "An introduction to genetic algorithms" MIT press 1998

      1 "http://yann.lecun.com/exdb/mnist/"

      2 Lipowski, A., "Roulette-wheel selection via stochastic acceptance" 391 (391): 2193-2196, 2012

      3 Marsland, S., "Machine learning: an algorithmic perspective" CRC press 2015

      4 Forrest, S., "Genetic algorithms- Principles of natural selection applied to computation" 261 (261): 872-878, 1993

      5 D.E. Goldberg, "Genetic Algorithms in search, optimization, and machine learning" Addison-Wesley 1999

      6 Kim, Y, J., "Future society change that artificial intelligence technology development will bring" 12 : 52-65, 2016

      7 Srivastava, N., "Dropout : a simple way to prevent neural networks from overfitting" 15 (15): 1929-1958, 2014

      8 Park, J. S., "Designing Neural Network Using Genetic Algorithm" 4 (4): 2309-2314, 1997

      9 Umbarkar, A, J., "Crossover Operators in Genetic Algorithms : a revice" 6 (6): 1083-1092, 2015

      10 Mitchell, M., "An introduction to genetic algorithms" MIT press 1998

      11 Holland, J. H., "Adaptation in natural and artificial systems : an introductory analysis with applications to biology, control, and artificial intelligence" MIT press 1992

      12 Whitley, D., "A genetic algorithm tutorial" 4 (4): 65-85, 1994

      13 Elyan, E., "A genetic algorithm approach to optimising random forests applied to class engineered data" 384 : 220-234, 2017

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2027 평가예정 재인증평가 신청대상 (재인증)
      2021-01-01 평가 등재학술지 유지 (재인증) KCI등재
      2018-01-01 평가 등재학술지 선정 (계속평가) KCI등재
      2016-08-19 학술지명변경 한글명 : The International Journal of Advanced Culture Technology -> The International Journal of Advanced Culture Technology KCI등재후보
      2016-01-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0 0 0
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0 0 0 0
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼