KNOWLEDGE DISCOVERY IN DATA AT LIVERPOOL

PROJECT DOCUMENTS AND PUBLICATIONS (1997-2004)


Department of Computer Science

The University of Liverpool



1. JOURNAL PAPERS

  1. 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. (Reprint of ES'99 paper).
  2. Zhang, L, Coenen, F. and Leng, P. (2003). Setting Attribute Weights for k-NN Based Binary Classification via Quadratic Programming. Journal of Intelligent Data Analysis, Vol 7, No 5, pp427-441.
  3. Coenen, F. and Leng, P., Goulbourne, G. (2004). Tree Structures for Mining Association Rules. Journal of Data Mining and Knowledge Discovery, Vol 8, pp25-51.

2. CONFERENCE PAPERS

  1. Goulbourne, G., Coenen, F. and Leng, P. (1998). Knowledge KD in FM: Discovery in Facilities Management Databases. In Quirchmayer, G., Schweighofer, E. and Bench-Capon, T.J.M. (Eds), Database and Expert Systems Applications, proceedings DEXA'98 (Vienna), Lecture Notes in Computer Science 1460, Springer Verlag, pp806-815.
  2. Goulbourne, G., Coenen, F., Leng, P. and Murphy, D. (1998). KD in FM: Developing Association Rules in Facilities Management Database. Proceedings ES98, Springer, London. pp 230-244.
  3. Goulbourne, G., Coenen, F., Leng, P. (1999). Algorithms for Computing Association Rules Using A Partial-Support Tree. Proceedings ES99, Springer, London.
  1. Bench-Capon, T.J.M. Coenen, F.P. and Leng, P.H (2000). An Experiment in Discovering Association Rules in the Legal Domain. In Database and Expert Systems Applications, Workshop proceedings DEXA'2000 (London), IEEE, pp1056-1060.
  2. Coenen, F.P., Goulbourne, G. and Leng, P.H. (2001). Computing Association Rules Using Partial Totals. In de Raedt, L. and Siebes, A. (Eds), Principles of Data Mining and Knowledge Discovery, Proc PKDD 2001, Spring Verlag LNAI 2168, pp 54-66.
  3. Coenen, F.P. and Leng, P.H. (2001). Optimising association rule algorithms using itemset ordering. In Bramer, M., Coenen, F. and Preece, A. (Eds.), Research and Development in Intelligent Systems XVIII, Springer, London, pp53-66.
  4. Zhang, Lu, Coenen, F. and Leng, P. (2002). An attribute Weight Setting Method for K-NN Based Binary Classification using Quadratic Programming. In van Harmelen, F. (Ed.), Proceedings ECAI 2002, Lyon. France (July 2002). pp325-329.
  5. Coenen, F.P. and Leng, P.H. (2002). Finding Association Rule With Some Very Frequent Attributes. In "Principles of Data Mining and Knowledge discovery", eds Elomaa, T., Mannila, H. and Toivonen, H., Proc PKDD 2002 Conference, Helsinki, August 2002: Lecture Notes in AI 2431, Springer-Verlag: 99-111.
  6. Coenen, F.P., Leng, P.H. and Amed, S. (2003). T-Trees, Vertical Partitioning and Distributed Association Rule Mining. Proceedings ICDM-2003, pp513-516.
  7. Ahmed, S., Coenen, F. and Leng, P. (2003). Strategies for Partitioning Data in Association Rule Mining. In Coenen, F., Preece, A. and Macintosh, A.L. (Eds.), Research and Deveiopment in Intelligent Systems XXI, Springer, London, pp127-140.


3. WORKING PAPERS

  1. Goulbourne, G. (1997). Knowledge Discovery in Databases. Dept of Computer Science, The University of Liverpool, Royal & Sun Alliance Ph.D. Working Paper 1.
  2. Coenen, F. (1998). A Bruteforce Algorithm for ``Basket Analysis'' (GCL-BF1). Dept of Computer Science, University of Liverpool. Working Paper 2.
  3. Coenen, F. (1999). A Second Bruteforce Algorithm for ``Basket Analysis'' (GCL-BF2). Dept of Computer Science, University of Liverpool. Working Paper 3.
  1. Coenen, F. (1999). Partial Support. Dept of Computer Science, University of Liverpool. Working Paper 4.
  2. Coenen, F. (1999). Partial Support Using a "Partial Support Tree". Dept of Computer Science, University of Liverpool. Working Paper 5.
  3. Goulbourne, G., Coenen, F. and Leng, P. (1999). Computing Association Rules Using Partial Totals Dept of Computer Science, University of Liverpool. Working Paper 6.