18 search results - page 1 / 4 » Dagma: Mining Directed Acyclic Graphs |
IADIS
2008
13 years 11 months ago
2008
We present how to efficiently mine a set of directed acyclic graphs (DAGs) for unconnected, both multi- or single-rooted, and induced fragments. With a new canonical form that is ...
WAIM
2004
Springer
14 years 3 months ago
2004
Springer
Data mining extracts implicit, previously unknown and potentially useful information from databases. Many approaches have been proposed to extract information, and one of the most ...
RSFDGRC
2005
Springer
14 years 3 months ago
2005
Springer
In this paper, a new variant of Bagging named DepenBag is proposed. This algorithm obtains bootstrap samples at first. Then, it employs a causal discoverer to induce from each sam...
PVLDB
2010
13 years 4 months ago
2010
The growing demand for large-scale data mining and data analysis applications has led both industry and academia to design new types of highly scalable data-intensive computing pl...
ICDM
2006
IEEE
14 years 4 months ago
2006
IEEE
Kernel methods have been shown to be very effective for applications requiring the modeling of structured objects. However kernels for structures usually are too computational dem...