165 search results - page 14 / 33 » Discovering Frequent Closed Itemsets for Association Rules |
TCS
2008
13 years 7 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
WISE
2002
Springer
14 years 16 days ago
2002
Springer
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
PAKDD
2004
ACM
14 years 1 months ago
2004
ACM
Although the task of mining association rules has received considerable attention in the literature, algorithms to find time association rules are often inadequate, by either miss...
KDD
2008
ACM
14 years 8 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...