All In on Real-time: Hokusai adds a temporal component to Count-Min SketchIntroduced in 2003 by Cormode and Muthukrishnan, the Count-Min sketch is a popular and simple algorithm for summarizing 1 data streams. In...
Streaming Data Mining
Streaming Data Mining Edo Liberty 1 Jelani Nelson2 1 Yahoo! Research, edo.liberty@ymail.com. 2 Princeton University, minilek@seas.harvard.edu. Edo Liberty , Jelani Nelson : Streaming Data Mining 1 / 111 The need for Streaming Data Mining Standard Interface between data and mining algorithms Edo Liberty , Jelani Nelson : Streaming Data Mining 2 / 111 The need for Streaming Data Mining We have a lot
MassDAL Code Bank -- Sketches, Frequent Items, Changes
MassDAL Public Code Bank : Sketches, Frequent Items, Changes (Deltoids) This page is a library of routines in C and Java for data streaming and other massive data set analysis. Currently, these are derived from internal testing routines ("proof of concept" implementations), and so are distributed with no guarantees. In particular, there is relatively little error checking (parameters in range, mem
Sketching data structures — LK blog
“Sketching” data structures store a summary of a data set in situations where the whole data would be prohibitively costly to store (at least in a fast-access place like the memory as opposed to the hard disk). Variants of trees, hash tables, etc. are not sketching structures, they just facilitate access to the data, but they still store the data itself. However, the concept of hashing is closely
Count-Min Sketch のライブラリを公開しました
2012-02-17 Count-Min Sketch のライブラリを公開しました written by Susumu Yata. はじめに 先日 groonga プロジェクトでの利用を目的として開発しているライブラリ Madoka を公開しました．Madoka は Count-Min Sketch という手法をライブラリ化したものであり，文書集合に含まれるキーワードの頻度を求める，クエリの頻度を求める，などの用途に使うことができます． s-yata/madoka - GitHub Documentation - Madoka ライブラリの使い方についてはドキュメントに書いてあるので，こちらは Count-Min Sketch と Madoka の特徴をまとめた内容になっています． Count-Min Sketch 頻度を求めることが目的であれば，ハッシュ表による連想配列を使うのが，おそら
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
FAST LARGE-SCALE APPROXIMATE GRAPH CONSTRUCTION FOR NLP
Approximate Scalable Bounded Space Sketch for Large Data NLP
Count-Min Sketch
Count-Min Sketch –