摘要
在对Apriori算法和FP-树算法进行分析的基础上,将最新提出的基于双库协同机制的Maradbcm算法与其进行了比较,指出了传统的"支持度-置信度"框架在挖掘算法上的局限性,明确了主观度量与客观度量相结合的必要性。
Based on the analysis of Apriori arithmetic and FP-tree arithmetic, compared them with a new arithmetic named Maradbcm which is based on double-bases conjunction mechanism. Point out the localization of traditional 'support-confidence' frame in mining arithmetic area, confirm the necessity of subjective estimate and objective estimate's combination.
出处
《微机发展》
2003年第4期73-75,共3页
Microcomputer Development
