摘要： 提出了一种双字段互联式数据挖掘新算法，该算法只需在求1－项候选项集和2－项候选项集时，扫描原始数据库DB 各1 次，在求更高层次的频繁项集时，就不需要扫描原始数据库，而只需扫描上一层次的候选频繁闭项集，这样大大缩小了搜索范围，提高了算法执行效率，节约了系统资源。该算法可有效地应用于数据挖掘分析，对于提高金融安全、防范金融风险、销售商品的配置、实现物流系统自动化等有着重要的理论和实际意义。

关键词: 数据挖掘；交叉索引；金融安全；物流

Abstract: A new algorithm about two segments mutual index and linking mining is proposed. The algorithm scans raw database only when mine 1-itemset and 2-itemsets. When mine further level close itemsets, raw database don’t need scan, it only needs to scan last level candidate close itemsets. Thus search field is reduced to a great extent, algorithm run efficiency is promoted, and system resource is economized. This algorithm can be used in data mining analysis. It is of important theory and practical meaning about promoting finance safety, avoiding finance crises, disposing trade goods, and realizing automatization of commodities interflow

Key words: Data mining; Mutual index; Finance safety; Commodities interflow