Object Classification Method Using Dynamic Random Forests and Genetic Optimization
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김재협 | - |
dc.contributor.author | 김헌기 | - |
dc.contributor.author | 장경현 | - |
dc.contributor.author | 이종민 | - |
dc.contributor.author | 문영식 | - |
dc.date.accessioned | 2021-06-22T18:01:57Z | - |
dc.date.available | 2021-06-22T18:01:57Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2016-05 | - |
dc.identifier.issn | 1598-849X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/15498 | - |
dc.description.abstract | In this paper, we proposed the object classification method using genetic and dynamic random forest consisting of optimal combination of unit tree. The random forest can ensure good generalization performance in combination of large amount of trees by assigning the randomization to the training samples and feature selection, etc. allocated to the decision tree as an ensemble classification model which combines with the unit decision tree based on the bagging. However, the random forest is composed of unit trees randomly, so it can show the excellent classification performance only when the sufficient amounts of trees are combined. There is no quantitative measurement method for the number of trees, and there is no choice but to repeat random tree structure continuously. The proposed algorithm is composed of random forest with a combination of optimal tree while maintaining the generalization performance of random forest. To achieve this, the problem of improving the classification performance was assigned to the optimization problem which found the optimal tree combination. For this end, the genetic algorithm methodology was applied. As a result of experiment, we had found out that the proposed algorithm could improve about 3~5% of classification performance in specific cases like common database and self infrared database compare with the existing random forest. In addition, we had shown that the optimal tree combination was decided at 55~60% level from the maximum trees. | - |
dc.language | 한국어 | - |
dc.language.iso | ko | - |
dc.publisher | 한국컴퓨터정보학회 | - |
dc.title | Object Classification Method Using Dynamic Random Forests and Genetic Optimization | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 문영식 | - |
dc.identifier.doi | 10.9708/jksci.2016.21.5.079 | - |
dc.identifier.bibliographicCitation | 한국컴퓨터정보학회논문지, v.21, no.5, pp.79 - 89 | - |
dc.relation.isPartOf | 한국컴퓨터정보학회논문지 | - |
dc.citation.title | 한국컴퓨터정보학회논문지 | - |
dc.citation.volume | 21 | - |
dc.citation.number | 5 | - |
dc.citation.startPage | 79 | - |
dc.citation.endPage | 89 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART002109885 | - |
dc.description.journalClass | 2 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Object Classification | - |
dc.subject.keywordAuthor | Random Forest | - |
dc.subject.keywordAuthor | Genetic Algorithm | - |
dc.subject.keywordAuthor | Classifier Ensemble | - |
dc.identifier.url | https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE06683807 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.