Learning a subclass of regular patterns in polynomial time

Case, John; Jain, Sanjay; Reischuk, Rüdiger et al.

Theoretical Computer Science, 2006, 364(1), 115-131

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

このアイテムのアクセス数:1,002件（2026-05-26 07:21 集計）

ファイル	フォーマット	サイズ	閲覧回数	説明
TCS364-1-115	pdf	259 KB	1,093

アクセス権	open access
URI	https://hdl.handle.net/2115/17138
タイトル	Learning a subclass of regular patterns in polynomial time
著者	Case, John ; Jain, Sanjay ; Reischuk, Rüdiger ; Stephan, Frank ; Zeugmanne, Thomas
著者名 Case, John
著者名 Jain, Sanjay
著者名 Reischuk, Rüdiger
著者名 Stephan, Frank
著者名 Zeugmanne, Thomas
言語	英語
キーワード	Algorithmic learning
	Pattern languages
	Average-case analysis
	Probabilistically exact learning
発行日	2006
出版者	Elsevier
収録物名	Theoretical Computer Science
巻(号)	364(1)
ページ	115-131
抄録	An algorithm for learning a subclass of erasing regular pattern languages is presented. On extended regular pattern languages generated by patterns π of the form xoaıxı…amxm, where xo,…,xm are variables and aı,…am strings of terminals of length c each, it runs with arbitrarily high probability of success using a number of examples polynomial in m (and exponential in c). It is assumed that m is unknown, but c is known and that samples are randomly drawn according to some distribution, for which we only require that it has certain natural and plausible properties. Aiming to improve this algorithm further we also explore computer simulations of a heuristic.
資源タイプ	学術雑誌論文
出版タイプ	Accepted Manuscript
PISSN	0304-3975
関連情報	URI http://www.sciencedirect.com/science/journal/03043975
関連情報 (isVersionOf)	出版社版DOI https://doi.org/10.1016/j.tcs.2006.07.044