Database Reference
In-Depth Information
61. J. Pei, J. Han, and W. Wang. Constraint-based Sequential Pattern Mining: The Pattern-Growth
Methods,
Journal of Intelligent Information Systems
, 28(2), pp. 133-160, 2007.
62. P. Shenoy, J. Haritsa, S. Sudarshan, G. Bhalotia, M. Bawa, D. Shah. Turbo-charging Vertical
Mining of Large Databases.
ACM SIGMOD Conference
, pp. 22-33, 2000.
63. J. Srivastava, R. Cooley, M. Deshpande, and P. N. Tan. Web usage mining: Discovery and
applications of usage patterns from Web data.
ACM SIGKDD Explorations Newsletter
, 1(2),
pp. 12-23, 2000.
64. Y. Tong, L. Chen, Y. Cheng, P.Yu. Mining Frequent Itemsets over Uncertain Databases.
PVLDB
,
5(11), pp. 1650-1661, 2012.
65. V. S. Verykios, A. K. Elmagarmid, E. Bertino, Y. Saygin, and E. Dasseni. Association rule
hiding.
IEEE Transactions on Knowledge and Data Engineering
, pp. 434-447, 16(4), pp. 434-
447, 2004.
66. J. Vreeken, M. van Leeuwen, and A. Siebes. Krimp: Mining itemsets that compress.
Data
Mining and Knowledge Discovery
, 23(1), pp. 169-214, 2011.
67. J. Wang, J. Han, and J. Pei. CLOSET+: Searching for the Best strategies for mining frequent
closed itemsets.
ACM KDD Conference
, 2003.
68. Z. Xing, J. Pei, and E. Keogh. A Brief Survey on Sequence Classification,
ACM SIGKDD
Explorations
, 12(1), 2010.
69. X. Yan, P. S. Yu, and J. Han, Graph indexing: A frequent structure-based approach.
ACM
SIGMOD Conference
, 2004.
70. X. Yan, P. S. Yu, and J. Han. Substructure similarity search in graph databases.
ACM SIGMOD
Conference
, 2005.
71. X. Yan, F. Zhu, J. Han, and P. S. Yu. Searching substructures with superimposed distance,
ICDE Conference
, 2006.
72. M. Zaki. Efficiently mining frequent trees in a forest: Algorithms and applications.
IEEE
Transactions on Knowledge and Data Engineering
, 17(8), pp. 1021-1035, 2005.
73. M. Zaki, C. Aggarwal. XRules: An Effective Classifier for XML Data,
ACM KDD Conference
,
2003.
74. M. Zaki, C. J. Hsiao. CHARM: An Efficient Algorithm for Closed Frequent Itemset Mining,
SDM Conference
, 2002.
75. S. Zhang, T. Wang. Discovering Frequent Agreement Subtrees from Phylogenetic Data.
IEEE
Transactions on Knowledge and Data Engineering
, 20(1), pp. 68-82, 2008.
76. Z. Zou, J. Li, H. Gao, and S. Zhang. Mining Frequent Subgraph Patterns from Uncertain Graph
Data,
IEEE Transactions on Knowledge and Data Engineering
, 22(9), pp. 1203-1218, 2010.
77. http://fimi.ua.ac.be/
