{"created":"2021-03-01T06:18:37.654722+00:00","id":2031,"links":{},"metadata":{"_buckets":{"deposit":"1fbaa3c3-0f0c-422d-99e3-840118b43ae8"},"_deposit":{"id":"2031","owners":[],"pid":{"revision_id":0,"type":"depid","value":"2031"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00002031"},"item_7_alternative_title_1":{"attribute_name":"\u305d\u306e\u4ed6\u306e\u30bf\u30a4\u30c8\u30eb","attribute_value_mlt":[{"subitem_alternative_title":"\u30a6\u30a7\u30d6\u306b\u304a\u3051\u308b\u6709\u5411\u30b5\u30a4\u30c8\u30b0\u30e9\u30d5\u304b\u3089\u306e\u30b9\u30d1\u30e0\u767a\u898b\u306b\u95a2\u3059\u308b\u7814\u7a76"}]},"item_7_biblio_info_7":{"attribute_name":"\u66f8\u8a8c\u60c5\u5831","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2007-02-02","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_date_granted_25":{"attribute_name":"\u5b66\u4f4d\u6388\u4e0e\u5e74\u6708\u65e5","attribute_value_mlt":[{"subitem_dategranted":"2007-03-22"}]},"item_7_degree_name_20":{"attribute_name":"\u5b66\u4f4d\u540d","attribute_value_mlt":[{"subitem_degreename":"\u4fee\u58eb(\u60c5\u5831\u7406\u5de5\u5b66)"}]},"item_7_description_5":{"attribute_name":"\u6284\u9332","attribute_value_mlt":[{"subitem_description":"Link spam, which attempts to deceive link-based ranking algorithms of search engines by building densely connected structure between sites, has attracted the attention of researchers in year 2004 and 2005. It has been tightly connected with the success of commercial search engines (such as Google). In our research, we propose a technique for detecting link spam sites in the Web. Our method detects densely connected sets of sites from a directed graph of sites based on several patterns of directed connections, such as cycles and co-citations. We discuss which patterns are useful for detecting link spam, and show results of experiments on our Japanese web archive. The main contributions of this dissertation are outlined as follows: \u30fbWe propose a method for detecting the web spam structure based on several patterns of connections. \u30fbWe examined appropriate connection patterns and threshold for clustering the spam sites. \u30fbWe show the results of an extensive evaluation, based on 600 million sites and a manual examination of over 4000 sites.","subitem_description_type":"Abstract"}]},"item_7_full_name_3":{"attribute_name":"\u8457\u8005\u5225\u540d","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"5972","nameIdentifierScheme":"WEKO"}],"names":[{"name":"\u97d3, \u51b0\u971c"}]}]},"item_7_select_21":{"attribute_name":"\u5b66\u4f4d","attribute_value_mlt":[{"subitem_select_item":"master"}]},"item_7_subject_13":{"attribute_name":"\u65e5\u672c\u5341\u9032\u5206\u985e\u6cd5","attribute_value_mlt":[{"subitem_subject":"007","subitem_subject_scheme":"NDC"}]},"item_7_text_24":{"attribute_name":"\u7814\u7a76\u79d1\u30fb\u5c02\u653b","attribute_value_mlt":[{"subitem_text_value":"\u60c5\u5831\u7406\u5de5\u5b66\u7cfb\u7814\u7a76\u79d1\u96fb\u5b50\u60c5\u5831\u5b66\u5c02\u653b"}]},"item_7_text_4":{"attribute_name":"\u8457\u8005\u6240\u5c5e","attribute_value_mlt":[{"subitem_text_value":"\u6771\u4eac\u5927\u5b66\u5927\u5b66\u9662\u60c5\u5831\u7406\u5de5\u5b66\u7cfb\u7814\u7a76\u79d1\u96fb\u5b50\u60c5\u5831\u5b66\u5c02\u653b"},{"subitem_text_value":"Department of Information and Communication Engineering, Graduate School of Information Science and Technology, The University of Tokyo"}]},"item_creator":{"attribute_name":"\u8457\u8005","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Han, Bingshuang"}],"nameIdentifiers":[{"nameIdentifier":"5971","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"\u30d5\u30a1\u30a4\u30eb\u60c5\u5831","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-05-31"}],"displaytype":"detail","filename":"K-M221-1.pdf","filesize":[{"value":"2.9 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"K-M221-1.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/2031/files/K-M221-1.pdf"},"version_id":"0e2b197b-e660-439e-afcd-8ba76d286b69"},{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-05-31"}],"displaytype":"detail","filename":"K-M221-2.pdf","filesize":[{"value":"8.0 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"K-M221-2.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/2031/files/K-M221-2.pdf"},"version_id":"23618df4-c730-4497-83e3-b25a0d3bfe20"}]},"item_keyword":{"attribute_name":"\u30ad\u30fc\u30ef\u30fc\u30c9","attribute_value_mlt":[{"subitem_subject":"Densely Connected","subitem_subject_scheme":"Other"},{"subitem_subject":"directed graph","subitem_subject_scheme":"Other"},{"subitem_subject":"Link Spam","subitem_subject_scheme":"Other"},{"subitem_subject":"union-find","subitem_subject_scheme":"Other"}]},"item_language":{"attribute_name":"\u8a00\u8a9e","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"\u8cc7\u6e90\u30bf\u30a4\u30d7","attribute_value_mlt":[{"resourcetype":"thesis","resourceuri":"http://purl.org/coar/resource_type/c_46ec"}]},"item_title":"Detecting Web Spam from a Directed Graph of Web Sites","item_titles":{"attribute_name":"\u30bf\u30a4\u30c8\u30eb","attribute_value_mlt":[{"subitem_title":"Detecting Web Spam from a Directed Graph of Web Sites"}]},"item_type_id":"7","owner":"1","path":["9/233/234","34/105/262"],"pubdate":{"attribute_name":"\u516c\u958b\u65e5","attribute_value":"2012-01-11"},"publish_date":"2012-01-11","publish_status":"0","recid":"2031","relation_version_is_last":true,"title":["Detecting Web Spam from a Directed Graph of Web Sites"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2021-03-02T08:08:45.541762+00:00"}