317 search results - page 46 / 64 » A hybrid approach to mining frequent sequential patterns |
51
Voted
ENTCS
2008
14 years 9 months ago
2008
We present a Hoare-style specification and verification approach for invariants in sequential OO programs. It allows invariants over nonhierarchical object structures, in which upd...
PAKDD
2004
ACM
15 years 3 months ago
2004
ACM
In many real world applications, systematic analysis of rare events, such as credit card frauds and adverse drug reactions, is very important. Their low occurrence rate in large da...
112
click to vote
ICML
2007
IEEE
15 years 10 months ago
2007
IEEE
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 ...
102
click to vote
KDD
2007
ACM
15 years 3 months ago
2007
ACM
The support-confidence framework is the most common measure used in itemset mining algorithms, for its antimonotonicity that effectively simplifies the search lattice. This com...
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
In the past, quite a few fast algorithms have been developed to mine frequent patterns over graph data, with the large spectrum covering many variants of the problem. However, the...