106 search results - page 4 / 22 » Finding Interesting Associations without Support Pruning |
183
click to vote
ICDE
2001
IEEE
15 years 11 months ago
2001
IEEE
Data mining has been an area of increasing interests during recent years. The association rule discovery problem in particular has been widely studied. However, there are still so...
EMNLP
2010
14 years 8 months ago
2010
Conventional wisdom dictates that synchronous context-free grammars (SCFGs) must be converted to Chomsky Normal Form (CNF) to ensure cubic time decoding. For arbitrary SCFGs, this...
KDD
2004
ACM
15 years 10 months ago
2004
ACM
This paper introduces support envelopes--a new tool for analyzing association patterns--and illustrates some of their properties, applications, and possible extensions. Specifical...
BDA
2001
14 years 11 months ago
2001
We study the inference on the interesting association rules. Then we define the concept of the representative basis for interesting association rules extracted from a dataset D, a...
FLAIRS
2008
15 years 11 days ago
2008
When applying association mining to real datasets, a major obstacle is that often a huge number of rules are generated even with very reasonable support and confidence. Among thes...