{"_buckets": {"deposit": "c7df2bfd-ccc0-428d-9500-6a8905ea1f75"}, "_deposit": {"created_by": 27, "id": "2033", "owners": [27], "pid": {"revision_id": 0, "type": "depid", "value": "2033"}, "status": "published"}, "_oai": {"id": "oai:repo.lib.tut.ac.jp:00002033", "sets": ["9"]}, "author_link": ["3843", "3844", "3845", "3846"], "item_10001_biblio_info_7": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2017-12-01", "bibliographicIssueDateType": "Issued"}, "bibliographicIssueNumber": "12", "bibliographicPageEnd": "486", "bibliographicPageStart": "475", "bibliographicVolumeNumber": "J100-A", "bibliographic_titles": [{"bibliographic_title": "電子情報通信学会論文誌. A, 基礎・境界"}, {"bibliographic_title": "IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences (Japanese Edition)", "bibliographic_titleLang": "en"}]}]}, "item_10001_description_5": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "ディリクレ過程平均法はクラスタリングの代表的手法であるK-平均法を拡張した手法であり，クラスタ数をデータから推定することができる．クラスタ数を指定する代わりに，ペナルティパラメータと呼ばれるしきい値を指定する必要があるが，ペナルティパラメータの変化に対するクラスタ数の振る舞いは未だに明らかにされていない．本研究では，ペナルティパラメータとクラスタ数の対数を次元で割った値との組がそれぞれレートひずみ理論における最大ひずみとレートに対応することに着目し，データ数とデータの次元が無限大の極限において，ペナルティパラメータに対応するクラスタ数の曲線がレートひずみ曲線に近づくことを示す．数値実験により，学習データ数が有限であることの影響を受けにくいレートが0 の近辺において，レートひずみ曲線に近づくことを確認し，ペナルティパラメータと学習データ中の最大ひずみとの対応を示す．", "subitem_description_type": "Abstract"}]}, "item_10001_publisher_8": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "電子情報通信学会"}]}, "item_10001_relation_17": {"attribute_name": "関連サイト", "attribute_value_mlt": [{"subitem_relation_name": [{"subitem_relation_name_text": "IEICE Transactions Online トップ"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": "https://search.ieice.org/", "subitem_relation_type_select": "URI"}}, {"subitem_relation_name": [{"subitem_relation_name_text": "IEICE Transactions Onlineサイト当該論文掲載URL"}], "subitem_relation_type_id": {"subitem_relation_type_id_text": " https://search.ieice.org/bin/summary.php?id=j100-a_12_475\u0026category=A\u0026year=2017\u0026lang=J\u0026abst=", "subitem_relation_type_select": "URI"}}]}, "item_10001_rights_15": {"attribute_name": "権利", "attribute_value_mlt": [{"subitem_rights": "copyright©2017 IEICE,　出典：電子情報通信学会論文誌A Vol.J100-A, No.12, pp.475-486, 2017 出版社版, 著者リポジトリ公開許諾済 "}]}, "item_10001_source_id_9": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1881-0195", "subitem_source_identifier_type": "ISSN"}]}, "item_10001_version_type_20": {"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": "3843", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "渡辺, 一帆"}], "nameIdentifiers": [{"nameIdentifier": "3844", "nameIdentifierScheme": "WEKO"}, {"nameIdentifier": "10506744", "nameIdentifierScheme": "e-Rad", "nameIdentifierURI": "https://kaken.nii.ac.jp/ja/search/?qm=10506744"}]}, {"creatorNames": [{"creatorName": "Kobayashi, Masahiro", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "3845", "nameIdentifierScheme": "WEKO"}]}, {"creatorNames": [{"creatorName": "Watanabe, Kazuho", "creatorNameLang": "en"}], "nameIdentifiers": [{"nameIdentifier": "3846", "nameIdentifierScheme": "WEKO"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2018-03-19"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "d18810195-j100-475.pdf", "filesize": [{"value": "1.0 MB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1000000.0, "url": {"label": "d18810195-j100-475.pdf", "url": "https://repo.lib.tut.ac.jp/record/2033/files/d18810195-j100-475.pdf"}, "version_id": "bf3b3b83-1f99-4509-b4b9-6199c72393da"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "クラスタリング", "subitem_subject_scheme": "Other"}, {"subitem_subject": "ディリクレ過程", "subitem_subject_scheme": "Other"}, {"subitem_subject": "レートひずみ曲線", "subitem_subject_scheme": "Other"}, {"subitem_subject": "ひずみ有りデータ圧縮", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "jpn"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "journal article", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "ディリクレ過程平均法のレートひずみ理論による解釈", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "ディリクレ過程平均法のレートひずみ理論による解釈"}, {"subitem_title": "A Rate-Distortion Theoretic View of Dirichlet Process Means Clustering", "subitem_title_language": "en"}]}, "item_type_id": "10001", "owner": "27", "path": ["9"], "permalink_uri": "https://repo.lib.tut.ac.jp/records/2033", "pubdate": {"attribute_name": "公開日", "attribute_value": "2018-03-19"}, "publish_date": "2018-03-19", "publish_status": "0", "recid": "2033", "relation": {}, "relation_version_is_last": true, "title": ["ディリクレ過程平均法のレートひずみ理論による解釈"], "weko_shared_id": -1}