Finding the best not the most: regularized loss minimization subgraph selection for graph classification (Q1669622)
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: Finding the best not the most: regularized loss minimization subgraph selection for graph classification |
scientific article; zbMATH DE number 6931130
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the best not the most: regularized loss minimization subgraph selection for graph classification |
scientific article; zbMATH DE number 6931130 |
Statements
Finding the best not the most: regularized loss minimization subgraph selection for graph classification (English)
0 references
3 September 2018
0 references
feature selection
0 references
classification
0 references
graph classification
0 references
sparse learning
0 references
0 references
