New Algorithms for Enumerating All Maximal Cliques

作者: Kazuhisa Makino , Takeaki Uno

DOI: 10.1007/978-3-540-27810-8_23

关键词:

摘要: … sets or all minimal vertex covers) of a given graph and (2) … Hence our algorithms can enumerate all closed item sets in … sparse, it is shown [24] that our algorithms for sparse graphs …

参考文章(25)
Takeaki Uno, Yuzo Uchida, Tatsuya Asai, Hiroki Arimura, LCM: An Efficient Algorithm for Enumerating Frequent Closed Item Sets. FIMI. ,(2003)
Yves Bastide, Nicolas Pasquier, Rafik Taouil, Lotfi Lakhal, Closed Set Based Discovery of Small Covers for Association Rules. Proc. 15èmes Journées Bases de Données Avancées, BDA. pp. 361- 381 ,(1999)
E. Boros, V. Gurvich, L. Khachiyan, K. Makino, On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets symposium on theoretical aspects of computer science. pp. 133- 141 ,(2002) , 10.1007/3-540-45841-7_10
Ramakrishnan Srikant, Rakesh Agrawal, Fast Algorithms for Mining Association Rules in Large Databases very large data bases. pp. 487- 499 ,(1994)
Heikki Mannila, A. Inkeri Verkamo, Ramakrishnan Srikant, Hannu Toivonen, Rakesh Agrawal, Fast discovery of association rules knowledge discovery and data mining. pp. 307- 328 ,(1996)
Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal, Discovering Frequent Closed Itemsets for Association Rules international conference on database theory. ,vol. 1540, pp. 398- 416 ,(1999) , 10.1007/3-540-49257-7_25
Thomas Eiter, Kazuhisa Makino, On computing all abductive explanations national conference on artificial intelligence. pp. 62- 67 ,(2002) , 10.5555/777092.777105
Don Coppersmith, Shmuel Winograd, Matrix multiplication via arithmetic progressions Journal of Symbolic Computation. ,vol. 9, pp. 251- 280 ,(1990) , 10.1016/S0747-7171(08)80013-2
E. Boros, K. Elbassioni, V. Gurvich, L. Khachiyan, K. Makino, Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities SIAM Journal on Computing. ,vol. 31, pp. 1624- 1643 ,(2002) , 10.1137/S0097539701388768