CAJ | 학술논문

为降低空间复杂度和减少搜索时间, 结合极小碰集的特点和生物学中蜘蛛捕食思想, 提出了一种搜索极小碰集的蛛网算法。该方法考虑集合之间的相关性, 并构造能在蛛网上寻路的访问蜘蛛用于寻找蛛网内集合的所有极小碰集。在该算法中, 所提出的访问蜘蛛生成和搜索策略能够降低空间复杂度和减少搜索时间。将此算法与其他的极小碰集算法进行比较, 实验结果表明, 该算法在保证得到所有极小碰集的前提下, 具有较低的空间复杂度和较高的时间效率。
위강저공간복잡도화감소수색시간, 결합겁소팽집적특점화생물학중지주포식사상, 제출료일충수색겁소팽집적주망산법。해방법고필집합지간적상관성, 병구조능재주망상심로적방문지주용우심조주망내집합적소유겁소팽집。재해산법중, 소제출적방문지주생성화수색책략능구강저공간복잡도화감소수색시간。장차산법여기타적겁소팽집산법진행비교, 실험결과표명, 해산법재보증득도소유겁소팽집적전제하, 구유교저적공간복잡도화교고적시간효솔。
To reduce space complexity and reduce search time, this paper proposed a cobweb algorithm for search minimum hitting sets, which combined the characteristics of minimum hitting sets and thought on spider prey in biology. It considered this method the correlation between the sets, and structured the visiting spider which could find the path of the cobweb access to find all minimum hitting sets of sets within the cobweb. In the algorithm, the generation of visiting spiders and search strategy could reduce space complexity and reduce search time. Compared with the other algorithms which computing the minimum hitting sets, the results of experiments show that under the premise of guaranteeing to get all minimum hitting sets, the algorithm has lower space complexity and higher efficiency.