重复扫描 meaning in Chinese
multiple scannaing
multiple scanning
rescanning
Examples
- The disadvantage of repetitive sweeps is that they take a long time .
重复扫描的缺点在于需要较长的时间。 - ( 7 ) traditional region labeling was not considered because it wastes time and scan frequently the image . but fast edge tracing was improved to trace several edges each time . chain code of the edge was used to calculate perimeter and object area
( 7 )针对区域标记存在速度慢、重复扫描图像等不足，改进了轮廓跟踪算法，使区域标记与轮廓跟踪有机地结合在一起，提高了处理速度，同时改进了面积计算方法，避免了筛选和排序。 - It is a classic frequent set method but it has its inherent defaults : 1 repeated scanning of database increased the i / o times in mining , thus adding to cpu ' s burden and affecting the computing efficiency . 2 cannot analyze the scarce data
Agrawal等在1994年提出了apriori算法，它是一种经典的频集方法，但是apriori算法也存在一些固有的缺陷：多次重复扫描数据库，增加了挖掘过程中i o操作的次数，加重了cpu的负担，影响计算效率。 - Traditional association rules mining is called boolean associaion rules mining . people have done abundant work for them , and have obtained achievements . fuzzy and objective - oriented association rules mining are hot issues . the study on their algorithms has been acquired progress . but most algorithms for them are based on apriori or apriori - like , they exist the problems : repeatedly scan the database and check a large set of candidates by pattern matching . in order to improve mining efficiency , we study algorithm for fuzzy and objective - oriented association rules mining based on fp - tree
传统的关联规则挖掘称为布尔型关联规则挖掘。关于这个问题的研究,人们已经做了大量的工作,取得了不少成果。模糊和面向目标关联规则的挖掘是目前较为热门的研究课题,有关它们的算法研究也取得一定的进展,但其中大部分算法是基于apriori或类apriori算法,因此存在需要多次重复扫描数据库和产生大量候选集的缺陷。 - A new data structure frequent tree is constructed , which stores crucial information of frequent item . and an algorithm of mining frequent itemsets is presented based on the frequent tree , which can avoid repeated databases scans and a huge candidate itemsets generation , and can dramatically reduce the search space
第三章构造了一个新的数据结构频繁树，用以存储频繁项集的重要信息，并给出了基于该频繁树的频繁集的挖掘算法，该方法能够避免重复扫描数据库，避免产生大量的候选集，大大地减少搜索空间。