On approximation algorithms for data mining applications

Afrati, FN

dc.contributor.author	Afrati, FN	en
dc.date.accessioned	2014-03-01T01:24:46Z
dc.date.available	2014-03-01T01:24:46Z
dc.date.issued	2006	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17427
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-36849035399&partnerID=40&md5=c1af72da5f7bfd87399688c16f9a367e	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	Approximation algorithms	en
dc.subject.other	Computer science	en
dc.subject.other	Data storage equipment	en
dc.subject.other	Computer science research	en
dc.subject.other	Main memory	en
dc.subject.other	Data mining	en
dc.title	On approximation algorithms for data mining applications	en
heal.type	journalArticle	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	We aim to present current trends in the theoretical computer science research on topics which have applications in data mining. We briefly describe data mining tasks in various application contexts. We give an overview of some of the questions and algorithmic issues that are of concern when mining huge amounts of data that do not fit in main memory. © Springer-Verlag Berlin Heidelberg 2006.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.isi	ISI:000235661300001	en
dc.identifier.volume	3484 LNCS	en
dc.identifier.spage	1	en
dc.identifier.epage	29	en