37 search results - page 5 / 8 » Parallel mining of closed sequential patterns |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
ICWE
2004
Springer
14 years 1 months ago
2004
Springer
Data mining includes four steps: data preparation, pattern mining, and pattern analysis and pattern application. But in web environment, the user activities become much more comple...
ICTAI
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper, we propose a parallel algorithm for mining maximal frequent itemsets from databases. A frequent itemset is maximal if none of its supersets is frequent. The new par...
KDD
1998
ACM
14 years 23 days ago
1998
ACM
Many data mining tasks (e.g., Association Rules, Sequential Patterns) use complex pointer-based data structures (e.g., hash trees) that typically suffer from sub-optimal data loca...
KDD
2007
ACM
14 years 2 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...