Material Detail

Exploiting Duality in Summarization with Deterministic Guarantees

Exploiting Duality in Summarization with Deterministic Guarantees

This video was recorded at 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), San Jose 2007. Summarization is an important task in data mining. A major challenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic quality guarantee, often expressed in terms of a maximum-error metric. Histograms and several hierarchical techniques have been proposed for this problem. However, their time and/or space complexities remain impractically high and depend not only on the data set size n, but also on the space budget B. These handicaps stem from a requirement to tabulate all allocations of synopsis space to different regions of the data. In this paper we develop an alternative methodology that dispels these... Show More

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as Exploiting Duality in Summarization with Deterministic Guarantees
Other materials like Exploiting Duality in Summarization with Deterministic Guarantees

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.
hidden