Frequent Knot Discovery
Databases
2007-05-23 v1
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.
Cite
@article{arxiv.cs/0410038,
title = {Frequent Knot Discovery},
author = {Floris Geerts},
journal= {arXiv preprint arXiv:cs/0410038},
year = {2007}
}
Comments
7 pages, 2 figures, recreational data mining