Both item association and user association can be used to recommend for the current user in Rule-based recommendation.
基于规则的推荐技术在数据集上挖掘项目关联和用户关联为当前用户做推荐。
This section covers some additional ways to make the association between a work item and a change set.
本部分将介绍一些在工作项和更改集之间建立关联的附加方法。
Introduce the item weights to traditional association rules mining is the expansion in the project properties.
将项目权值引入传统关联规则挖掘中是在项目属性上的扩展。
This method conquers the disadvantage of traditional association rules mining methods, mining rules while mining frequent-item set, so the mining efficiency is greatly enhanced.
该方法克服了传统关联规则挖掘方法的不足，在产生频繁项集的同时进行规则挖掘，从而提高了挖掘效率。
According to the value of consult, association rules were classified into positive, negative and invalid association rules. The new algorithm could find out the negative-item-contained rules.
利用参考度将关联规则分为正关联规则、负关联规则和无效关联规则，从而可以用算法挖掘带有负项的关联规则。
It matched user's active access sequence with frequent item sets made by association rules in real time and offered different resources to different users.
其利用关联规则得到的频繁项集实时地匹配用户的当前访问序列，对不同的用户提供不同的推荐资源。
This paper presents a new algorithm for distributed mining association rules with item constraints called DAMICFP, which is based on a new type algorithm for association rule mining, FP-growth.
在分布式环境中挖掘约束性关联规则是当前研究的热点问题之一。
A series of correlation item set is obtained by analysing dynamic association rule so as to provide assistance and support for making decision.
利用时态关联规则的分析，可以得到一系列相关性的项目集合，从而为决策提供更加有利的帮助和支持。
Discovering the frequent set of item sequences in a transaction database is one of the most important tasks in mining association rules.
最大频繁项目序列集的生成是影响关联规则挖掘的关键问题，传统的算法是通过对事务数据库的多次扫描实现的。
You may have worked on a particular work item when you make a code change and you can set that association from within the source-control check-in window when you are finished working on the code.
您在变更特定程序码时可能处理了某特定工作项目，完成程序码变更后，您可以从原始档控制签入视窗内设定该关联。
To meet more extensive mining demand, this paper presents another immune association rule mining method, which aimes at the largest frequent item set.
针对更一般的挖掘需求，提出一种以最大频繁项目集为目标的免疫挖掘算法。
Discovering frequent item sets is the main way of association rules mining, and it is also the focus of the study in algorithms for association rules mining.
发现频繁项集是关联规则挖掘的主要途径，也是关联规则挖掘算法研究的重点。
Matching objects in the item set based on downward closure lemma and spatiotemporal topology: we match the objects in order to create the spatiotemporal association candidate set;
基于向下闭合引理，对时空频繁状态表中的对象进行时空拓扑匹配，得到时空关联规则候选集；
Matching objects in the item set based on downward closure lemma and spatiotemporal topology: we match the objects in order to create the spatiotemporal association candidate set;
基于向下闭合引理，对时空频繁状态表中的对象进行时空拓扑匹配，得到时空关联规则候选集；
应用推荐