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 the normal view instead:
scientific article; zbMATH DE number 6931130
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.6813702583312988
0 references
0.6701956987380981
0 references
0.6683760285377502
0 references
0.66692715883255
0 references
0.6579131484031677
0 references
