基于频率的数据采掘问题的约简
Reductions for Frequency-Based Data Mining Problems
摘要:
研究问题的计算复杂性是计算机科学的基本问题之一。然而,令人惊讶的是,在数据采掘的许多核心问题的计算复杂性知之甚少。在本文中,我们研究基于频率的问题,并提出了一种新的类型的减少,使我们能够比较复杂的最大频繁模式挖掘问题在不同的领域(如图或序列)。我们的结果将Kimelfeld和Kolaitis [ACM TODS,2014]的结果扩展到更广泛的数据采掘问题。我们的研究结果表明,通过允许在模式空间中的约束,许多最大频繁模式挖掘问题的复杂性崩溃。这些问题包括标号图中的最大频繁子图、最大频繁项集和最大无重复频繁项集。除了理论上的兴趣,我们的研究结果可能会产生更有效的算法研究的问题。
英文摘要:
Studying the computational complexity of problems is one of the - if not the - fundamental questions in computer science. Yet, surprisingly little is known about the computational complexity of many central problems in data mining. In this paper we study frequency-based problems and propose a new type of reduction that allows us to compare the complexities of the maximal frequent pattern mining problems in different domains (e.g. graphs or sequences). Our results extend those of Kimelfeld and Kolaitis [ACM TODS, 2014] to a broader range of data mining problems. Our results show that, by allowing constraints in the pattern space, the complexities of many maximal frequent pattern mining problems collapse. These problems include maximal frequent subgraphs in labelled graphs, maximal frequent itemsets, and maximal frequent subsequences with no repetitions. In addition to theoretical interest, our results might yield more efficient algorithms for the studied problems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。