Random Articles
Reseach Article
Mining Maximal Sparse Interval
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 58 - Number 5 |
| Year of Publication: 2012 |
| Authors: Naba Jyoti Sarmah, Anjana Kakoti Mahanta |
10.5120/9281-3472
|
Naba Jyoti Sarmah, Anjana Kakoti Mahanta . Mining Maximal Sparse Interval. International Journal of Computer Applications. 58, 5 ( November 2012), 31-34. DOI=10.5120/9281-3472
Abstract
Intervals are found in many real life applications such as web uses; stock market information; patient disease records; records maintained for occurrences of events, either man made or natural etc. Mining frequent intervals from such data allow us to group the transactions with similar behavior. Similar to frequent intervals, mining sparse intervals are also important. In this paper we define the notion of sparse and maximal sparse interval and also propose an algorithm for mining maximal sparse intervals. Computer programs were written and experimented on real life data set and results obtained have been reported. The correctness of the algorithm has also been proved.
References
- Rakesh Agrawal, Ramakrishnan Srikant, "Fast Algorithm for Mining Association Rules", Proceedings of the 20th VLDB conference, Santiago, Chile, 1994.
- Rakesh Agrawal, Ramakrishnan Srikant, "Mining Sequential Patterns", Proceedings of the Eleventh International Conference on Data Engineering, p. 3-14 March 06-10, 1995.
- A. K. Mahanta, N. H. Son, "Mining Interesting Periodicities of Temporal Patterns" Proceedings of IPMU'08, p. 1757-1764, June 22-27, 2008.
- 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.
- J. F. Alen, "Maintaining Knowledge about Temporal Intervals" Communications of the ACM, Vol 26, Nov 1983.
- Jun-Lin Lin, "Mining Maximal Frequent Intervals", Proceedings of 2003 ACM symposium on Applied Computing, p. 426-431, ACM, New York(2003).
- Khaled M. Elbassioni, "Finding All Minimal Infrequent Multi-dimensional Intervals", Proceedings of the 7th Latin American conference on Theoretical Informatics, p. 423-434, 2006.
- 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.
- 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.
- 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.
- D. I. Mazumdar, D. K. Bhattacharyya, M. Dutta, "Mining Minimal Infrequent Intervals", Journal of Computer Science and Engineering, communicated.
Index Terms
Keywords