| Presentation | 1995/9/22 Polynomial Time Algorithm for Testing Self-Duality and its Applications to Learning Carlos Domingo, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | We show that the self-duality of a formula represented by a o(logn)-depth decision tree with linear operations or by a sat-j o(logn)-DNF can be tested in polynomial time. From this result, we derive an exact learning algorithm of monotone decision trees with linear operations using membership queries. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | self-dual functions / decision trees / query learning |
| Paper # | COMP95-41 |
| Date of Issue |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 1995/9/22(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Theoretical Foundations of Computing (COMP) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Polynomial Time Algorithm for Testing Self-Duality and its Applications to Learning |
| Sub Title (in English) | |
| Keyword(1) | self-dual functions |
| Keyword(2) | decision trees |
| Keyword(3) | query learning |
| 1st Author's Name | Carlos Domingo |
| 1st Author's Affiliation | Department of Computer Science, Tokyo Institute of Technology() |
| Date | 1995/9/22 |
| Paper # | COMP95-41 |
| Volume (vol) | vol.95 |
| Number (no) | 259 |
| Page | pp.pp.- |
| #Pages | 8 |
| Date of Issue | |