Database Reference
In-Depth Information
35. Wei Lu, Gang Chen, Anthony KH Tung, and Feng Zhao. Efficiently extracting frequent sub-
graphs using mapreduce. In
2013 IEEE International Conference on Big Data
, pages 639-647.
IEEE, 2013.
36. Heikki Mannila, Hannu Toivonen, and A. Inkeri Verkamo. Discovery of frequent episodes in
event sequences.
Data Mining and Knowledge Discovery
, 1(3):259-289, January 1997.
37. Thorsten Meinl, Marc Worlein, Ingrid Fischer, and Michael Philippsen. Mining molecular
datasets on symmetric multiprocessor systems. In
IEEE International Conference on Systems,
Man and Cybernetics
, volume 2 of
SMC '06
, pages 1269-1274. IEEE, 2006.
38. Iris Miliaraki, Klaus Berberich, Rainer Gemulla, and Spyros Zoupanos. Mind the gap: Large-
scale frequent sequence mining. In
ACM SIGMOD International Conference on Management
of Data
, SIGMOD '13, pages 797-808, New York, NY, USA, 2013. ACM.
39. Sandy Moens, Emin Aksehirli, and Bart Goethals. Frequent itemset mining for big data. In
2013 IEEE International Conference on Big Data
, pages 111-118. IEEE, 2013.
40. Andreas Mueller. Fast sequential and parallel algorithms for association rule mining: A com-
parison. Technical report, University of Maryland at College Park, College Park, MD, USA,
1995.
41. Christos H. Papadimitriou and Kenneth Steiglitz.
Combinatorial optimization: algorithms and
complexity
. Courier Dover Publications, 1998.
42. Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, and Hua Zhu. Mining access patterns efficiently
from web logs. In
Pacific-Asia Conference on Knowledge Discovery and Data Mining, Current
Issues and New Applications
, PAKDD '00, pages 396-407, London, UK, UK, 2000. Springer-
Verlag.
43. Jian Pei, Jiawei Han, Behzad Mortazavi-Asl, Helen Pinto, Qiming Chen, Umeshwar Dayal,
and Mei-Chun Hsu. Prefixspan: Mining sequential patterns efficiently by prefix-projected
pattern growth. In
International Conference on Data Engineering
, ICDE '01, pages 215-224,
Washington, DC, USA, 2001. IEEE Computer Society.
44. Shaojie Qiao, Changjie Tang, Shucheng Dai, Mingfang Zhu, Jing Peng, Hongjun Li, and
Yungchang Ku. Partspan: Parallel sequence mining of trajectory patterns. In
International
Conference on Fuzzy Systems and Knowledge Discovery - Volume 05
, FSKD '08, pages 363-
367, Washington, DC, USA, 2008. IEEE Computer Society.
45. Shaojie Qiao, Tianrui Li, Jing Peng, and Jiangtao Qiu. Parallel sequential pattern min-
ing of massive trajectory data.
International Journal of Computational Intelligence Systems
,
3(3):343-356, 2010.
46. A. Rajimol and G. Raju. Web access pattern mining — a survey. In
International Conference
on Data Engineering and Management
, ICDEM '10, pages 24-31, Berlin, Heidelberg, 2012.
Springer-Verlag.
47. Abhik Ray and Lawrence B. Holder. Efficiency improvements for parallel subgraph miners. In
Florida Artificial Intelligence Research Society Conference
, FLAIRS '12, 2012.
48. Steve Reinhardt and George Karypis. A multi-level parallel implementation of a program for
finding frequent patterns in a large sparse graph. In
International Symposium on Parallel and
Distributed Processing
, IPDPS 2007, pages 1-8, 2007.
49. Isidore Rigoutsos and Aris Floratos. Combinatorial pattern discovery in biological sequences:
The teiresias algorithm.
Bioinformatics
, 14(1):55-67, 1998.
50. Majed Sahli, Essam Mansour, and Panos Kalnis. Parallel motif extraction from very long
sequences. In
ACM International Conference on Conference on Information & Knowledge
Management
, CIKM '13, pages 549-558, New York, NY, USA, 2013. ACM.
51. Ashoka Savasere, Edward Omiecinski, and Shamkant B. Navathe. An efficient algorithm
for mining association rules in large databases. In
International Conference on Very Large
Data Bases
, VLDB '95, pages 432-444, San Francisco, CA, USA, 1995. Morgan Kaufmann
Publishers Inc.
52. Takahiko Shintani and Masaru Kitsuregawa. Hash based parallel algorithms for mining asso-
ciation rules. In
International Conference on Parallel and Distributed Information Systems
,
pages 19-30, Dec 1996.
