On the discovery of relevant structures in dynamic and heterogeneous data
We are witnessing an explosion of available data coming from a huge amount of sources and domains, which is leading to the creation of datasets larger and larger, as well as richer and richer. Understanding, processing, and extracting useful information from those datasets requires specialized algor...
Main Author: | Preti, Giulia |
---|---|
Other Authors: | Velegrakis, Ioannis |
Format: | Doctoral Thesis |
Language: | English |
Published: |
Università degli studi di Trento
2019
|
Subjects: | |
Online Access: | http://hdl.handle.net/11572/242978 |
Similar Items
-
Efficiently Approximating Top-<inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula> Sequential Patterns in Transactional Graphs
by: Mingtao Lei, et al.
Published: (2019-01-01) -
Multiple Minimum Support-Based Rare Graph Pattern Mining Considering Symmetry Feature-Based Growth Technique and the Differing Importance of Graph Elements
by: Gangin Lee, et al.
Published: (2015-06-01) -
Optimized and Frequent Subgraphs: How Are They Related?
by: Saif Ur Rehman, et al.
Published: (2018-01-01) -
Incremental Mining of High Utility Patterns in One Phase by Absence and Legacy-Based Pruning
by: Junqiang Liu, et al.
Published: (2019-01-01) -
Grasping frequent subgraph mining for bioinformatics applications
by: Aida Mrzic, et al.
Published: (2018-09-01)