关键词: 分段, 支持度, Apriori算法, 群体特征, 数据挖掘

Abstract: Firstly，this paper indicates the localization of single-support Apriori algorithm，and analyzes the imperfection of multiple supports Apriori algorithm that is proposed for overcoming the localization of single-support Apriori algorithm.Aiming at some latent rules of affair，the paper proposes a sub-support Apriori algorithm.It does not simply expand or improve the classical Apriori algorithm.The proposed algorithm destroys Apriori algorithm’s qualities—global and high frequency in theory，and uses the method of sub-support to data mining for the database.It discovers that classical and multiple supports Apriori algorithm are difficult to find the strong relevancy regulation.The proposed algorithm can be realized for a quick speed.

Key words: subsection, support, Apriori algorithm, colony character, data mining