Thanks Klausen ^ ^. I will check it out.
2014/1/22 Klausen Schaefersinho <[email protected]> > There is even a free version online : > > http://www.liaad.up.pt/area/jgama/DataStreams-CRC.pdf > > > > On Wed, Jan 22, 2014 at 11:02 AM, Klausen Schaefersinho < > [email protected]> wrote: > >> Hi, >> >> you can have a look at "Knowledge Discovery from Data Streams" from Joao >> Gama. It gives a very good and solid introduction to the topic of stream >> mining. >> >> Regards, >> >> Klaus >> >> >> >> On Wed, Jan 22, 2014 at 10:35 AM, Ted Dunning <[email protected]>wrote: >> >>> >>> On Tue, Jan 21, 2014 at 7:31 AM, <[email protected]> wrote: >>> >>>> You mentioned a approximate algorithm. That's great! I will check it >>>> out later. But, Is there a way to calculate it in a precise way? >>> >>> >>> If you want to select the 1% largest numbers, then you have a few >>> choices. >>> >>> If you have memory for the full set, you can sort. >>> >>> If you have room to keep 1% of the samples in memory, you need to do 100 >>> passes. >>> >>> If you are willing to accept small errors, then you can do it in a >>> single pass. >>> >>> These trade-offs are not optional, but are theorems. >>> >>> >>> >> >
