Distributed Pattern Discovery in Multiple Streams
Given m groups of streams which consist of n 1,...,n m co-evolving streams in each group, we want to: (i) incrementally find local patterns within a single group, (ii) efficiently obtain global patterns across groups, and more importantly, (iii) efficiently do that in real time while limiting shared information across groups. In this paper, we present a distributed, hierarchical algorithm addressing these problems. Our experimental case study confirms that the proposed method can perform hierarchical correlation detection efficiently and effectively.
KeywordsLocal Pattern Reconstruction Error Independent Component Analysis Global Pattern Multiple Stream
Unable to display preview. Download preview PDF.
- 2.Babcock, B., Olston, C.: Distributed Top-K Monitoring. In: SIGMOD (2003)Google Scholar
- 3.Cheung, D.W., Ng, V.T., Fu, A.W., Fu, Y.: Efficient Mining of Association Rules in Distributed Databases. TKDE 8, 911–922 (1996)Google Scholar
- 4.Liu, K., Kargupta, H., Ryan, J.: Multiplicative noise, random projection, and privacy preserving data mining from distributed multi-party data. In: TKDE (2005)Google Scholar
- 6.Sun, J., Papadimitriou, S., Faloutsos, C.: Distributed pattern discovery in multiple streams. In: Technical Report CMU-CS-06-100, Carnegie Mellon Univ. (2005)Google Scholar