BibTeX
CSL-JSON
MLA
Harvard
Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining
release_casamhyr5va3rk524nm3gl2nqu
by
Kouzou Ohara, Masahiro Hara, Kiyoto Takabayashi, Hiroshi Motoda, Takashi Washio
Archived Files and Locations
application/pdf 229.7 kB
file_234x4zmrz5ec7grnajvlilyni4
|
www.ar.sanken.osaka-u.ac.jp (web) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
Type
Stage
Year 2009
chapter
Stage
published
Year 2009
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links
oaDOI/unpaywall (OA fulltext)
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar
Crossref Metadata (via API)
Worldcat
SHERPA/RoMEO (journal policies)
wikidata.org
CORE.ac.uk
Semantic Scholar
Google Scholar