摘要
给出解决海量数据库序列模式的挖掘问题的算法.首先采用分布式概念格的思想对数据进行划分,根据子全概念生成相应的子形式背景,选择最优的算法对子形式背景上建格(即子格),所有子格建好后,再对子格进行序列模式的挖掘,合并后得到整个数据库的序列模式.
An efficient algorithm for mining sequential devided into many sub-databases via using Distributed into sub - contexts. Choose the best algorithm to make of sub-concepts. At last, the total databases sequential patterns is presented in large database Data is Concept Lattice Sub-databases which are made the sub-concepts by mining sequential patterns patterns occur through combining them.
出处
《合肥学院学报(自然科学版)》
2007年第4期35-40,共6页
Journal of Hefei University :Natural Sciences
关键词
分布式
概念格
序列模式
distributed
concept lattice
sequential patterns