106 search results - page 5 / 22 » Finding Interesting Associations without Support Pruning |
SIGMOD
1997
ACM
15 years 2 months ago
1997
ACM
One of the most well-studied problems in data mining is mining for association rules in market basket data. Association rules, whose significance is measured via support and confi...
SIGMOD
1997
ACM
15 years 2 months ago
1997
ACM
One of the important problems in data mining is discovering association rules from databases of transactions where each transaction consists of a set of items. The most time consu...
172
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
104
click to vote
AUSAI
2005
Springer
15 years 3 months ago
2005
Springer
Most data-mining techniques seek a single model that optimizes an objective function with respect to the data. In many real-world applications several models will equally optimize...
105
click to vote
KAIS
2006
14 years 10 months ago
2006
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...