pith. sign in

arxiv: cs/0410038 · v1 · submitted 2004-10-16 · 💻 cs.DB

Frequent Knot Discovery

classification 💻 cs.DB
keywords frequentknotsdatabaseknotminingobservationappearingapplying
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.