Indiana University Bloomington

School of Informatics and Computing


Computer Science Program







 Home

 Contacts

 Courses

 Academics

 Careers

 Research

 People

 Calendar

 Resources

 Facilities



Pervasive Technology Labs

Computing Research Association

Association for Computing Machinery

Technical Report TR587:
Mining Frequent Itemsets Over Arbitrary Time Intervals in Data Streams

Chris Giannella, Jiawei Han, Edward Robertson and Chao Liu
Unknown Date, 37 pages
Abstract:
Mining frequent itemsets over a stream of transactions presents difficult new challenges over traditional mining in static transaction databases. Stream transactions can only be looked at once and streams have a much richer frequent itemset structure due to their inherent temporal nature. We examine a novel data structure, an FPstream, for maintaining information about itemset frequency histories. At any time, requests for itemsets frequent over user-defined time intervals can be serviced by scanning the maintained FPstream producing an approximate answer with error guaranteed to be no worse than a user-specified frequency and temporal threshold. We develop an algorithm for constructing and updating an FPstream structure and present experiments illustrating the time and space required for maintenance.

Available as:

There is help available if you want further information about the available file formats and software to display and print these files.

Return to the Technical Report Index








Valid HTML 4.01!