偏序集上多维数据中最小罕见元素的求法
On Finding Minimal Infrequent Elements in Multi-dimensional Data Defined over Partially Ordered Sets
摘要:
我们考虑的数据库中,每个属性的值从偏序集(偏序集)。这使得人们可以对不同应用中出现的许多有趣的场景进行建模,包括定量数据库,分类法和每个属性都是代表某个事件随时间发生的持续时间的间隔的数据库。在这种情况下出现的自然问题如下:给定数据库$\mathcal{D}$和阈值$t$,从$\mathcal{D}$中找到少于$t$事务“支持”的属性的“泛化”的所有集合。我们称这种集合为稀有元素。由于单调性,我们可以通过仅考虑\emph{minimal}不频繁元素来减少输出大小。我们研究了一些有趣的偏序集类的所有极小罕见元素的复杂性。我们展示了这个问题如何可以应用到挖掘关联规则在不同类型的数据库,并找到“稀疏区域”或“洞”的定量数据或在数据库中记录的时间间隔,在此期间,一个重新发生的事件随着时间的推移出现。我们的主要重点将放在这些应用程序上,而不是对给定算法的正确性或分析。
英文摘要:
We consider databases in which each attribute takes values from a partially ordered set (poset). This allows one to model a number of interesting scenarios arising in different applications, including quantitative databases, taxonomies, and databases in which each attribute is an interval representing the duration of a certain event occurring over time. A natural problem that arises in such circumstances is the following: given a database $\mathcal{D}$ and a threshold value $t$, find all collections of "generalizations" of attributes which are "supported" by less than $t$ transactions from $\mathcal{D}$. We call such collections infrequent elements. Due to monotonicity, we can reduce the output size by considering only \emph{minimal} infrequent elements. We study the complexity of finding all minimal infrequent elements for some interesting classes of posets. We show how this problem can be applied to mining association rules in different types of databases, and to finding "sparse regions" or "holes" in quantitative data or in databases recording the time intervals during which a re-occurring event appears over time. Our main focus will be on these applications rather than on the correctness or analysis of the given algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。