Accès à distance ? S'identifier sur le proxy UCLouvain
Efficient discovery of frequent unordered trees
Primary tabs
- Open access
- 152.73 K
Nijssen, Siegfried
[UCL]
Kok, Joost
[Universiteit Leiden]
Kok, Joost
[Universiteit Leiden]
| Document type | Communication à un colloque (Conference Paper) |
|---|---|
| Access type | Accès libre |
| Publication date | 2003 |
| Language | Anglais |
| Conference | "First international workshop on mining graphs, trees and sequences", Cavtat, Croatia |
| Peer reviewed | yes |
| Host document | "MGTS'03 Proceedings of the first international workshop on mining graphs, trees and sequences" |
| Publication status | Publié |
| Affiliation | UCL - SST/ICTM/INGI - Pôle en ingénierie informatique |
| Links |
| Bibliographic reference | Nijssen, Siegfried ; Kok, Joost. Efficient discovery of frequent unordered trees.First international workshop on mining graphs, trees and sequences (Cavtat, Croatia). In: MGTS'03 Proceedings of the first international workshop on mining graphs, trees and sequences, 2003 |
|---|---|
| Permanent URL | http://hdl.handle.net/2078.1/186570 |