97 search results - page 12 / 20 » Frequent free tree discovery in graph data |
CINQ
2004
Springer
14 years 26 days ago
2004
Springer
Frequent Pattern Mining (FPM) is a very powerful paradigm for mining informative and useful patterns in massive, complex datasets. In this paper we propose the Data Mining Templat...
ICTAI
2007
IEEE
14 years 1 months ago
2007
IEEE
The classification of graph based objects is an important challenge from a knowledge discovery standpoint and has attracted considerable attention recently. In this paper, we pres...
SIGMOD
2010
ACM
14 years 8 days ago
2010
ACM
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
KDD
2007
ACM
14 years 7 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
ICDM
2003
IEEE
14 years 23 days ago
2003
IEEE
The Markov Blanket of a target variable is the minimum conditioning set of variables that makes the target independent of all other variables. Markov Blankets inform feature selec...