摘要
本文提出一种基于兴趣集和权的算法(IWA),由用户提出他们感兴趣的项目并在数据库中找出与之相关的项目,通过给每个项目赋以不同权值来标识项目不同的重要性,从而可以挖掘出Apriori算法挖不出但却极具价值的规则。
In this paper, we proposes a new algorithm based on the interestset and the weight of item (IWA). The Interested item is proposed by user who concerns of it. Then, correlative item are search from database. We offer each item a different weight value so that it can represent the importance of individual items from database. In this way we can get very valuable rules that Apriori can' t.
出处
《电脑与电信》
2008年第9期60-62,共3页
Computer & Telecommunication