{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1390021758109082496.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.3156/jsoft.37.1_553"}},{"identifier":{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/jsoft/37/1/37_553/_pdf"}}],"dc:title":[{"@language":"en","@value":"Applying YUKI Algorithm to Interactive Evolutionary Computation"},{"@language":"ja","@value":"対話型進化計算におけるYUKIアルゴリズムの適用"}],"dc:language":"ja","description":[{"type":"abstract","notation":[{"@language":"en","@value":"<p>We apply the YUKI algorithm to interactive evolutionary computation as a new approach in candidate solution retrieval. The YUKI algorithm searches for the optimal solution by balancing convergence and divergence of the current optimal solution candidates. The proposed method presents various solution candidates through the convergence and divergence of the candidate solution group when a user’s Kansei space includes complexity and multimodality. We investigate the performance evaluation of the proposed algorithm through numerical simulations using a pseudo-user model which evaluates the candidate solution instead of real users. The simulation results indicate that, compared to traditional interactive genetic algorithm and interactive tabu search algorithm, the proposed algorithm can effectively balance convergence and diffusion in the search for candidate solutions, resulting in a tendency for higher evolutionary performance when the pseudo user has several preference points.</p>"},{"@language":"ja","@value":"<p>本研究では，対話型進化計算手法における新たな進化計算アルゴリズムに，YUKIアルゴリズムを適用する．YUKIアルゴリズムは，現在の最良解候補に対して解候補群の収束と拡散を用いて最良解を探索する．提案手法では，問題の対象がユーザの感性空間のように複雑性や多峰性を有する場合には，解候補群の収束と発散によって様々な解候補を提示できるようになる．本研究では，提案手法の性能を実ユーザの代わりに擬似ユーザが解候補を評価する数値シミュレーションにより検証する．シミュレーション結果より，提案手法は従来の対話型遺伝的アルゴリズムや対話型タブーサーチと比較して，ユーザの感性評価が多峰的である場合において，解候補群はある程度の分散を保ったまま進化し，良好な進化性能を有することが確認された．</p>"}],"abstractLicenseFlag":"disallow"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1410021758109082496","@type":"Researcher","foaf:name":[{"@language":"en","@value":"TAKENOUCHI Hiroshi"},{"@language":"ja","@value":"竹之内 宏"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"福岡工業大学 情報工学部"},{"@language":"en","@value":"Faculty of Information Engineering, Fukuoka Institute of Technology"}]},{"@id":"https://cir.nii.ac.jp/crid/1410021758109082498","@type":"Researcher","foaf:name":[{"@language":"en","@value":"BENAISSA Brahim"},{"@language":"ja","@value":"ベネッサ ブラヒム"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"豊田工業大学 設計工学研究室"},{"@language":"en","@value":"Design Engineering Laboratory, Toyota Technological Institute"}]},{"@id":"https://cir.nii.ac.jp/crid/1410021758109082497","@type":"Researcher","foaf:name":[{"@language":"en","@value":"TOKUMARU Masataka"},{"@language":"ja","@value":"徳丸 正孝"}],"jpcoar:affiliationName":[{"@language":"ja","@value":"関西大学 システム理工学部"},{"@language":"en","@value":"Faculty of Engineering Science, Kansai University"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"13477986"},{"@type":"EISSN","@value":"18817203"}],"prism:publicationName":[{"@language":"en","@value":"Journal of Japan Society for Fuzzy Theory and Intelligent Informatics"},{"@language":"ja","@value":"知能と情報"},{"@language":"en","@value":"J. SOFT"},{"@language":"ja","@value":"日本知能情報ファジィ学会誌"}],"dc:publisher":[{"@language":"en","@value":"Japan Society for Fuzzy Theory and Intelligent Informatics"},{"@language":"ja","@value":"日本知能情報ファジィ学会"}],"prism:publicationDate":"2025-02-15","prism:volume":"37","prism:number":"1","prism:startingPage":"553","prism:endingPage":"557"},"reviewed":"false","url":[{"@id":"https://www.jstage.jst.go.jp/article/jsoft/37/1/37_553/_pdf"}],"availableAt":"2025-02-15","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=YUKI%E3%82%A2%E3%83%AB%E3%82%B4%E3%83%AA%E3%82%BA%E3%83%A0","dc:title":"YUKIアルゴリズム"},{"@id":"https://cir.nii.ac.jp/all?q=%E5%AF%BE%E8%A9%B1%E5%9E%8B%E9%80%B2%E5%8C%96%E8%A8%88%E7%AE%97","dc:title":"対話型進化計算"},{"@id":"https://cir.nii.ac.jp/all?q=%E6%95%B0%E5%80%A4%E3%82%B7%E3%83%9F%E3%83%A5%E3%83%AC%E3%83%BC%E3%82%B7%E3%83%A7%E3%83%B3","dc:title":"数値シミュレーション"},{"@id":"https://cir.nii.ac.jp/all?q=YUKI%20algorithm","dc:title":"YUKI algorithm"},{"@id":"https://cir.nii.ac.jp/all?q=interactive%20evolutionary%20computation","dc:title":"interactive evolutionary computation"},{"@id":"https://cir.nii.ac.jp/all?q=numerical%20simulation","dc:title":"numerical simulation"}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360580236939677440","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"YUKI Algorithm and POD-RBF for Elastostatic and dynamic crack identification"}]},{"@id":"https://cir.nii.ac.jp/crid/1360585450878841216","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A comprehensive survey on interactive evolutionary computation in the first two decades of the 21st century"}]},{"@id":"https://cir.nii.ac.jp/crid/1360585451508279808","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A two-stage information retrieval system based on interactive multimodal genetic algorithm for query weight optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1360866922338488704","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Novel Approach for Individual Design Perception Based on Fuzzy Inference System Training with YUKI Algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1390001204379700224","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Interactive Evolutionary Computation Using a Tabu Search Algorithm"}]}],"dataSourceIdentifier":[{"@type":"JALC","@value":"oai:japanlinkcenter.org:2013865943"},{"@type":"CROSSREF","@value":"10.3156/jsoft.37.1_553"}]}