Exploiting Efficient Parallelism for Mining Rules in Time Series Data-Reference-Cited by-同舟云学术

Exploiting Efficient Parallelism for Mining Rules in Time Series Data

Published:2005 Issue: Volume: Page:845-855
ISSN:0302-9743
Container-title:High Performance Computing and Communications
language:
Short-container-title:

Author:

Sarker Biplab Kumer,Uehara Kuniaki,Yang Laurence T.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11557654_95

Reference19 articles.

1. Berndt, D.J., Clifford, J.: Finding Patterns in Time Series: A Dynamic Programming Approach. In: Proc. of Advances in Knowledge Discovery and Data Mining, pp. 229–248 (1996)

2. Bay, S.D.: Combining Nearest Neighbor Classifiers Through Multiple Feature Subsets. In: Proc. of 15th International Conference on Machine Learning, pp. 37–45 (1998)

3. Oates, T., Cohen, P.R.: Searching for Structure in Multiple Stream of Data. In: Proc. of 13th International Conference on Machine Learning, pp. 346–354 (1996)

4. Lecture Notes in Artificial Intelligence;M. Shimada,2000

5. Das, G., Lin, K., Mannila, H., Renganathan, G., Smyth, P.: Rule Discovery from Time Series. In: Proc. of Fourth International Conference on Knowledge Discovery and Data mining, pp. 16–22. AAAI Press, Menlo Park (1998)

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An Efficient Temporal Inter-Object Association Rule Mining Algorithm on Time Series;Vietnam Journal of Computer Science;2022-07-12

2. A Parallelized Frequent Temporal Pattern Mining Algorithm on a Time Series Database;Intelligent Information and Database Systems;2021

3. Bibliography;High-Performance Parallel Database Processing and Grid Databases;2008-03-11