Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Abstract. We address the problem of matching imperfectly documented schemas of data streams and large databases. Instancelevel schema matching algorithms identify likely correspond...
We study the problem of maintaining a sketch of recent elements of a data stream. Motivated by applications involving network data, we consider streams that are asynchronous, in wh...
Advances in technology have enabled new approaches for sensing the environment and collecting data about the world. Once collected, sensor readings can be assembled into data stre...
Eric P. Kasten, Philip K. McKinley, Stuart H. Gage
We consider linear precoding and decoding in the downlink of a multiuser multiple-input, multipleoutput (MIMO) system, wherein each user may receive more than one data stream. We ...
Compressed Counting (CC) was recently proposed for approximating the th frequency moments of data streams, for 0 < 2. Under the relaxed strict-Turnstile model, CC dramaticall...
In the past years there has been significant research on developing compact data structures for summarizing large data streams. A family of such data structures is the so-called s...
Xenofontas A. Dimitropoulos, Marc Ph. Stoecklin, P...
: Discovering interesting patterns or substructures in data streams is an important challenge in data mining. Clustering algorithms are very often applied to identify single substr...
Most data mining algorithms assume static behavior of the incoming data. In the real world, the situation is different and most continuously collected data streams are generated by...
Lior Cohen, Gil Avrahami, Mark Last, Abraham Kande...
Monitoring cluster evolution in data streams is a major research topic in data streams mining. Previous clustering methods for evolving data streams focus on global clustering res...
Liang Tang, Chang-jie Tang, Lei Duan, Chuan Li, Ye...