A sequential pattern is a sequence of sets of items. Mining sequential patterns from very large datasets is a fundamental problem in data mining. This thesis formally proves the first rigorous and efficiently computable bound on the Rademacher complexity of sequential patterns. This result is then applied to two key tasks: mining frequent sequential patterns from a given dataset using progressive sampling, and mining true frequent sequential patterns from an unknown generative process.
On the use of the Rademacher complexity in mining sequential patterns
Santoro, Diego
2019/2020
Abstract
A sequential pattern is a sequence of sets of items. Mining sequential patterns from very large datasets is a fundamental problem in data mining. This thesis formally proves the first rigorous and efficiently computable bound on the Rademacher complexity of sequential patterns. This result is then applied to two key tasks: mining frequent sequential patterns from a given dataset using progressive sampling, and mining true frequent sequential patterns from an unknown generative process.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
tesi_CD.pdf
accesso aperto
Dimensione
887.59 kB
Formato
Adobe PDF
|
887.59 kB | Adobe PDF | Visualizza/Apri |
The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License
Utilizza questo identificativo per citare o creare un link a questo documento:
https://hdl.handle.net/20.500.12608/28049