T-trees, vertical partitioning and distributed association rule mining

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2003, Pages 513-516

  Coenen, Frans ^a   Leng, Paul ^a   Ahmed, Shakil ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33745855297     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Agrawal, R, and Shafer, J.C. (1996). Parallel Mining of Association Rules. IEEE Transactions on Knowledge and Data Engineering, Vol 8, No 6, pp962-969.
2. Agrawal, R. and Srikant, R. (1994). Fast algorithms for mining association rules. Proc. 20th VLDB Conference, Morgan Kaufman, pp487-499.
3. Arnold, K., Freeman, E. and Hupfer, S. (1999). JavaSpaces: Principles, Patterns and Practice. Addison Wesley.
4. Chattratichat, J., Darlington, J., Ghanem, M., Guo, Y., Hning, H., Khler, M., Sutiwaraphun, J., To H.W., Yang, D. (1997). Large Scale Data Mining: Challenges and Responses. Proc. 3rd Int. Conf. on Knowledge Discovery and Data mining (KDD'97), pp143-146.
5. Coenen, F. and Leng, P. (2001). Optimising Association Rule Algorithms Using Itemset Ordering. Research and Development in Intelligent Systems XVIII: Proc ES2001 Conference, eds M Bramer, F Coenen and A Preece, Springer, pp53-66.
6. Coenen, F., Goulbourne, G. and Leng, P., (2003). Tree Structures for Mining association Rules. To appear in the journal of Data Mining and Knowledge Discovery.
7. Goulbourne, G., Coenen, F. and Leng, P. (2000). Algorithms for Computing Association Rules Using a Partial-Support Tree. Journal of Knowledge-Based Systems, Vol (13), pp141-149.