Abstract
The value and importance of long patterns are gaining increasing recognition in a wide range of domains including bioinformatics, social network analysis, software engineering and business intelligence. Yet the task of mining long patterns has remained a challenge due to the prohibitively large number of smaller patterns which often need to be generated first. In this chapter, we first use a pattern lattice model to illustrate and compare various mining paradigms. Then we present recent studies for mining long patterns according to their respective pattern mining paradigms. For each category, we discuss the representative algorithms and the state-of-the-art development.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487–499, 1994.
R. Agrawal, C. C. Aggarwal, and V. V. V. Prasad. Depth first generation of long patterns. In Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2000), pages 108–118, 2000. Also available as IBM Research Report, RC21538, 1999.
T. Asai, K. Abe, S. Kawasoe, H. Arimura, H. Satamoto, and S. Arikawa. Efficient substructure discovery from large semi-structured data. In SDM, pages 158–174, 2002.
Roberto J. Bayardo. Efficiently mining long patterns from databases, pages 85–93, 1998.
C. Borgelt and M. Berthold. Mining molecular fragments: Finding relevant substructures of molecules. In ICDM, pages 211–218, 2002.
D. Burdick, M. Calimlim, J. Flannick, J. Gehrke, and T. Yiu. Mafia: A maximal frequent itemset algorithm. IEEE Transactions on Knowledge and Data Engineering, 17(11):1490–1504, 2005.
K. Gouda and M. Zaki. Genmax: An efficient algorithm for mining maximal frequent itemsets. Data Min. Knowl. Discov., 11(3):223–242, November 2005.
J. Han, J. Pei, B. Mortazavi-Asl, Q. Chen, U. Dayal, and M.-C. Hsu. Freespan: Frequent pattern-projected sequential pattern mining. In Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD '00, pages 355–359, New York, NY, USA, 2000. ACM.
J. Han, J. Pei, Y. Yin, and R. Mao. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Min. Knowl. Discov., 8(1):53–87, January 2004.
J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In ICDM, pages 549–552, 2003.
A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD, pages 13–23, 2000.
R. Jin, C. Wang, D. Polshakov, S. Parthasarathy, and G. Agrawal. Discovering frequent topological structures from graph datasets. In Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, KDD '05, pages 606–611, New York, NY, USA, 2005. ACM.
M. Kuramochi and G. Karypis. Frequent subgraph discovery. In ICDM, pages 313–320, 2001.
S. Kurtz, JV. Choudhuri, E. Ohlebusch, C. Schleiermacher, J. Stoye, and R. Giegerich. Reputer: the manifold applications of repeat analysis on a genomic scale. In Nucleic Acids Research, number 22, pages 4633–4642, 2001.
D. Lo, S-C. Khoo, and C. Liu. Efficient mining of iterative patterns for software specification discovery. In KDD, pages 460–469, 2007.
S. Nijssen and J. Kok. A quickstart in frequent structure mining can make a difference. In SIGKDD, pages 647–652, 2004.
C. Olston, S. Chopra, and U. Srivastava. Generating example data for dataflow programs. In SIGMOD, pages 245–256, 2009.
F. Pan, G. Cong, A. K. H. Tung, J. Yang, and M. J. Zaki. Carpenter: finding closed patterns in long biological datasets. In Lise Getoor, Ted E. Senator, Pedro Domingos, and Christos Faloutsos, editors, KDD, pages 637–642. ACM, 2003.
F. Pan, G. Cong, X. Xin, and A. K. H. Tung. Cobbler: Combining column and row enumeration for closed pattern discovery. In In Proc 2004 Int. Conf. on Scientific and Statistical Database Management (SSDBM'04), Santorini Island, pages 21–30, 2004.
J. Pei, J. Han, and R. Mao. CLOSET: An efficient algorithm for mining frequent closed itemsets. In DMKD, pages 11–20, 2000.
J. Pei, J. Han, B. Mortazavi-Asl, H. Pinto, Q. Chen, U. Dayal, and M. Hsu. PrefixSpan: Mining sequential patterns efficiently by prefix-projected pattern growth. In ICDE, pages 215–224, 2001.
J. Prins, J. Yang, J. Huan, and W. Wang. Spin: Mining maximal frequent subgraphs from graph databases. In SIGKDD, pages 581–586, 2004.
L. Thomas, S. Valluri, and K. Karlapalem. Margin: Maximal frequent subgraph mining. In ICDM, pages 1097–1101, 2006.
J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. In SIGKDD, pages 236–245, 2003.
X. Yan and J. Han. gSpan: Graph-based substructure pattern mining. In ICDM, pages 721–724, 2002.
J. Yang, W. Wang, P. S. Yu, and J. Han. Mining long sequential patterns in a noisy environment. In Proceedings of the 2002 ACM SIGMOD International Conference on Management of Data, SIGMOD '02, pages 406–417, New York, NY, USA, 2002. ACM.
M. J. Zaki. Spade: An efficient algorithm for mining frequent sequences. Mach. Learn., 42(1–2):31–60, January 2001.
M. Zaki. Efficiently mining frequent trees in a forest. In SIGKDD, pages 71–80, 2002.
M. Zaki and C. Hsiao. CHARM: An efficient algorithm for closed itemset mining. In SDM, pages 457–473, 2002.
M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In In 3rd Intl. Conf. on Knowledge Discovery and Data Mining, pages 283–286. AAAI Press, 1997.
F. Zhu, X. Yan, J. Han, P. Yu, and H. Cheng. Mining colossal frequent patterns by core pattern fusion. In ICDE, pages 706–715, 2007.
F. Zhu, X. Yan, J. Han, and P. S. Yu. Efficient discovery of frequent approximate sequential patterns. In ICDM, pages 751–756, 2007.
F. Zhu, Q. Qu, D. Lo, X. Yan, J. Han, and P. S. Yu. Mining top-k large structural patterns in a massive network. PVLDB, 4(11):807–818, 2011.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Zhu, F. (2014). Mining Long Patterns. In: Aggarwal, C., Han, J. (eds) Frequent Pattern Mining. Springer, Cham. https://doi.org/10.1007/978-3-319-07821-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-07821-2_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-07820-5
Online ISBN: 978-3-319-07821-2
eBook Packages: Computer ScienceComputer Science (R0)