Improving Frequent Subgraph Mining in the Presence of Symmetry.

/in , , /by
Improving Frequent Subgraph Mining in the Presence of Symmetry.

Desrosiers, Christian and Galinier, Philippe and Hansen, Pierre and Hertz, Alain

Mlg 2007

Abstract : While recent algorithms for mining the frequent subgraphs of a database are efficient in the general case, these algorithms tend to do poorly on databases that have a few or no labels. Although little attention has been given to such datasets, there are many existing łdots

You might also like
Classification of cancerous cells based on the one-class problem approach
Improving automatic music genre classification with hybrid content-based feature vectors
Semi-Weakly Supervised Object Detection by Sampling Pseudo Ground-Truth Boxes
Intrapersonal Parameter Optimization for Offline Handwritten Signature Augmentation
Method and system for rate-constrained search ordering
F-CAM: Full resolution class activation maps via guided parametric upscaling
Spine image fusion via graph cuts
On the interaction between deep detectors and siamese trackers in video surveillance