Datasets for Itemset, Sequence and Tree Mining

<p>There are three different datasets included, that can be used for itemset, sequence and tree mining methods.</p> <p><strong>dense_db.zip</strong></p> <p>contains various real itemset datasets like <strong>chess</strong>, <strong>connect</strong>, <strong>mushroom</strong>, <strong>pumsb, T10I4D100K, T40I10D100K</strong>&nbsp;and so on, used in the papers on frequent, closed and maximal itemset mining. For example,&nbsp;<strong>Mohammed J. Zaki</strong> and Ching-Jui Hsiao. <strong>Efficient algorithms for mining closed itemsets and their lattice structure.</strong> <em>IEEE Transactions on Knowledge and Data Engineering</em>, 17(4):462&ndash;478, April 2005. <a href="https://doi.org/10.1109/69.846291">doi:10.1109/69.846291</a>. Or Karam Gouda and <strong>Mohammed J. Zaki</strong>. <strong>Genmax: an efficient algorithm for mining maximal frequent itemsets.</strong> <em>Data Mining and Knowledge Discovery: An International Journal</em>, 11(3):223&ndash;242, November 2005. <a href="https://doi.org/10.1007/s10618-005-0002-x">doi:10.1007/s10618-005-0002-x</a>.</p> <p>&nbsp;</p> <p><strong>plandata.zip</strong>:&nbsp;</p> <p>Planning dataset for sequence mining. It was used in the paper&nbsp;<strong>Mohammed J. Zaki</strong>, Neal Lesh, and Mitsunori Ogihara. <strong>PLANMINE: predicting plan failures using sequence mining.</strong> <em>Artificial Intelligence Review</em>, 14(6):421&ndash;446, December 2000. Special issue on Applications of Data Mining.&nbsp;<a href="https://doi.org/https://doi.org/10.1023/A:1006612804250">doi:https://doi.org/10.1023/A:1006612804250</a>.</p> <p>&nbsp;</p> <p><strong>cslogs.zip</strong>:&nbsp;</p> <p>The CSLOGS data was used for tree mining, e.g., in&nbsp;<strong>Mohammed J. Zaki</strong>. <strong>Efficiently mining frequent trees in a forest: algorithms and applications.</strong> <em>IEEE Transactions on Knowledge and Data Engineering</em>, 17(8):1021&ndash;1035, August 2005. Special issue on Mining Biological Data. <a href="https://doi.org/10.1109/TKDE.2005.125">doi:10.1109/TKDE.2005.125</a>.</p> <p>&nbsp;</p>