IDSG: a new algorithm for mining frequent sequences A new algorithm of frequent sequence mining, IDSG, is proposed. IDSG finds out the frequent sequences by using association graph among frequent items. The whole process only needs to scan the original database twice and it can decreases the disk I/O efficiently. Compared with other algorithms of the same kind, analysis and experiment results show that IDSG is highly improved.
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Levi, Paul (ed.); Kernbach, Serge (ed.): Symbiotic multi-robot organisms. Reliability, adaptability, evolution. (2010)
- Ma, Chuanxiang; Song, Jianhua: IDSG: a new algorithm for mining frequent sequences (2008)