Data Mining
For today's class, we will be reading two papers:
- R. Agrawal, R. Srikant. Fast Algorithms for Mining Association
Rules in Large Databases. VLDB 1994 . We are reading this paper
because it is the classic example of the database view of data
mining.
- Tian Zhang, Raghu Ramakrishnan, Miron Livny. BIRCH: An Efficient Data Clustering
Method for Very Large Databases. Proc. SIGMOD Conference, 1996,
103-114. We are reading this paper because it is a good example of
another data mining problem, in this case clustering. Don't worry
about the different kinds of distances in section 3. If you're
curious, read section 3 carefully, but for our purposes, just know
that they are different distance metrics. You may skip sections
5.1.1, and skim section 6.
[504 home] [grading] [schedule][project] [Connect]
Rachel Pottinger
E-mail Address:
Office Location: CICSR 345
Phone: (604)822-0436
Fax:(604)822-5485
Postal/Courier address:
The Department of Computer Science
University of British Columbia
201-2366 Main Mall
Vancouver, B.C. V6T 1Z4
Canada