119 search results - page 10 / 24 » Mining Closed Gradual Patterns |
KDD
2007
ACM
15 years 10 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...
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...
JISE
2008
14 years 9 months ago
2008
Mining frequent patterns in databases is a fundamental and essential problem in data mining research. A continuity is a kind of causal relationship which describes a definite temp...
106
Voted
EDBT
2011
ACM
14 years 1 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...
108
Voted
ICDM
2002
IEEE
15 years 2 months ago
2002
IEEE
Over the years, a variety of algorithms for finding frequent sequential patterns in very large sequential databases have been developed. The key feature in most of these algorith...