Global Information Lookup Global Information

Frequent subtree mining information


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.[1] It is a more general form of the maximum agreement subtree problem.[2]

  1. ^ Chi, Yun; Muntz, Richard R.; Nijssen, Siegfried; Kok, Joost N. (28 June 2005). "Frequent Subtree Mining - An Overview". Fundamenta Informaticae. 66: 161–198. S2CID 14827585.
  2. ^ Deepak, Akshay; Fernández-Baca, David; Tirthapura, Srikanta; Sanderson, Michael J.; McMahon, Michelle M. (July 2013). "EvoMiner: frequent subtree mining in phylogenetic databases". Knowledge and Information Systems. 41 (3): 559–590. doi:10.1007/s10115-013-0676-0. S2CID 254145982.

and 13 Related for: Frequent subtree mining information

Request time (Page generated in 0.8104 seconds.)

Frequent subtree mining

Last Update:

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...

Word Count : 1837

Frequent pattern discovery

Last Update:

Apriori algorithm. Other strategies include: Frequent subtree mining Structure mining Sequential pattern mining and respective specific techniques. Implementations...

Word Count : 267

Maximum agreement subtree problem

Last Update:

be isomorphic to one another. Frequent subtree mining Amir, A.; Keselman, D. (1997-12-01). "Maximum Agreement Subtree in a Set of Evolutionary Trees:...

Word Count : 374

Subgraph isomorphism problem

Last Update:

extension of subgraph isomorphism known as graph mining is also of interest in that area. Frequent subtree mining Induced subgraph isomorphism problem Maximum...

Word Count : 1847

Association rule learning

Last Update:

each pattern appear frequently in the data. Approximate Frequent Itemset mining is a relaxed version of Frequent Itemset mining that allows some of the...

Word Count : 6704

Structure mining

Last Update:

sophisticated, containing multiple optional subtrees, used for representing special case data. Frequently around 90% of a schema is concerned with the...

Word Count : 698

Distance matrix

Last Update:

information about local high-variation regions that appear across multiple subtrees. Despite potential problems, distance methods are extremely fast, and they...

Word Count : 3983

Binary search algorithm

Last Update:

algorithm either learns that the vertex is the target, or otherwise which subtree the target would be located in. However, this can be further generalized...

Word Count : 9609

Question answering

Last Update:

2014. Perera, R., Nand, P. and Naeem, A. 2017. Utilizing typed dependency subtree patterns for answer sentence generation in question answering systems....

Word Count : 3394

Ternary search tree

Last Update:

tree represents a prefix of the stored strings. All strings in the middle subtree of a node start with that prefix. Inserting a value into a ternary search...

Word Count : 1784

List of RNA structure prediction software

Last Update:

S2CID 692442. Hamada M, Tsuda K, Kudo T, Kin T, Asai K (October 2006). "Mining frequent stem patterns from unaligned RNA sequences". Bioinformatics. 22 (20):...

Word Count : 8423

Flajolet Lecture Prize

Last Update:

communication protocols, complex analysis, computational biology, data mining, databases, graphs, information theory, limit distributions, maps, trees...

Word Count : 1036

Glossary of computer science

Last Update:

(ADT) that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes. type...

Word Count : 23798

PDF Search Engine © AllGlobal.net