期刊
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
卷 21, 期 7, 页码 985-998出版社
IEEE COMPUTER SOC
DOI: 10.1109/TKDE.2008.229
关键词
Frequent itemsets; uncertainty processing; Dempster-Shafer theory
类别
资金
- US National Science Foundation (NSF) [IIS-0513702]
Existing research in association mining has focused mainly on how to expedite the search for frequently co-occurring groups of items in shopping cart type of transactions; less attention has been paid to methods that exploit these frequent itemsets for prediction purposes. This paper contributes to the latter task by proposing a technique that uses partial information about the contents of a shopping cart for the prediction of what else the customer is likely to buy. Using the recently proposed data structure of itemset trees (IT-trees), we obtain, in a computationally efficient manner, all rules whose antecedents contain at least one item from the incomplete shopping cart. Then, we combine these rules by uncertainty processing techniques, including the classical Bayesian decision theory and a new algorithm based on the Dempster-Shafer (DS) theory of evidence combination.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据