Query learning algorithm for ordered multi-terminal binary decision diagrams

Nakamura, Atsuyoshi

Discrete applied mathematics, 2024, 352, 69-87

Permalink : https://hdl.handle.net/2115/97214

このアイテムのアクセス数:8件（2026-06-01 15:41 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
am2023c3	pdf	1.22 MB	9

アクセス権	open access
URI	https://hdl.handle.net/2115/97214
タイトル	Query learning algorithm for ordered multi-terminal binary decision diagrams
著者	e-Rad_Researcher 50344487 著者名 Nakamura, Atsuyoshi
言語	英語
キーワード	Query learning
	Sample complexity
	OMTBDD
発行日	2024-07-31
出版者	Elsevier
収録物名	Discrete applied mathematics
巻(号)	352
ページ	69-87
抄録	We propose a query learning algorithm for ordered multi-terminal binary decision diagrams (OMTBDDs) using at most n equivalence and less than 2n(inverted right perpendicularlog(2) minverted left perpendicular + 2n) membership queries by extending the algorithm for ordered binary decision diagrams (OBDDs). The tightness of our upper bounds is checked in our experiments using synthetically generated target OMTBDDs. The possibility of applying our algorithm to classification problems is also indicated in our other experiments using datasets from the UCI Machine Learning Repository.
資源タイプ	学術雑誌論文
出版タイプ	Accepted Manuscript
権利情報	Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
権利情報	© <2024>. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
PISSN	0166-218X
関連情報 (isVersionOf)	出版社版DOI https://doi.org/10.1016/j.dam.2024.04.002