Exploiting duality in summarization with deterministic guarantees

Karras, P; Sacharidis, D; Mamoulis, N

dc.contributor.author	Karras, P	en
dc.contributor.author	Sacharidis, D	en
dc.contributor.author	Mamoulis, N	en
dc.date.accessioned	2014-03-01T02:50:58Z
dc.date.available	2014-03-01T02:50:58Z
dc.date.issued	2007	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/35247
dc.subject	Data Mining	en
dc.subject	Dual Problem	en
dc.subject	Space Complexity	en
dc.subject	Time Complexity	en
dc.title	Exploiting duality in summarization with deterministic guarantees	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1145/1281192.1281235	en
heal.identifier.secondary	http://dx.doi.org/10.1145/1281192.1281235	en
heal.publicationDate	2007	en
heal.abstract	Summarization is an important task in data mining. A major chal- lenge over the past years has been the efficient construction of fixed-space synopses that provide a deterministic quality guaran- tee, often expressed in terms of a maximum-error metric. His- tograms and several hierarchical techniques have been proposed for this problem. However, their time and/or space complexities remain impractically high	en
heal.journalName	Knowledge Discovery and Data Mining	en
dc.identifier.doi	10.1145/1281192.1281235	en