Efficient algorithms for discovering frequent and maximal substructures from large semistructured data (Q4932736)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient algorithms for discovering frequent and maximal substructures from large semistructured data |
scientific article; zbMATH DE number 5796665
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms for discovering frequent and maximal substructures from large semistructured data |
scientific article; zbMATH DE number 5796665 |
Statements
Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (English)
0 references
6 October 2010
0 references
pattern mining
0 references
rightmost expansion
0 references
PPC-extension
0 references
0 references
0.8021572232246399
0 references
