{"metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00220031","sets":["1164:3500:10803:10983"]},"path":["10983"],"owner":"44499","recid":"220031","title":["User-Interactive Molecular Graph Suggestion for Drug Discovery"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-09-02"},"_buckets":{"deposit":"76d0b749-306c-4aaf-b5a9-d06a4903232f"},"_deposit":{"id":"220031","pid":{"type":"depid","value":"220031","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"User-Interactive Molecular Graph Suggestion for Drug Discovery","author_link":["574794","574792","574795","574791","574793","574796"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"User-Interactive Molecular Graph Suggestion for Drug Discovery"},{"subitem_title":"User-Interactive Molecular Graph Suggestion for Drug Discovery","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-09-02","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University"},{"subitem_text_value":"Hokkaido University／RIKEN AIP"},{"subitem_text_value":"Nagoya University／Osaka University"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Hokkaido University","subitem_text_language":"en"},{"subitem_text_value":"Hokkaido University / RIKEN AIP","subitem_text_language":"en"},{"subitem_text_value":"Nagoya University / Osaka University","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/220031/files/IPSJ-IFAT22148033.pdf","label":"IPSJ-IFAT22148033.pdf"},"date":[{"dateType":"Available","dateValue":"2024-09-02"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-IFAT22148033.pdf","filesize":[{"value":"3.2 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"39"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"0decb964-ced9-4191-a190-fd2625d10aea","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Sheng, Hu"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ichigaku, Takigawa"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Chuan, Xiao"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Sheng, Hu","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ichigaku, Takigawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Chuan, Xiao","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10114171","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8884","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"We present a novel molecular graph generation method by auto-completing a privileged scaffold which represents a core graph substructure step-by-step. We propose a generative GNN model thus providing the ability to generate unseen molecular graphs outside the given training set. An edit-aware graph autocompletion paradigm that follows the “substructure-by-substructure” process is designed to complete the scaffold queries in multiple substructure adopt operations and allow meaningful edit operations to show the user's intention. Such operations enable the involvement of user decisions when interacting with a generative user-centered AI system, which differentiates our work from existing single-run generation paradigms. Particularly, a Monte Carlo tree search (MCTS) method is employed to satisfy the property requirements and navigate the search space when complying with users' edit operations. Moreover, we design a top-k ranking function which considers the preferences on popularity and diversity for different applications, such as query compositions for graph database and drug discovery respectively. Such techniques enable human experts to synergistically interact with the generative models grounded on large data.","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"We present a novel molecular graph generation method by auto-completing a privileged scaffold which represents a core graph substructure step-by-step. We propose a generative GNN model thus providing the ability to generate unseen molecular graphs outside the given training set. An edit-aware graph autocompletion paradigm that follows the “substructure-by-substructure” process is designed to complete the scaffold queries in multiple substructure adopt operations and allow meaningful edit operations to show the user's intention. Such operations enable the involvement of user decisions when interacting with a generative user-centered AI system, which differentiates our work from existing single-run generation paradigms. Particularly, a Monte Carlo tree search (MCTS) method is employed to satisfy the property requirements and navigate the search space when complying with users' edit operations. Moreover, we design a top-k ranking function which considers the preferences on popularity and diversity for different applications, such as query compositions for graph database and drug discovery respectively. Such techniques enable human experts to synergistically interact with the generative models grounded on large data.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告情報基礎とアクセス技術（IFAT）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-09-02","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"33","bibliographicVolumeNumber":"2022-IFAT-148"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":220031,"updated":"2025-01-19T14:41:33.741597+00:00","links":{},"created":"2025-01-19T01:20:04.958622+00:00"}