137 search results - page 28 / 28 » Upper Bounds on the Complexity of Some Galois Theory Problem... |
KDD
2007
ACM
14 years 7 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
ALT
1995
Springer
13 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...