算法只需对事务数据库做一次扫描，并且所有对事务的处理操作都在事务数据库映射成的倒排文件中进行。
The algorithm only need scan the transaction database once, and all the transaction operations are carried out on the inverted file mapped from transaction database.
该算法将自适应取阈方法和连通分量分析方法集成于一次图像扫描处理中实现。
The hybrid algorithm integrates adaptive thresholding and connected-components analysis into one pass of image processing.
MFP算法能在一次扫描事务数据库过程中，把该数据库转换成MFP树，然后对MFP树进行关联规则挖掘。
The MFP algorithm can convert a transaction database into a MFP tree through scanning the database only once, and then do the mining of the tree.
用GMK算法只需要扫描一次数据库，并且可以快速减小计算量，实现简单。
GMK only scans the database once, thus it can reduce the quantity of calculation rapidly and can be realized easily.
并在此基础上提出了基于栈结构的支持度计算算法，该算法仅对数据库进行一次扫描，即可实现候选序列的计数操作。
Then it presents a support computing algorithm based on stack structure, which can count the candidate sequences by scanning the database only once.
研究表明，该方法不仅算法简单、只需扫描一次数据库，而且还具有动态剪枝、不保存中间候选项和节省大量内存空间等优点。
Studies show that the method is not only simple that needs to scan the database only once, but also has the virtues such as dynamic pruning, without saving mid items and save lots of memories.
该算法只需经过一次扫描图像，就能快速、准确地标记连通区域。
The proposed algorithm can complete the labeling with only one time of scanning and the comparative experiments with traditional algorithms show that it is more efficient and occupies less memory.
文中提出一种矩阵算法，即在一次扫描数据库时，根据扫描数据建立由0和1组成的事务矩阵。
The paper presents an algorithm of matrix, that is, in a scan database, in accordance with scan data to establish the matrix of affairs which are composition of 0 and 1.
文中提出一种矩阵算法，即在一次扫描数据库时，根据扫描数据建立由0和1组成的事务矩阵。
The paper presents an algorithm of matrix, that is, in a scan database, in accordance with scan data to establish the matrix of affairs which are composition of 0 and 1.
应用推荐