<s>
The	O
lossy	B-General_Concept
count	I-General_Concept
algorithm	I-General_Concept
is	O
an	O
algorithm	O
to	O
identify	O
elements	O
in	O
a	O
data	B-General_Concept
stream	I-General_Concept
whose	O
frequency	O
exceeds	O
a	O
user-given	O
threshold	O
.	O
</s>
<s>
The	O
algorithm	O
works	O
by	O
dividing	O
the	O
data	B-General_Concept
stream	I-General_Concept
into	O
buckets	O
for	O
frequent	O
items	O
,	O
but	O
fill	O
as	O
many	O
buckets	O
as	O
possible	O
in	O
main	O
memory	O
one	O
time	O
.	O
</s>
<s>
It	O
finds	O
applications	O
in	O
computations	O
where	O
data	O
takes	O
the	O
form	O
of	O
a	O
continuous	O
data	B-General_Concept
stream	I-General_Concept
instead	O
of	O
a	O
finite	O
data	B-General_Concept
set	I-General_Concept
,	O
such	O
as	O
network	B-Protocol
traffic	I-Protocol
measurements	I-Protocol
,	O
web	B-Application
server	I-Application
logs	O
,	O
and	O
clickstreams	O
.	O
</s>
<s>
Step	O
1	O
:	O
Divide	O
the	O
incoming	O
data	B-General_Concept
stream	I-General_Concept
into	O
buckets	O
of	O
width	O
,	O
where	O
is	O
mentioned	O
by	O
user	O
as	O
the	O
error	O
bound	O
(	O
along	O
with	O
minimum	O
support	O
threshold	O
=	O
)	O
.	O
</s>
