We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
Reseach Article

An Efficient Algorithm for Mining Maximal Sparse Interval from Interval Dataset

by Naba Jyoti Sarmah, Anjana Kakoti Mahanta
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

@article{ 10.5120/18838-0374,
author = { Naba Jyoti Sarmah, Anjana Kakoti Mahanta },
title = { An Efficient Algorithm for Mining Maximal Sparse Interval from Interval Dataset },
journal = { International Journal of Computer Applications },
issue_date = { December 2014 },
volume = { 107 },
number = { 16 },
month = { December },
year = { 2014 },
issn = { 0975-8887 },
pages = { 28-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume107/number16/18838-0374/ },
doi = { 10.5120/18838-0374 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:41:15.470360+05:30
%A Naba Jyoti Sarmah
%A Anjana Kakoti Mahanta
%T An Efficient Algorithm for Mining Maximal Sparse Interval from Interval Dataset
%J International Journal of Computer Applications
%@ 0975-8887
%V 107
%N 16
%P 28-32
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. Rakesh Agrawal, Ramakrishnan Srikant, "Mining Sequential Patterns", Proceedings of the Eleventh International Conference on Data Engineering, p. 3-14 March 06-10, 1995.
  2. Rakesh Agrawal, Ramakrishnan Srikant, "Fast Algorithm for Mining Association Rules", Proceedings of the 20th VLDB conference, Santiago, Chile, 1994.
  3. L. Troiano, G. Scibelli, C. Birtolo, "A Fast Algorithm for Mining Rare Itemsets" Ninth International Conference onIntelligent Systems Design and Applications, 2009.
  4. L. Szathmary, A. Napoli, P. Valtchev, "Towards Rare Itemset Mining", 19th IEEE International Conference on Tools with Artificial Intelligence, 2007.
  5. A. K. Mahanta, N. H. Son, "Mining Interesting Periodicities of Temporal Patterns" Proceedings of IPMU'08, p. 1757- 1764, June 22-27, 2008.
  6. A. K. Mahanta, F. A. Mazarbhuya, H. K. Baruah, "Finding calendar-based periodic patterns" Pattern Recognition Letters, p. 1274-1284, Vol 29 Issue 9, July 2008.
  7. J. F. Alen, "Maintaining Knowledge about Temporal Intervals" Communications of the ACM, Vol 26, Nov 1983.
  8. Po-shan Kam, Ada Wai-chee Fu, "Discovering Temporal Patterns for Interval-based Events" Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery, p. 317- 326, 2000.
  9. Shin-Yi Wu, Yen-Liang Chen, "Mining Nonambiguous Temporal Patterns for Interval-Based Events" IEEE Transactions on Knowledge and Data Engineering, Vol 19 No 6, June 2007.
  10. J. Lin, "Mining Maximal Frequent Intervals", Proceedings of 2003 ACM symposium on Applied Computing, p. 426-431, ACM, New York, 2003.
  11. M. Dutta, A. K. Mahanta, " An Efficient Method for Construction of I-tree", Proceedings of National Workshop on Design and Analysis of Algorithm(NWDA)2010.
  12. M Dutta, "Development of Efficient Algorithms for Some Problems in Interval Data Mining" Ph D Dissertation, Gauhati University, 2012
  13. Khaled M. Elbassioni, "Finding All Minimal Infrequent Multi-dimensional Intervals", Proceedings of the 7th Latin American conference on Theoretical Informatics, p. 423- 434, 2006.
  14. D. I. Mazumdar, D. K. Bhattacharyya, M. Dutta, "Mining Minimal Infrequent Intervals", Journal of Computer Science and Engineering, communicated.
  15. N. J. Sarmah and A. K. Mahanta. Article: Mining Maximal Sparse Interval. International Journal of Computer Applications 58(5):31-34, November 2012. Published by Foundation of Computer Science, New York, USA
Index Terms

Computer Science
Information Sciences

Keywords

Interval Data Sparse Interval Maximal Sparse Interval.