Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

Thomas Zeugmann

doi:10.1023/A:1018964207937

Zeugmann, Thomas

2004-10-15 00:00:00

The present paper deals with the best-case, worst-case and average-case behavior of Lange and Wiehagen's (1991) pattern language learning algorithm with respect to its total learning time. Pattern languages have been introduced by Angluin (1980) and are defined as follows: Let $$\mathcal{A} = \{ 0,1,...\} $$ be any non-empty finite alphabet containing at least two elements. Furthermore, let $$X = \{ x|i \in \mathbb{N}\} $$ be an infinite set of variables such that $$\mathcal{A} \cap X = \emptyset $$ . Patterns are non-empty strings over $$\mathcal{A} \cap X$$ . L(π), the language generated by pattern π, is the set of strings which can be obtained by substituting non-null strings from $$\mathcal{A}^ * $$ for the variables of the pattern π. Lange and Wiehagen's (1991) algorithm learns the class of all pattern languages in the limit from text. We analyze this algorithm with respect to its total learning time behavior, i.e., the overall time taken by the algorithm until convergence. For every pattern π containing k different variables it is shown that the total learning time is $$O(\left| \pi \right|^2 \log _{\left| \mathcal{A} \right|} (\left| \mathcal{A} \right| + k))$$ in the best-case and unbounded in the worst-case. Furthermore, we estimate the expectation of the total learning time. In particular, it is shown that Lange and Wiehagen's algorithm possesses an expected total learning time of $$O(2^k k^2 \left| \pi \right|^2 \log _{\left| \mathcal{A} \right|} (k\left| \mathcal{A} \right|))$$ with respect to the uniform distribution.

http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Annals of Mathematics and Artificial Intelligence Springer Journals

http://www.deepdyve.com/lp/springer-journals/lange-and-wiehagen-s-pattern-language-learning-algorithm-an-average-a9E0Zmj0Nb

$The present paper deals with the best-case, worst-case and average-case behavior of Lange and Wiehagen's (1991) pattern language learning algorithm with respect to its total learning time. Pattern languages have been introduced by Angluin (1980) and are defined as follows: Let $$\mathcal{A} = \{ 0,1,...\} $$ be any non-empty finite alphabet containing at least two elements. Furthermore, let $$X = \{ x|i \in \mathbb{N}\} $$ be an infinite set of variables such that $$\mathcal{A} \cap X = \emptyset $$ . Patterns are non-empty strings over $$\mathcal{A} \cap X$$ . L(π), the language generated by pattern π, is the set of strings which can be obtained by substituting non-null strings from $$\mathcal{A}^ * $$ for the variables of the pattern π. Lange and Wiehagen's (1991) algorithm learns the class of all pattern languages in the limit from text. We analyze this algorithm with respect to its total learning time behavior, i.e., the overall time taken by the algorithm until convergence. For every pattern π containing k different variables it is shown that the total learning time is $$O(\left| \pi \right|^2 \log _{\left| \mathcal{A} \right|} (\left| \mathcal{A} \right| + k))$$ in the best-case and unbounded in the worst-case. Furthermore, we estimate the expectation of the total learning time. In particular, it is shown that Lange and Wiehagen's algorithm possesses an expected total learning time of $$O(2^k k^2 \left| \pi \right|^2 \log _{\left| \mathcal{A} \right|} (k\left| \mathcal{A} \right|))$$ with respect to the uniform distribution.$

References (34)

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time

References (34)

Abstract

Journal

Recommended Articles

There are no references for this article.

Our policy towards the use of cookies