z-logo
open-access-imgOpen Access
Mining Maximal Sparse Interval
Author(s) -
Naba JyotiSarmah,
Anjana Kakoti Mahanta
Publication year - 2012
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/9281-3472
Subject(s) - computer science , interval (graph theory) , data mining , mathematics , combinatorics
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. General Terms Interval Data Mining, Algorithms.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom