| http://dbpedia.org/ontology/abstract
|
In computer science, frequent subtree mini … In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of occurrences in other subtrees) is over a given threshold. It is a more general form of the maximum agreement subtree problem. of the maximum agreement subtree problem.
|
| http://dbpedia.org/ontology/wikiPageID
|
43040208
|
| http://dbpedia.org/ontology/wikiPageLength
|
11475
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1043696602
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Graph_isomorphism +
, http://dbpedia.org/resource/Subgraph_isomorphism_problem +
, http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory +
, http://dbpedia.org/resource/NP-complete +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Combinatorial_explosion +
, http://dbpedia.org/resource/KEGG +
, http://dbpedia.org/resource/Computational_biology +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Reflist +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Computational_problems_in_graph_theory +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Problem +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Frequent_subtree_mining?oldid=1043696602&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Frequent_subtree_mining +
|
| owl:sameAs |
https://global.dbpedia.org/id/m96k +
, http://www.wikidata.org/entity/Q18207250 +
, http://dbpedia.org/resource/Frequent_subtree_mining +
, http://yago-knowledge.org/resource/Frequent_subtree_mining +
, http://rdf.freebase.com/ns/m.010xdv93 +
|
| rdf:type |
http://dbpedia.org/ontology/Disease +
|
| rdfs:comment |
In computer science, frequent subtree mini … In computer science, frequent subtree mining is the problem of finding all patterns in a given database whose support (a metric related to its number of occurrences in other subtrees) is over a given threshold. It is a more general form of the maximum agreement subtree problem. of the maximum agreement subtree problem.
|
| rdfs:label |
Frequent subtree mining
|
