Efficient Frequent Query Discovery in FARMER
暂无分享,去创建一个
[1] George Karypis,et al. An efficient algorithm for discovering frequent subgraphs , 2004, IEEE Transactions on Knowledge and Data Engineering.
[2] Joost N. Kok,et al. Faster Association Rules for Multiple Relations , 2001, IJCAI.
[3] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.
[4] Hannu Toivonen,et al. Discovery of frequent DATALOG patterns , 1999, Data Mining and Knowledge Discovery.
[5] George Karypis,et al. Frequent subgraph discovery , 2001, Proceedings 2001 IEEE International Conference on Data Mining.
[6] Jiawei Han,et al. gSpan: graph-based substructure pattern mining , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..
[7] Nicola Fanizzi,et al. Efficient θ-subsumption under Object Identity , 2002 .
[8] Bart Demoen,et al. Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs , 2011, J. Artif. Intell. Res..