86 search results - page 16 / 18 » Efficient Vertical Mining of Frequent Closures and Generator... |
IADIS
2008
13 years 8 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 ...
SDM
2008
SIAM
13 years 8 months ago
2008
SIAM
Graph data such as chemical compounds and XML documents are getting more common in many application domains. A main difficulty of graph data processing lies in the intrinsic high ...
TKDE
2008
13 years 7 months ago
2008
Although there have been many recent studies on the mining of sequential patterns in a static database and in a database with increasing data, these works, in general, do not fully...
KDD
2004
ACM
14 years 7 months ago
2004
ACM
Many real life sequence databases, such as customer shopping sequences, medical treatment sequences, etc., grow incrementally. It is undesirable to mine sequential patterns from s...
SDM
2004
SIAM
13 years 8 months ago
2004
SIAM
Previous study has shown that mining frequent patterns with length-decreasing support constraint is very helpful in removing some uninteresting patterns based on the observation t...