|
Hokkaido University Collection of Scholarly and Academic Papers >
Graduate School of Information Science and Technology / Faculty of Information Science and Technology >
Peer-reviewed Journal Articles, etc >
Learning a subclass of regular patterns in polynomial time
| Title: | Learning a subclass of regular patterns in polynomial time |
| Authors: | Case, John Browse this author | | Jain, Sanjay Browse this author | | Reischuk, Rüdiger Browse this author | | Stephan, Frank Browse this author | | Zeugmanne, Thomas Browse this author |
| Keywords: | Algorithmic learning | | Pattern languages | | Average-case analysis | | Probabilistically exact learning |
| Issue Date: | 2006 |
| Publisher: | Elsevier |
| Journal Title: | Theoretical Computer Science |
| Volume: | 364 |
| Issue: | 1 |
| Start Page: | 115 |
| End Page: | 131 |
| Publisher DOI: | 10.1016/j.tcs.2006.07.044 |
| Abstract: | 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. |
| Relation: | http://www.sciencedirect.com/science/journal/03043975 |
| Type: | article (author version) |
| URI: | http://hdl.handle.net/2115/17138 |
| Appears in Collections: | 情報科学院・情報科学研究院 (Graduate School of Information Science and Technology / Faculty of Information Science and Technology) > 雑誌発表論文等 (Peer-reviewed Journal Articles, etc)
|
Submitter: Zeugmann Thomas
|
