Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/pkaw/OharaHTMW08
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/pkaw/OharaHTMW08
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Motoda
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kiyoto_Takabayashi
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Kouzou_Ohara
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Masahiro_Hara
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Takashi_Washio
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2F978-3-642-01715-5%5F5
>
foaf:
homepage
<
https://doi.org/10.1007/978-3-642-01715-5_5
>
dc:
identifier
DBLP conf/pkaw/OharaHTMW08
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2F978-3-642-01715-5%5F5
(xsd:string)
dcterms:
issued
2008
(xsd:gYear)
rdfs:
label
Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hiroshi_Motoda
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kiyoto_Takabayashi
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Kouzou_Ohara
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Masahiro_Hara
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Takashi_Washio
>
swrc:
pages
50-60
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/pkaw/2008
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/pkaw/OharaHTMW08/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/pkaw/OharaHTMW08
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/pkaw/pkaw2008.html#OharaHTMW08
>
rdfs:
seeAlso
<
https://doi.org/10.1007/978-3-642-01715-5_5
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/pkaw
>
dc:
subject
Graph mining; information gain; discriminative subgraph; data mining
(xsd:string)
dc:
title
Pruning Strategies Based on the Upper Bound of Information Gain for Discriminative Subgraph Mining.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document