Boolean Algebraic Algorithm for Mining Association Rules from Large Database
Agrawal.R and Srikant.R, “Fast algorithms for mining association rules”, Proceedings of 20th International Conference on Very Large Data Bases, September 12-15, 1994, Santiago de Chile, Chile.
Anekritmongkol.S, and Kasamsan.M.L.K, “The Comparative of Boolean Algebra Compress and Apriori Rule Techniques for New Theoretic Association Rule Mining Model”, Advanced Information Management and Service (IMS) 6th International Conference on 2010, pp.216-222.
Hebah.H and Nasereddin.O,” Stream Data Mining”, International Journal of Web Applications Volume 1 Number 4, December 2009, pp. 183.
Han.J and Kamber.M.. “Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers, 2001.
Liu.H and Wang.B, “An association rule mining algorithm based on a Boolean matrix”, Data Science Journal, Volume 6, Supplement, 9 September 2007.
Schlegel.B, Gemulla.R, and Lehner.W, “Memory-efficient frequent-itemset mining”, Proceeding EDBT/ICDT '11 Proceedings of the 14th International Conference on Extending Database Technology.
Udom Yaichroen,”Applied Boolean Algebra”,1989,Bangkok,Thailand.
Wur.S.Y and Leu.Y, “An Effective Boolean Algorithm for Mining Association Rules in Large Databases”, DASFAA Proceedings of the Sixth International Conference on Database Systems for Advanced Applications IEEE Computer Society Washington, DC, USA 1999.
Yen.S.J., and Chen.A., “An efficient approach to discovering knowledge from large databases”. Proceedings of the InternationalConference on Parallel and Distributed Information Systems, pages.8-18,1996.
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.