An efficient algorithm for mining closed frequent intervals
by Naba Jyoti Sarmah; Anjana Kakoti Mahanta
International Journal of Knowledge Engineering and Data Mining (IJKEDM), Vol. 5, No. 3, 2018

Abstract: In this paper, we propose a method for mining closed frequent intervals from interval dataset. Already known algorithms for mining closed frequent intervals use either the maximal frequent intervals or a tree structure to generate the closed intervals. The algorithm proposed in this paper mines the closed frequent intervals directly from interval datasets. Mathematical proofs of certain properties of closed intervals that are used in the proposed algorithm have been given. The proposed algorithm has been tested with real life and synthetic datasets. Complexity of the proposed algorithm is O(n²), which is better than any other existing algorithms developed for mining closed frequent intervals.

Online publication date: Fri, 14-Sep-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Knowledge Engineering and Data Mining (IJKEDM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com