后缀与 meaning in English
ful
Examples
- Therefore , this thesis introduces a new frequent - pattern ( fp ) growth algorithm that does not need to produce the candidate item sets . this algorithm compresses information in database to the fp - tree , then produces frequent pattern by joining suffix with prefix , consequently avoids scanning the database many times , and lowers the time expense
因此，文中引入了一种不需要产生候选项的频繁模式增长算法，将数据库的事务的信息压缩到fp一树，然后通过后缀与前缀连接产生频繁模式，从而避免了多次扫描数据库，降低了时间开销。