4 search results - page 1 / 1 » CMTreeMiner: Mining Both Closed and Maximal Frequent Subtree... |
PAKDD
2004
ACM
13 years 10 months ago
2004
ACM
Abstract. Tree structures are used extensively in domains such as computational biology, pattern recognition, XML databases, computer networks, and so on. One important problem in ...
ML
2010
ACM
13 years 3 months ago
2010
ACM
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There ...
PKDD
2007
Springer
13 years 11 months ago
2007
Springer
Frequent itemset mining assists the data mining practitioner in searching for strongly associated items (and transactions) in large transaction databases. Since the number of frequ...
EDBT
2009
ACM
13 years 12 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...