WEKO3
アイテム
{"_buckets": {"deposit": "fa3dadb8-963f-4f8e-aca6-e693819bedf3"}, "_deposit": {"id": "1226", "owners": [], "pid": {"revision_id": 0, "type": "depid", "value": "1226"}, "status": "published"}, "_oai": {"id": "oai:repository.nii.ac.jp:00001226", "sets": ["136"]}, "author_link": [], "control_number": "1226", "item_5_biblio_info_30": {"attribute_name": "書誌情報", "attribute_value_mlt": [{"bibliographicIssueDates": {"bibliographicIssueDate": "2006-05-19", "bibliographicIssueDateType": "Issued"}, "bibliographicPageEnd": "21", "bibliographicPageStart": "1", "bibliographic_titles": [{"bibliographic_title": "NIIテクニカル・レポート", "bibliographic_titleLang": "ja"}, {"bibliographic_title": "NII Technical Report", "bibliographic_titleLang": "en"}]}]}, "item_5_description_28": {"attribute_name": "抄録", "attribute_value_mlt": [{"subitem_description": "This paper presents a generic model for clustering that requires no direct knowledge of the nature or representation of the data. In lieu of such knowledge, the relevant-set clustering (RSC) model relies solely on the existence of an oracle that accepts a query in the form of a data item, and returns a ranked set of items relevant to the query. In principle, the role of the oracle could be played by any similarity search structure, or even a commercial search engine whose ranking function and relevancy scores are kept secret. The quality of cluster candidates, the degree of association between pairs of cluster candidates, and the degree of association between clusters and data items are all assessed according to the statistical significance of a form of correlation among pairs of relevant sets and/or candidate cluster sets. A scalable clustering heuristic based on the RSC model is also presented, and demonstrated for very large, high-dimensional datasets using a fast approximate similarity search structure as the oracle.", "subitem_description_language": "en", "subitem_description_type": "Abstract"}]}, "item_5_identifier_registration": {"attribute_name": "ID登録", "attribute_value_mlt": [{"subitem_identifier_reg_text": "10.20736/0000001226", "subitem_identifier_reg_type": "JaLC"}]}, "item_5_publisher_31": {"attribute_name": "出版者", "attribute_value_mlt": [{"subitem_publisher": "国立情報学研究所", "subitem_publisher_language": "ja"}]}, "item_5_source_id_32": {"attribute_name": "ISSN", "attribute_value_mlt": [{"subitem_source_identifier": "1346-5597", "subitem_source_identifier_type": "ISSN"}]}, "item_creator": {"attribute_name": "著者", "attribute_type": "creator", "attribute_value_mlt": [{"creatorNames": [{"creatorName": "Houle, Michael E.", "creatorNameLang": "en"}]}]}, "item_files": {"attribute_name": "ファイル情報", "attribute_type": "file", "attribute_value_mlt": [{"accessrole": "open_date", "date": [{"dateType": "Available", "dateValue": "2019-03-12"}], "displaytype": "detail", "download_preview_message": "", "file_order": 0, "filename": "06-008E.pdf", "filesize": [{"value": "304.1 kB"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 304100.0, "url": {"label": "NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering", "url": "https://repository.nii.ac.jp/record/1226/files/06-008E.pdf"}, "version_id": "2dcff304-3caf-4217-8047-a1e65c539bff"}]}, "item_keyword": {"attribute_name": "キーワード", "attribute_value_mlt": [{"subitem_subject": "テクニカルレポート", "subitem_subject_language": "ja", "subitem_subject_scheme": "Other"}, {"subitem_subject": "Technical Report", "subitem_subject_language": "en", "subitem_subject_scheme": "Other"}]}, "item_language": {"attribute_name": "言語", "attribute_value_mlt": [{"subitem_language": "eng"}]}, "item_resource_type": {"attribute_name": "資源タイプ", "attribute_value_mlt": [{"resourcetype": "departmental bulletin paper", "resourceuri": "http://purl.org/coar/resource_type/c_6501"}]}, "item_title": "NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering", "item_titles": {"attribute_name": "タイトル", "attribute_value_mlt": [{"subitem_title": "NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering", "subitem_title_language": "en"}]}, "item_type_id": "5", "owner": "1", "path": ["136"], "permalink_uri": "https://doi.org/10.20736/0000001226", "pubdate": {"attribute_name": "PubDate", "attribute_value": "2019-03-12"}, "publish_date": "2019-03-12", "publish_status": "0", "recid": "1226", "relation": {}, "relation_version_is_last": true, "title": ["NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering"], "weko_shared_id": -1}
NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering
https://doi.org/10.20736/0000001226
https://doi.org/10.20736/00000012262df63560-eb61-48ae-a9f0-dc3cc64f42a7
名前 / ファイル | ライセンス | アクション |
---|---|---|
NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering (304.1 kB)
|
|
Item type | レポート / Report(1) | |||||||
---|---|---|---|---|---|---|---|---|
公開日 | 2019-03-12 | |||||||
タイトル | ||||||||
言語 | en | |||||||
タイトル | NII Technical Report (NII-2006-008E):A Generic Query-Based Model for Scalable Clustering | |||||||
言語 | ||||||||
言語 | eng | |||||||
キーワード | ||||||||
言語 | ja | |||||||
主題Scheme | Other | |||||||
主題 | テクニカルレポート | |||||||
キーワード | ||||||||
言語 | en | |||||||
主題Scheme | Other | |||||||
主題 | Technical Report | |||||||
資源タイプ | ||||||||
資源 | http://purl.org/coar/resource_type/c_6501 | |||||||
タイプ | departmental bulletin paper | |||||||
ID登録 | ||||||||
ID登録 | 10.20736/0000001226 | |||||||
ID登録タイプ | JaLC | |||||||
著者 |
Houle, Michael E.
× Houle, Michael E.
|
|||||||
抄録 | ||||||||
内容記述タイプ | Abstract | |||||||
内容記述 | This paper presents a generic model for clustering that requires no direct knowledge of the nature or representation of the data. In lieu of such knowledge, the relevant-set clustering (RSC) model relies solely on the existence of an oracle that accepts a query in the form of a data item, and returns a ranked set of items relevant to the query. In principle, the role of the oracle could be played by any similarity search structure, or even a commercial search engine whose ranking function and relevancy scores are kept secret. The quality of cluster candidates, the degree of association between pairs of cluster candidates, and the degree of association between clusters and data items are all assessed according to the statistical significance of a form of correlation among pairs of relevant sets and/or candidate cluster sets. A scalable clustering heuristic based on the RSC model is also presented, and demonstrated for very large, high-dimensional datasets using a fast approximate similarity search structure as the oracle. | |||||||
言語 | en | |||||||
書誌情報 |
ja : NIIテクニカル・レポート en : NII Technical Report p. 1-21, 発行日 2006-05-19 |
|||||||
出版者 | ||||||||
言語 | ja | |||||||
出版者 | 国立情報学研究所 | |||||||
ISSN | ||||||||
収録物識別子タイプ | ISSN | |||||||
収録物識別子 | 1346-5597 |