| http://dbpedia.org/ontology/abstract
|
The lossy count algorithm is an algorithm … The lossy count algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold. The algorithm works by dividing the Data Stream into ‘Buckets’ as for frequent items, but fill as many buckets as possible in main memory one time. The frequency computed by this algorithm is not always accurate, but has an error threshold that can be specified by the user. The run time space required by the algorithm is inversely proportional to the specified error threshold, hence larger the error, the smaller the footprint. It was created by eminent computer scientists Rajeev Motwani and Gurmeet Singh Manku. This algorithm finds huge application in computations where data takes the form of a continuous data stream instead of a finite data set, for e.g. network traffic measurements, web server logs, clickstreams.asurements, web server logs, clickstreams.
|
| http://dbpedia.org/ontology/wikiPageID
|
42326508
|
| http://dbpedia.org/ontology/wikiPageLength
|
2049
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1016426341
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Data_set +
, http://dbpedia.org/resource/Category:Streaming_algorithms +
, http://dbpedia.org/resource/Frequency +
, http://dbpedia.org/resource/Algorithm +
, http://dbpedia.org/resource/Rajeev_Motwani +
, http://dbpedia.org/resource/Data_stream +
, http://dbpedia.org/resource/Clickstream +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Cite_journal +
, http://dbpedia.org/resource/Template:Refend +
, http://dbpedia.org/resource/Template:Refbegin +
, http://dbpedia.org/resource/Template:Cs-stub +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Streaming_algorithms +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Algorithm +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Lossy_Count_Algorithm?oldid=1016426341&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Lossy_Count_Algorithm +
|
| owl:sameAs |
http://yago-knowledge.org/resource/Lossy_Count_Algorithm +
, http://rdf.freebase.com/ns/m.01026vww +
, https://global.dbpedia.org/id/fMp6 +
, http://www.wikidata.org/entity/Q17092314 +
, http://dbpedia.org/resource/Lossy_Count_Algorithm +
|
| rdf:type |
http://dbpedia.org/class/yago/Activity100407535 +
, http://dbpedia.org/class/yago/Event100029378 +
, http://dbpedia.org/class/yago/Algorithm105847438 +
, http://dbpedia.org/class/yago/WikicatAlgorithms +
, http://dbpedia.org/class/yago/Procedure101023820 +
, http://dbpedia.org/class/yago/Rule105846932 +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/ontology/Software +
, http://dbpedia.org/class/yago/YagoPermanentlyLocatedEntity +
, http://dbpedia.org/class/yago/PsychologicalFeature100023100 +
, http://dbpedia.org/class/yago/Act100030358 +
|
| rdfs:comment |
The lossy count algorithm is an algorithm … The lossy count algorithm is an algorithm to identify elements in a data stream whose frequency count exceed a user-given threshold. The algorithm works by dividing the Data Stream into ‘Buckets’ as for frequent items, but fill as many buckets as possible in main memory one time. The frequency computed by this algorithm is not always accurate, but has an error threshold that can be specified by the user. The run time space required by the algorithm is inversely proportional to the specified error threshold, hence larger the error, the smaller the footprint.rger the error, the smaller the footprint.
|
| rdfs:label |
Lossy Count Algorithm
|
