There is a close relationship between formal language theory and data compression. Since 1990's various types of grammar-based text compression algorithms have been introduced...
Abstract. Instance retraction is a difficult problem for concept learning by version spaces. This chapter introduces a family of version-space representations called one-sided inst...
Evgueni N. Smirnov, Ida G. Sprinkhuizen-Kuyper, H....
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk denes the union of the languages den...
Abstract. Previous work has shown that modeling relationships between articles of a regulation as vertices of a graph network works twice as better than traditional information ret...
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...