104 search results - page 14 / 21 » TRIPS and TIDES: new algorithms for tree mining |
PKDD
1999
Springer
13 years 11 months ago
1999
Springer
We describe the problem of mining possibilistic set-valued rules in large relational tables containing categorical attributes taking a finite number of values. An example of such a...
SEKE
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we present a new view on the data preparation in web usage mining. We concentrate on recovering individual usage behaviour from accessing records on web site. We de...
SIGMOD
2000
ACM
13 years 12 months ago
2000
ACM
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
ICDM
2002
IEEE
14 years 13 days ago
2002
IEEE
Mining frequent patterns with an FP-tree avoids costly candidate generation and repeatedly occurrence frequency checking against the support threshold. It therefore achieves bette...
EDBT
2011
ACM
12 years 11 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...