Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
✍ Scribed by Guillaume Poezevara; Bertrand Cuissart; Bruno Crémilleux
- Publisher
- Springer US
- Year
- 2011
- Tongue
- English
- Weight
- 467 KB
- Volume
- 37
- Category
- Article
- ISSN
- 0925-9902
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Recently, several results bounding above the diameter and/or the mean distance of a graph from its eigenvalues have been presented. They use the eigenvalues of either the adjacency or the Laplacian matrix of the graph. The main object of this paper is to compare both methods. As expected, they are e
Computerized interactive 3-dimensional graphical displays were originally developed to aid in the exploration of multidimensional data from particle physics experiments. This technique can be equally well applied to speed the analysis of multivariate pharmaco-kinetic and pharmacodynamic data. The ap