图 书 馆开课单位--埃因霍温工业大学
1 1/1
1Mining Top-K Frequent Items in a Data Stream with Flexible Sliding Windows[挖掘频繁项的前K在一个灵活的滑动窗口的数据流]
Hoang Thanh Lam(埃因霍温工业大学) We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the propertie...
热度：31
Hoang Thanh Lam(埃因霍温工业大学) We study the problem of finding the k most frequent items in a stream of items for the recently proposed max-frequency measure. Based on the propertie...
热度：31
1 1/1