| Presentation | 2003/7/24 On a computation of max frequent set by dualization Ken SATOH, Takeaki UNO, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In this paper, we report an improvement of an algorithm on enumerating maximal frequent sets. We propose a new algorithm which reduces redundancy of the previously proposed algorithm. We analyze our algorithm by query commplexity and space complexity and give an empirical evaluation. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Max frequent set / enumeration / dualization |
| Paper # | AI2003-12 |
| Date of Issue |
| Conference Information | |
| Committee | AI |
|---|---|
| Conference Date | 2003/7/24(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 | Artificial Intelligence and Knowledge-Based Processing (AI) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | On a computation of max frequent set by dualization |
| Sub Title (in English) | |
| Keyword(1) | Max frequent set |
| Keyword(2) | enumeration |
| Keyword(3) | dualization |
| 1st Author's Name | Ken SATOH |
| 1st Author's Affiliation | National Institute of Informatics : Soken-dai() |
| 2nd Author's Name | Takeaki UNO |
| 2nd Author's Affiliation | National Institute of Informatics : Soken-dai |
| Date | 2003/7/24 |
| Paper # | AI2003-12 |
| Volume (vol) | vol.103 |
| Number (no) | 243 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |