Sciweavers

DATAMINE
2006
230views more  DATAMINE 2006»
14 years 4 days ago
Mining top-K frequent itemsets from data streams
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 ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
IDA
2008
Springer
14 years 5 days ago
Schema matching on streams with accuracy guarantees
Abstract. We address the problem of matching imperfectly documented schemas of data streams and large databases. Instancelevel schema matching algorithms identify likely correspond...
Szymon Jaroszewicz, Lenka Ivantysynova, Tobias Sch...
DC
2008
14 years 6 days ago
Sketching asynchronous data streams over sliding windows
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...
Bojian Xu, Srikanta Tirthapura, Costas Busch
ECOI
2010
117views more  ECOI 2010»
14 years 6 days ago
Ensemble extraction for classification and detection of bird species
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
CORR
2008
Springer
108views Education» more  CORR 2008»
14 years 6 days ago
Linear Processing and Sum Throughput in the Multiuser MIMO Downlink
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 ...
Adam J. Tenenbaum, Raviraj S. Adve
CORR
2008
Springer
127views Education» more  CORR 2008»
14 years 6 days ago
A Very Efficient Scheme for Estimating Entropy of Data Streams Using Compressed Counting
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...
Ping Li
CN
2008
110views more  CN 2008»
14 years 6 days ago
The eternal sunshine of the sketch data structure
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...
ASC
2008
14 years 7 days ago
Dynamic data assigning assessment clustering of streaming data
: 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...
Olga Georgieva, Frank Klawonn
ASC
2008
14 years 7 days ago
Info-fuzzy algorithms for mining dynamic data streams
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...
GRC
2008
IEEE
14 years 8 days ago
MovStream: An Efficient Algorithm for Monitoring Clusters Evolving in Data Streams
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...