A New Method to Find Top K Items in Data Streams at Arbitrary Time Granularities

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Conference on Computer Science and Software Engineering

• Publication date

  Unknown publication date

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/CSSE.2008.973
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Approximate Frequency Counts over Data Streams

  2012cited by this paper
• Finding frequent items in data streams

  2008cited by this paper
• Mining Frequent Closed Patterns from a Sliding Window over Data Streams

  2006cited by this paper
• A Sliding Window Method for Finding Recently Frequent Itemsets over Online Data Streams

  2004cited by this paper
• An Efficient Algorithm for Mining Frequent Itemests over the Entire History of Data Streams

  2004cited by this paper
• Finding frequent items in data streams

  2002cited by this paper
• Human behavior and the principle of least effort

  1949cited by this paper

• Mining discriminative items in multiple data streams

  2010cites this paper
• MINING DISCRIMINATIVE ITEMS IN MULTIPLE DATA STREAMS

  2009cites this paper