COP 6731 Theory and Implementation of Database Systems

Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., and Lakhal, L., "Mining frequent patterns with counting inference", ACM SIGKDD Explorations Newsletter, 2 (2), pp. 66–75 (2000).

Bayardo Jr, R. J., "Efficiently mining long patterns from databases", Proceedings of the ACM SIGMOD International Conference on Management of Data, ACM, pp. 85–93 (1998).

Calders, T. and Goethals, B., "Non-derivable itemset mining", Data Mining and Knowledge Discovery, 14 (1), pp. 171–206 (2007).

Gouda, K. and Zaki, M. J., "Genmax: An efficient algorithm for mining maximal frequent itemsets", Data Mining and Knowledge Discovery, 11 (3), pp. 223–242 (2005).

Zaki, M. J. and Hsiao, C.-J., "Efficient algorithms for mining closed itemsets and their lattice structure", IEEE Transactions on Knowledge and Data Engineering, 17 (4), pp. 462–478 (2005).

Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., and Hsu, M.-C., "Mining sequential patterns by pattern-growth: The prefixspan approach", IEEE Transactions on Knowledge and Data Engineering, 16 (11), pp. 1424–1440 (2004).

Srikant, R. and Agrawal, R., “Mining sequential patterns: Generalizations and performance improvements”, Proceedings of the 5th International Conference on Extending Database Technology, Springer (1996).

Zaki, M. J., "SPADE: An efficient algorithm for mining frequent sequences", Machine learning, 42 (1-2), pp. 31–60 (2001).

Al Hasan, M. and Zaki, M. J., "Output space sampling for graph patterns", Proceedings of the VLDB Endowment, 2 (1), pp. 730–741 (2009).

Huan, J., Wang, W., and Prins, J., "Efficient mining of frequent subgraphs in the presence of isomorphism", Proceedings of the IEEE International Conference on Data Mining, IEEE, pp. 549–552 (2003).

Inokuchi, A., Washio, T., and Motoda, H. (2000), "An apriori-based algorithm for mining frequent substructures from graph data", in: Proceedings of the European Conference on Principles of Data Mining and Knowledge Discovery, Springer, pp. 13–23.

Kuramochi, M. and Karypis, G., "Frequent subgraph discovery", Proceedings of the IEEE International Conference on Data Mining, IEEE, pp. 313–320 (2001).

Yan, X. and Han, J., "gSpan: Graph-based substructure pattern mining", Proceedings of the IEEE International Conference on Data Mining, IEEE, pp. 721–724 (2002).

Zaki, M. J., "Efficiently mining frequent trees in a forest", Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp. 71–80 (2002).

Geng, L. and Hamilton, H. J., "Interestingness measures for data mining: A survey", ACM Computing Surveys, 38 (3), p. 9 (2006).

Gionis, A., Mannila, H., Mielikäinen, T., and Tsaparas, P., "Assessing data mining results via swap randomization", ACM Transactions on Knowledge Discovery from Data, 1 (3), p. 14 (2007).

Lallich, S., Teytaud, O., and Prudhomme, E., "Association rule interestingness: measure and statistical validation", in: Quality measures in data mining, Springer, pp. 251–275 (2007).

Megiddo, N. and Srikant, R., "Discovering predictive association rules", Proceedings of the 4th International Conference on Knowledge Discovery in Databases and Data Mining, pp. 274–278 (1998).

Tan, P.-N., Kumar, V., and Srivastava, J. (2002), "Selecting the right interestingness measure for association patterns", Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp. 32–41.

Webb, G. I., "Discovering significant rules", Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, pp. 434–443 (2006).

Cheng, Y., "Mean shift, mode seeking, and clustering", Pattern Analysis and Machine Intelligence, IEEE Transactions on, 17 (8), pp. 790–799 (1995).

Ester, M., Kriegel, H.-P., Sander, J., and Xu, X., "A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise.", Proceedings of the 2nd ACM SIGKDD, ed. by E. Simoudis, J. Han, and U. M. Fayyad, AAAI Press, pp. 226–231 (1996).

Hinneburg, A. and Gabriel, H.-H., "Denclue 2.0: Fast clustering based on kernel density estimation", Proceedings of the 7th International Symposium on Intelligent Data Analysis, Springer, pp. 70–80 (2007).

Ye, Wei, et al. "Incorporating user's preference into attributed graph clustering." IEEE Transactions on Knowledge and Data Engineering 33.12 (2020): 3716-3728.

Wang, Wei, Jiong Yang, and Richard Muntz. "STING: A statistical information grid approach to spatial data mining." Vldb. Vol. 97. 1997.

Hinneburg, Alexander, and Hans-Henning Gabriel. "Denclue 2.0: Fast clustering based on kernel density estimation." International symposium on intelligent data analysis. Berlin, Heidelberg: Springer Berlin Heidelberg, 2007.

Xu, Xiaowei, et al. "Scan: a structural clustering algorithm for networks." Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining. 2007.

Fang, Yixiang, et al. "Effective community search over large spatial graphs." Proceedings of the VLDB Endowment (PVLDB) (2017).

Wen, Dong, et al. "Efficient structural graph clustering: an index-based approach." Proceedings of the VLDB Endowment 11.3 (2017): 243-255.

Cui, Wanyun, et al. "Local search of communities in large graphs." Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 2014.

Budak, Ceren, et al. "Geoscope: Online detection of geo-correlated information trends in social networks." Proceedings of the VLDB Endowment 7.4 (2013): 229-240.

Shi, Jieming, et al. "Density-based place clustering in geo-social networks." Proceedings of the 2014 ACM SIGMOD international conference on Management of data. 2014.

Whang, Joyce Jiyoung, David F. Gleich, and Inderjit S. Dhillon. "Overlapping community detection using neighborhood-inflated seed expansion." IEEE Transactions on Knowledge and Data Engineering 28.5 (2016): 1272-1284.

Murthy, Sreerama K. "Automatic construction of decision trees from data: A multi-disciplinary survey." Data mining and knowledge discovery 2 (1998): 345-389

Zheng, Zijian, Ron Kohavi, and Llew Mason. "Real world performance of association rule algorithms." Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining. 2001.