WEKO3
アイテム
{"_buckets": {"deposit": "bc1fc4ae-7619-4409-8f78-074e008a120e"}, "_deposit": {"created_by": 10, "id": "13572", "owners": [10], "pid": {"revision_id": 0, "type": "depid", "value": "13572"}, "status": "published"}, "_oai": {"id": "oai:kanagawa-u.repo.nii.ac.jp:00013572", "sets": ["1311"]}, "author_link": ["35257", "35217", "35268", "35266", "35217", "35267"], "item_3_alternative_title_20": {"attribute_name": "その他の言語のタイトル", "attribute_value_mlt": [{"subitem_alternative_title": "A Pruning Method for the Decision Tree Based on Run-Based Trie"}]}, "item_3_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2020-10-30", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "60", "bibliographicPageStart": "53", "bibliographicVolumeNumber": "31", "bibliographic_titles": [{"bibliographic_title": "Science Journal of Kanagawa University", "bibliographic_titleLang": "en"}]}]}, "item_3_creator_2": {"attribute_name": "著者(ヨミ)", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "ハラダ, タカシ"}], "nameIdentifiers": [{"nameIdentifier": "35257", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "タナカ, ケン"}], "nameIdentifiers": [{"nameIdentifier": "35217", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "35217", "nameIdentifierScheme": "ローカル著者ID", "nameIdentifierURI": " "}]}, {"creatorNames": [{"creatorName": "ミカワ, ケンジ"}], "nameIdentifiers": [{"nameIdentifier": "35268", "nameIdentifierScheme": "WEKO"}]}]}, "item_3_description_4": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "Numerous methods for packet classification have been developed. We proposed a decision tree method based on Run-Based Trie. In this paper, we propose a pruning method for the decision tree. Space complexity of the pruning method is still O(l3l) where l is the length of a rule. Applying the proposed pruning method, we can construct a decision tree where l = 64, which can not be constructed with the conventional method. This result shows that, although our decision tree method based on Run-Based Trie is not feasible in theory, it can be used in a practical sense.", "subitem_description_type": "Abstract"}]}, "item_3_description_40": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"subitem_description": "Departmental Bulletin Paper", "subitem_description_type": "Other"}]}, "item_3_description_5": {"attribute_name": "内容記述", "attribute_value_mlt": [{"subitem_description": "原著", "subitem_description_type": "Other"}, {"subitem_description": "2019年度神奈川大学総合理学研究所共同研究助成論文", "subitem_description_type": "Other"}]}, "item_3_publisher_33": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "神奈川大学総合理学研究所"}]}, "item_3_source_id_10": {"attribute_name": "書誌レコードID", "attribute_value_mlt": [{"subitem_source_identifier": "AA12068302", "subitem_source_identifier_type": "NCID"}]}, "item_3_source_id_8": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1880-0483", "subitem_source_identifier_type": "ISSN"}]}, "item_3_version_type_16": {"attribute_name": "著者版フラグ", "attribute_value_mlt": [{"subitem_version_resource": "http://purl.org/coar/version/c_970fb48d4fbd8a85", "subitem_version_type": "VoR"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "原田, 崇司"}], "nameIdentifiers": [{"nameIdentifier": "35266", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "田中, 賢"}], "nameIdentifiers": [{"nameIdentifier": "35217", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "35217", "nameIdentifierScheme": "ローカル著者ID", "nameIdentifierURI": " "}]}, {"creatorNames": [{"creatorName": "三河, 賢治"}], "nameIdentifiers": [{"nameIdentifier": "35267", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2021-01-12"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "08 連分割トライに基づく決定木の枝刈り法.pdf", "filesize": [{"value": "1.1 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_note", "mimetype": "application/pdf", "size": 1100000.0, "url": {"label": "08 連分割トライに基づく決定木の枝刈り法", "url": "https://kanagawa-u.repo.nii.ac.jp/record/13572/files/08 連分割トライに基づく決定木の枝刈り法.pdf"}, "version_id": "0c52b792-1d68-4153-9026-3491800edff6"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "packet classification", "subitem_subject_scheme": "Other"}, {"subitem_subject": "arbitray bitmask", "subitem_subject_scheme": "Other"}, {"subitem_subject": "trie", "subitem_subject_scheme": "Other"}, {"subitem_subject": "decision tree", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "連分割トライに基づく決定木の枝刈り法", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "連分割トライに基づく決定木の枝刈り法", "subitem_title_language": "ja"}, {"subitem_title": "A Pruning Method for the Decision Tree Based on Run-Based Trie", "subitem_title_language": "en"}]}, "item_type_id": "3", "owner": "10", "path": ["1311"], "permalink_uri": "http://hdl.handle.net/10487/00016659", "pubdate": {"attribute_name": "公開日", "attribute_value": "2021-01-12"}, "publish_date": "2021-01-12", "publish_status": "0", "recid": "13572", "relation": {}, "relation_version_is_last": true, "title": ["連分割トライに基づく決定木の枝刈り法"], "weko_shared_id": -1}
連分割トライに基づく決定木の枝刈り法
http://hdl.handle.net/10487/00016659
http://hdl.handle.net/10487/0001665951a52c65-3fcb-4892-9783-e09574435a70
名前 / ファイル | ライセンス | アクション |
---|---|---|
08 連分割トライに基づく決定木の枝刈り法 (1.1 MB)
|
|
Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
---|---|---|---|---|---|---|
公開日 | 2021-01-12 | |||||
タイトル | ||||||
言語 | ja | |||||
タイトル | 連分割トライに基づく決定木の枝刈り法 | |||||
タイトル | ||||||
言語 | en | |||||
タイトル | A Pruning Method for the Decision Tree Based on Run-Based Trie | |||||
言語 | ||||||
言語 | jpn | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | packet classification | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | arbitray bitmask | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | trie | |||||
キーワード | ||||||
主題Scheme | Other | |||||
主題 | decision tree | |||||
資源タイプ | ||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
資源タイプ | departmental bulletin paper | |||||
著者 |
原田, 崇司
× 原田, 崇司× 田中, 賢× 三河, 賢治 |
|||||
抄録 | ||||||
内容記述タイプ | Abstract | |||||
内容記述 | Numerous methods for packet classification have been developed. We proposed a decision tree method based on Run-Based Trie. In this paper, we propose a pruning method for the decision tree. Space complexity of the pruning method is still O(l3l) where l is the length of a rule. Applying the proposed pruning method, we can construct a decision tree where l = 64, which can not be constructed with the conventional method. This result shows that, although our decision tree method based on Run-Based Trie is not feasible in theory, it can be used in a practical sense. | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 原著 | |||||
内容記述 | ||||||
内容記述タイプ | Other | |||||
内容記述 | 2019年度神奈川大学総合理学研究所共同研究助成論文 | |||||
書誌情報 |
en : Science Journal of Kanagawa University 巻 31, p. 53-60, 発行日 2020-10-30 |
|||||
ISSN | ||||||
収録物識別子タイプ | ISSN | |||||
収録物識別子 | 1880-0483 | |||||
書誌レコードID | ||||||
収録物識別子タイプ | NCID | |||||
収録物識別子 | AA12068302 | |||||
著者版フラグ | ||||||
出版タイプ | VoR | |||||
出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
その他の言語のタイトル | ||||||
その他のタイトル | A Pruning Method for the Decision Tree Based on Run-Based Trie | |||||
出版者 | ||||||
出版者 | 神奈川大学総合理学研究所 | |||||
資源タイプ | ||||||
内容記述タイプ | Other | |||||
内容記述 | Departmental Bulletin Paper |