International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 107 - Number 16 |
Year of Publication: 2014 |
Authors: Naba Jyoti Sarmah, Anjana Kakoti Mahanta |
10.5120/18838-0374 |
Naba Jyoti Sarmah, Anjana Kakoti Mahanta . An Efficient Algorithm for Mining Maximal Sparse Interval from Interval Dataset. International Journal of Computer Applications. 107, 16 ( December 2014), 28-32. DOI=10.5120/18838-0374
Many real world data are closely associated with intervals. Mining frequent intervals from such data allows us to group those data depending on some similarity. A few numbers of data mining approaches have been developed to discover frequent intervals from interval datasets. Here we present a complementary approach in which we search for sparse intervals in data. We present an efficient algorithm with a worst case time complexity of O(n log n) for mining maximal sparse intervals.