{"created":"2021-03-01T06:19:01.676657+00:00","id":2419,"links":{},"metadata":{"_buckets":{"deposit":"68dd5803-fcbc-4169-9abc-137b86f5d246"},"_deposit":{"id":"2419","owners":[],"pid":{"revision_id":0,"type":"depid","value":"2419"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00002419","sets":["34:105:330","9:233:280"]},"item_7_alternative_title_1":{"attribute_name":"その他のタイトル","attribute_value_mlt":[{"subitem_alternative_title":"シーケンスパタマイニングの高速アルゴリズムに関する研究"}]},"item_7_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"2008-03","bibliographicIssueDateType":"Issued"},"bibliographic_titles":[{}]}]},"item_7_date_granted_25":{"attribute_name":"学位授与年月日","attribute_value_mlt":[{"subitem_dategranted":"2008-03-13"}]},"item_7_degree_grantor_23":{"attribute_name":"学位授与機関","attribute_value_mlt":[{"subitem_degreegrantor":[{"subitem_degreegrantor_name":"University of Tokyo (東京大学)"}]}]},"item_7_degree_name_20":{"attribute_name":"学位名","attribute_value_mlt":[{"subitem_degreename":"博士(情報理工学)"}]},"item_7_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"Sequential pattern mining, which extracts frequent subsequences from a sequence database, has attracted a great deal of interest during the recent surge in data mining research because it is the basis of many applications. Much work has been carried out on mining frequent patterns, however, their performance is still far from satisfactory because of two main challenges: large search spaces and the ineffectiveness in handling dense data sets. To offer a solution to the above challenges, we have proposed a series of novel algorithms, called the LAst Position INduction (LAPIN) sequential pattern mining, which is based on the idea that the last position of an item, $\\alpha$, is the key to judging whether or not a frequent k-length sequential pattern can be extended to be a frequent (k+1)-length pattern by appending the item $\\alpha$ to it. LAPIN can largely reduce the search space during the mining process, and is very effective in mining dense data sets. Our performance study demonstrates that LAPIN outperforms the existing state-of-the-art algorithms by up to orders of magnitude on pattern dense data sets. Moreover, in this thesis, we propose our effective Web log mining system based on our efficient sequential mining algorithm to extract user access patterns from traversal path in Web logs. Recently, the skyline query has attracted considerable attention. In this thesis, we are interested in the general model of skyline query, General Dominant Relationship. We find the interrelated connection between sequential pattern mining and the general dominant relationship. Based on this discovery, we extend sequential pattern mining techniques to efficiently answer the general dominant relationship queries. Extensive experiments illustrate the effectiveness and efficiency of our methods","subitem_description_type":"Abstract"}]},"item_7_dissertation_number_26":{"attribute_name":"学位授与番号","attribute_value_mlt":[{"subitem_dissertationnumber":"甲第23174号"}]},"item_7_full_name_3":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"6674","nameIdentifierScheme":"WEKO"}],"names":[{"name":"楊, 征路"}]}]},"item_7_identifier_registration":{"attribute_name":"ID登録","attribute_value_mlt":[{"subitem_identifier_reg_text":"10.15083/00002413","subitem_identifier_reg_type":"JaLC"}]},"item_7_select_21":{"attribute_name":"学位","attribute_value_mlt":[{"subitem_select_item":"doctoral"}]},"item_7_subject_13":{"attribute_name":"日本十進分類法","attribute_value_mlt":[{"subitem_subject":"548","subitem_subject_scheme":"NDC"}]},"item_7_text_22":{"attribute_name":"学位分野","attribute_value_mlt":[{"subitem_text_value":"Information Science and Technology (情報理工学)"}]},"item_7_text_24":{"attribute_name":"研究科・専攻","attribute_value_mlt":[{"subitem_text_value":"Department of Information and Communication Engineering, Graduate School of Information Science and Technology (情報理工学系研究科電子情報学専攻)"}]},"item_7_text_27":{"attribute_name":"学位記番号","attribute_value_mlt":[{"subitem_text_value":"博情第161号"}]},"item_7_text_4":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"大学院情報理工学系研究科電子情報学専攻"},{"subitem_text_value":"Graduate School of Information Science and Technology Department of Information and Communication Engineering The University of Tokyo"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Yang, Zhenglu"}],"nameIdentifiers":[{"nameIdentifier":"6673","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-05-31"}],"displaytype":"detail","filename":"48047420.pdf","filesize":[{"value":"2.1 MB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"48047420.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/2419/files/48047420.pdf"},"version_id":"af3a069b-f915-49b6-a026-81c251f481fd"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"thesis","resourceuri":"http://purl.org/coar/resource_type/c_46ec"}]},"item_title":"Fast Algorithms for Sequential Pattern Mining","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Fast Algorithms for Sequential Pattern Mining"}]},"item_type_id":"7","owner":"1","path":["280","330"],"pubdate":{"attribute_name":"公開日","attribute_value":"2012-03-01"},"publish_date":"2012-03-01","publish_status":"0","recid":"2419","relation_version_is_last":true,"title":["Fast Algorithms for Sequential Pattern Mining"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-19T03:44:12.771931+00:00"}