Name
Abstract | ||
|---|---|---|
In this paper, we study a learning procedure from positive data for bounded unions of certain class of languages. Our key tools are the notion of characteristic sets and hypergraphs. We generate hypergraphs from given positive data and exploit them in order to find characteristic sets. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-88009-7_8 | ICGI |
Keywords | Field | DocType |
noetherian closed set systems,characteristic set,learning bounded unions,bounded union,key tool,via characteristic sets,certain class,positive data | Discrete mathematics,Computer science,Noetherian,Constraint graph,Closed set,Exploit,Bounded function | Conference |
Volume | ISSN | Citations |
5278 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 10 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuuichi Kameda | 1 | 1 | 0.36 |
| Hiroo Tokunaga | 2 | 13 | 2.07 |
| Akihiro Yamamoto | 3 | 135 | 26.84 |