{"links":{},"id":212772,"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00212772","sets":["1164:2836:10501:10639"]},"path":["10639"],"owner":"44499","recid":"212772","title":["勾配ブースティング決定木を用いたネットワーク侵入検知システムの提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2021-09-02"},"_buckets":{"deposit":"261616f8-f34a-4d99-b576-48d88c07e9fc"},"_deposit":{"id":"212772","pid":{"type":"depid","value":"212772","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"勾配ブースティング決定木を用いたネットワーク侵入検知システムの提案","author_link":["543339","543340"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"勾配ブースティング決定木を用いたネットワーク侵入検知システムの提案"}]},"item_keyword":{"attribute_name":"キーワード","attribute_value_mlt":[{"subitem_subject":"情報システム基盤","subitem_subject_scheme":"Other"}]},"item_type_id":"4","publish_date":"2021-09-02","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"福井大学"},{"subitem_text_value":"福井大学"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/212772/files/IPSJ-DPS21188018.pdf","label":"IPSJ-DPS21188018.pdf"},"date":[{"dateType":"Available","dateValue":"2023-09-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DPS21188018.pdf","filesize":[{"value":"809.3 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"34"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"54da4387-f92b-4eeb-8ac7-bd7f505042d8","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2021 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"都留, 悠哉"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"川上, 朋也"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10116224","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8906","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"情報セキュリティにおいて標的型攻撃の脅威が深刻化しており，対抗手段の一つとしてネットワーク侵入検知システム（Network-based Intrusion Detection System, NIDS）があげられる．NIDS はネットワークを監視し，不正な通信を検知する．NIDS に関するさまざまな研究が現在行われ，特に機械学習による高性能化が注目されている．そこで，本論文では勾配ブースティング決定木（Gradient Boosting Decision Tree, GBDT）を用いた NIDS を提案する．GBDT は教師あり学習の一つであり，高い汎化能力によって，未知のデータに対しても高い精度で判別できる．また，機械学習を用いた NIDS では学習や評価のために膨大な量のデータが必要であり，複数の NIDS 用データセットも公開されている．本論文では Kyoto 2016 Dataset を用いて提案システムの学習と評価を行い，既存システムより検知精度が向上することを確認した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告マルチメディア通信と分散処理（DPS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2021-09-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"18","bibliographicVolumeNumber":"2021-DPS-188"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"created":"2025-01-19T01:13:42.259157+00:00","updated":"2025-01-19T17:23:00.472333+00:00"}