2 research outputs found
κ³ μ λ’°μ± μ λλ¬΄κΈ°μ© λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ° μ΅μ μ€κ³
νμλ
Όλ¬Έ (λ°μ¬)-- μμΈλνκ΅ λνμ : μ κΈ°Β·μ»΄ν¨ν°κ³΅νλΆ, 2016. 8. μ νκ΅.μ λ무기 λ° λ¬΄μΈ ν곡기μ κ°μ κ΅λ°© λ° ν곡 λΆμΌ ꡬλμ₯μΉλ‘λ μ λκΈ°λ₯Ό μ΄μ©ν μ κΈ°μ ꡬλμ₯μΉκ° λ리 μ¬μ©λκ³ μμΌλ©°, μ΄λ¬ν μ κΈ°μ ꡬλμ₯μΉλ₯Ό μ μ΄νκΈ° μν΄μλ νμ μλ μΌμκ° νμμ μΌλ‘ μꡬλλ€. νμ¬ κ΅λ΄μΈμμ κ°λ° μλ£ λμκ±°λ, κ°λ° μ§ν μ€μΈ μ λλ¬΄κΈ°μ© μ κΈ°μ ꡬλμ₯μΉμ μ¬μ©λλ νμ μλ μΌμλ‘λ μ§λ₯ μꡬμμ μλκ²μΆκΈ°(DC Tachogenerator)κ° κ°μ₯ λ§μ΄ μ¬μ©λκ³ μλ€. μ§λ₯ μꡬμμ μλκ²μΆκΈ°λ μ§λ₯ λ°μ κΈ° μ리λ₯Ό μ΄μ©νλ κ°λ¨ν ꡬ쑰λ₯Ό κ°μ§λ―λ‘ μνμΌλ‘ ꡬνμ΄ κ°λ₯νλ©°, μ¬κΈ°μ μμ΄ λΆνμνκ³ , μλμ λΉλ‘νλ μ μ μΆλ ₯μ λΉ λ₯΄κ³ μμ½κ² μ»μ μ μλ μ₯μ μ΄ μλ€. νμ§λ§ μ§λ₯ μꡬμμ μλκ²μΆκΈ°λ κΈ°κ³μ μΌλ‘ λΈλ¬μ¬λ₯Ό ν΅νμ¬ μ μ΄νλ ꡬ쑰λ₯Ό κ°μ§κ³ μκΈ° λλ¬Έμ, μ§λ λ° μΆ©κ²© λ±μ΄ μ§μμ μΌλ‘ μΈκ°λλ κ°νΉν κ΅°μ¬νκ²½ 쑰건μ λν λ΄νκ²½μ± μΈ‘λ©΄μμ λΆλ¦¬νκ³ , κ³ μ νμ νλ μ λκΈ°μ μ¬μ©νκΈ° νλ€λ©°, λΈλ¬μ¬μ κΈ°κ³μ λ§λͺ¨μ μν μ¬μ©μκ° μ ν λ° μ μν κ°μμ μν μ νΈ μ‘μ λ°μ λ±μ λ¬Έμ μ μ κ°μ§κ² λλ€.
λ°λΌμ, λ³Έ λ
Όλ¬Έμμλ μ§λ₯ μꡬμμ μλκ²μΆκΈ°μ μ°μν μ₯μ λ€μ μ μ§νλ©΄μλ λΈλ¬μ¬μ μ¬μ©μΌλ‘ μΈν λ¨μ λ€μ 극볡ν¨μΌλ‘μ¨, μ λ무기μμ μꡬνλ λμ μμ μ±κ³Ό μ λ’°μ±μ κ°μ§ μ μλ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°(Brushless Tachogenerator)λ₯Ό μ μνκ³ , μ΄μ μ΅μ μ€κ³μμ μ μνλ€. μ μλ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°λ κ΅λ₯ λ°μ κΈ° μ리λ₯Ό μ΄μ©νκΈ° λλ¬Έμ κ΅λ΄μ μ λκΈ° λ° λ°μ κΈ° μ μ‘°μμ€ κΈ°λ°μ νμ©νμ¬ μ μμ΄ κ°λ₯νλ€. λ°λΌμ, κ΅°μ¬μ© λͺ©μ μ¬μ©μ λ°λ₯Έ ν΄μΈ λμ
νμ μμΆ κ·μ μ κ΄κ³μμ΄ κ΅λ΄μμ λ
μ κ°λ°μ΄ κ°λ₯ν μ₯μ μ κ°μ§λ€.
λ³Έ λ
Όλ¬Έμμλ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°μ νμ μλ λ° νμ λ°©ν₯ ꡬν κΈ°λ²μ μλ‘κ² μ μνκ³ , λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ° μ΄μ© μ€μ λ¨μ μ μν΄ 3κ°μ μμκΈ°μ μ μ€ 1κ°κ° κ²μΆμ΄ λΆκ°λ₯νλλΌλ μΌμ μ체μ μΌλ‘ μ΄λ₯Ό 극볡νλ λ΄κ³ μ₯μ± ν보 λ°©λ²μ λνμ¬ μ μν¨μΌλ‘μ¨ μλκ²μΆκΈ°μ μ λ’°μ± λ° μμ μ±μ ν₯μμμΌ°λ€.
λν, λ³Έ λ
Όλ¬Έμμλ 볡μ‘ν λͺ©μ ν¨μλ₯Ό κ°μ§λ©° μ€λ κ³μ°μκ°μ΄ μμλλ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°μ κ°μ μ κΈ°κΈ°κΈ° μ΅μ μ€κ³ λ¬Έμ λ₯Ό ν¨κ³Όμ μΌλ‘ ν΄κ²°ν μ μλ μλ‘μ΄ λ리λͺ¨λΈ κΈ°λ° λ©ν°λͺ¨λ¬ μ΅μ ν μκ³ λ¦¬μ¦μ μ μνκ³ , μ΄λ₯Ό λ°νμΌλ‘ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°μ λν μ΅μ μ€κ³λ₯Ό μννμμΌλ©°, μ€μ μμ νμ μ μνκ³ μ΄μ λνμ¬ λ€μν μνμ μνν¨μΌλ‘μ¨ μ μλ μ€κ³κΈ°λ² λ° μμ νμ μ±λ₯μ μ
μ¦νμλ€.
λ§μ§λ§μΌλ‘ μ μλ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°λ₯Ό μ΄μ©νμ¬ μ λν λ κ° κ΅¬λμ₯μΉμ λ°μν 곡기μνμ 곡νμ± μ§λμ ν¨κ³Όμ μΌλ‘ μ΅μ ν μ μλ μλ‘μ΄ μ μ΄ κΈ°λ²μ μ μνκ³ , μ΄μ λν κ²μ¦μνμ μνν¨μΌλ‘μ¨, μ μλ κΈ°λ²μ μ°μν μ±λ₯μ νμΈνμλ€.μ 1 μ₯ μλ‘ 1
1.1 μ°κ΅¬λ°°κ²½ λ° λͺ©μ 1
1.2 λ
Όλ¬Έ κ΅¬μ± 4
μ 2 μ₯ μꡬμμ μλκ²μΆκΈ° 6
μ 3 μ₯ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ° μ€κ³ κΈ°λ² 9
3.1 μ¬λ€λ¦¬κΌ΄ μκΈ°μ λ ₯μ μ΄μ©ν μ€κ³ 10
3.2 μ νν μκΈ°μ λ ₯μ μ΄μ©ν μ€κ³ 29
μ 4 μ₯ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ° μ΅μ μ€κ³ 41
4.1 κΈ°μ‘΄μ μ΅μ ν κΈ°λ² 42
4.2 μ μλ μ΅μ ν κΈ°λ² 46
4.3 μ μλ μ΅μ ν κΈ°λ²μ μ΄μ©ν μꡬμμ μλκ²μΆκΈ° μ΅μ μ€κ³ 59
μ 5 μ₯ μμ ν μ€κ³, μ μ λ° νκ° 76
5.1 μ¬λ€λ¦¬κΌ΄ μκΈ°μ λ ₯μ μ΄μ©ν μλκ²μΆκΈ° μμ ν 77
5.2 μ νν μκΈ°μ λ ₯μ μ΄μ©ν μλκ²μΆκΈ° μμ ν 86
μ 6 μ₯ λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°λ₯Ό μ΄μ©ν μ λν λ κ° κ΅¬λμ₯μΉ κ³΅νμ± μ§λ μ΅μ μ μ΄ 95
6.1 μ λν λ κ° κ³΅νμ± μ§λ νμ 95
6.2 λΈλ¬μ¬ μλ μꡬμμ μλκ²μΆκΈ°λ₯Ό μ΄μ©ν 곡νμ± μ§λ μ΅μ μ μ΄ 96
μ 7 μ₯ κ²°λ‘ λ° ν₯ν μ°κ΅¬κ³ν 114
7.1 κ²°λ‘ 114
7.2 ν₯ν μ°κ΅¬κ³ν 115
μ°Έκ³ λ¬Έν 117
Abstract 129Docto
Multilocal Search and Adaptive Niching Based Memetic Algorithm With a Consensus Criterion for Data Clustering
Clustering is deemed one of the most difficult and challenging problems in machine learning. In this paper, we propose a multilocal search and adaptive niching-based genetic algorithm with a consensus criterion for automatic data clustering. The proposed algorithm employs three local searches of different features in a sophisticated manner to efficiently exploit the decision space. Furthermore, we develop an adaptive niching method, which can dynamically adjust its parameter value depending on the problem instance as well as the search progress, and incorporate it into the proposed algorithm. The adaptation strategy is based on a newly devised population diversity index, which can be used to promote both genetic diversity and fitness. Consequently, diverged niches of high fitness can be formed and maintained in the population, making the approach well-suited to effective exploration of the complex decision space of clustering problems. The resulting algorithm has been used to optimize a consensus clustering criterion, which is suggested with the purpose of achieving reliable solutions. To evaluate the proposed algorithm, we have conducted a series of experiments on both synthetic and real data and compared it with other reported methods. The results show that our proposed algorithm can achieve superior performance, outperforming related methods