Apriori algorithm: Difference between revisions

Revision as of 21:09, 9 July 2006

Revision as of 05:50, 10 July 2006

Line 26:

== References ==

* Agrawal R, Imielinski T, Swami AN. "Mining Association Rules between Sets of Items in Large Databases." ''[[SIGMOD]]''. June 1993, '''22'''(2), :207-16, [http://portal.acm.org/ft_gateway.cfm?id=170072&type=pdf&coll=GUIDE&dl=portal,ACM&CFID=11111111&CFTOKEN=2222222 pdf].

* Agrawal R, Srikant R. "Fast Algorithms for Mining Association Rules", ''[[VLDB]]''. Sep 12-15 1994, Chile, 487-99, [http://www.acm.org/sigmod/vldb/conf/1994/P487.PDF pdf], ISBN 1-55860-153-8.

* Mannila H, Toivonen H, Verkamo AI. "Efficient algorithms for discovering association rules." ''[[AAAI]] Workshop on Knowledge Discovery in Databases ([[SIGKDD]])''. July 1994, Seattle, 181-92, [http://www.softlab.ntua.gr/facilities/public/AD/DM/Efficient_Algorithms_for_Discovering_Association_Rules.ps ps].

* Zaki MJ, Parthasarathy S, Ogihara M, Li W. "Parallel Algorithms for Discovery of Association Rules." ''Data Mining and Knowledge Discovery''. Dec 1997, '''1'''(4), :343-73, [http://www.hpjava.org/pcrc/doc/rochester/97.DMKD.Parallel_algorithms_for_fast_discovery_of_assoc_rules.ps ps].

[[Category:Search algorithms]]