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

Published in Lecture Notes in Computer Science by Springer Berlin Heidelberg.

2009   p50-60

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  chapter
Stage   published
Year   2009
Container Metadata
Not in DOAJ
Not in Keepers Registry
ISSN-L:  0302-9743
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 9e8da57e-329f-462e-85fe-75e6f8804a86
API URL: JSON