Discriminative frequent subgraph mining with optimality guarantees (Q4969732): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q61465943 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: gBoost: a mathematical programming approach to graph classification and regression / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3096108 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding essential attributes from binary data / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Machine Learning: ECML 2004 / rank | |||
Normal rank | |||
Latest revision as of 20:26, 23 July 2024
scientific article; zbMATH DE number 7260252
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Discriminative frequent subgraph mining with optimality guarantees |
scientific article; zbMATH DE number 7260252 |
Statements
Discriminative frequent subgraph mining with optimality guarantees (English)
0 references
14 October 2020
0 references
graph mining
0 references
frequent subgraphs
0 references
submodularity
0 references
feature selection
0 references
nested selection
0 references
