arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0410038cs.DB
收藏

频繁发现结

Frequent Knot Discovery

Floris Geerts

摘要:

我们探讨了将频繁模式挖掘的框架应用于自然界中出现的一类连续对象(即节点)的可能性。我们介绍了频繁节点挖掘问题,并提出了解决方案。关键的观察是,由节点组成的数据库可以转换为事务数据库。这个观察是基于纽结的素分解定理。

英文摘要:

We explore the possibility of applying the framework of frequent pattern mining to a class of continuous objects appearing in nature, namely knots. We introduce the frequent knot mining problem and present a solution. The key observation is that a database consisting of knots can be transformed into a transactional database. This observation is based on the Prime Decomposition Theorem of knots.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑