通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性，证明了其在故障告警域重叠度较小情况下的有效性。
The complexity of GCDG is compared with both exhaustive search algorithm and traditional greedy search algorithm, and then its efficiency is proved in the small alarm overlapped domain.
通过分析对比该算法与完全搜索算法和传统贪心算法的复杂性，证明了其在故障告警域重叠度较小情况下的有效性。
The complexity of GCDG is compared with both exhaustive search algorithm and traditional greedy search algorithm, and then its efficiency is proved in the small alarm overlapped domain.
应用推荐