Database Reference
In-Depth Information
16. Carole A. Goble and David De Roure. The impact of workflow tools on data-centric research. In
Tony Hey, Stewart Tansley, and Kristin M. Tolle, editors,
The Fourth Paradigm
, pages 137-145.
Microsoft Research, 2009.
17. Ananth Grama, George Karypis, Vipin Kumar, and Anshul Gupta.
Introduction to Parallel
Computing (2nd Edition)
. Addison Wesley, second edition, 2003.
18. Valerie Guralnik and George Karypis. Parallel tree-projection-based sequence mining algo-
rithms.
Parallel Computing
, 30(4):443-472, April 2004.
19. Eui-Hong Han, George Karypis, and Vipin Kumar. Scalable parallel data mining for association
rules. In
ACM SIGMOD International Conference on Management of Data
, SIGMOD '97,
pages 277-288, New York, NY, USA, 1997. ACM.
20. Jiawei Han, Jian Pei, Behzad Mortazavi-Asl, Qiming Chen, Umeshwar Dayal, and Mei-
Chun Hsu. Freespan: Frequent pattern-projected sequential pattern mining. In
ACM SIGKDD
International Conference on Knowledge Discovery and Data Mining
, KDD '00, pages 355-
359, New York, NY, USA, 2000. ACM.
21. Jiawei Han, Jian Pei, and Yiwen Yin. Mining frequent patterns without candidate generation.
In
ACM SIGMOD International Conference on Management of Data
, SIGMOD '00, pages
1-12, New York, NY, USA, 2000. ACM.
22. Jiawei Han, Hong Cheng, Dong Xin, and Xifeng Yan. Frequent pattern mining: Current status
and future directions.
Data Mining and Knowledge Discovery
, 15(1):55-86, August 2007.
23. Carl Hewitt, Peter Bishop, and Richard Steiger. A universal modular actor formalism for
artificial intelligence. In
Third International Joint Conference on Artificial intelligence
, IJCAI-
73, pages 235-245. Morgan Kaufmann Publishers Inc., 1973.
24. Lawrence B Holder, Diane J Cook, Surnjani Djoko, et al. Substucture discovery in the subdue
system. In
AAAI Workshop on Knowledge Discovery in Databases
, KDD-94, pages 169-180,
1994.
25. Akihiro Inokuchi, Takashi Washio, and Hiroshi Motoda. An apriori-based algorithm for min-
ing frequent substructures from graph data. In
Principles of Data Mining and Knowledge
Discovery
, pages 13-23. Springer, 2000.
26. Mahesh V. Joshi, George Karypis, and Vipin Kumar. A universal formulation of sequential
patterns. Technical Report 99-021, Department of Computer Science, University of Minnesota,
1999.
27. Mahesh V. Joshi, George Karypis, and Vipin Kumar. Parallel algorithms for mining sequen-
tial associations: Issues and challenges. Technical report, Department of Computer Science,
University of Minnesota, 2000.
28. George Karypis and Vipin Kumar. A fast and high quality multilevel scheme for partitioning
irregular graphs.
SIAM Journal of Scientific Computing
, 20(1):359-392, Dec 1998.
29. Michihiro Kuramochi and George Karypis. Frequent subgraph discovery. In
Proceedings of
the 2001 IEEE International Conference on Data Mining
, ICDM 2001, pages 313-320. IEEE,
2001.
30. Michihiro Kuramochi and George Karypis. Finding frequent patterns in a large sparse graph.
Data Mining and Knowledge Discovery
, 11(3):243-271, 2005.
31. Vance Chiang-Chi Liao and Ming-Syan Chen. Dfsp: a depth-first spelling algorithm for se-
quential pattern mining of biological sequences.
Knowledge and Information Systems
, pages
1-17, 2013.
32. Jimmy Lin and Dmitriy Ryaboy. Scaling big data mining infrastructure: the twitter experience.
ACM SIGKDD Explorations Newsletter
, 14(2):6-19, 2013.
33. Ming-Yen Lin, Pei-Yu Lee, and Sue-Chen Hsueh. Apriori-based frequent itemset mining al-
gorithms on mapreduce. In
Proceedings of the Sixth International Conference on Ubiquitous
Information Management and Communication
, ICUIMC '12, pages 76:1-76:8, New York, NY,
USA, 2012. ACM.
34. Yang Liu, Xiaohong Jiang, Huajun Chen, Jun Ma, and Xiangyu Zhang. Mapreduce-based
pattern finding algorithm applied in motif detection for prescription compatibility network. In
Advanced Parallel Processing Technologies
, pages 341-355. Springer, 2009.
