Papers read during Spring '07 semester:

  1. Memory characterization of a parallel Data Mining Workload. Jin-Soo Kim, et al.
  2. Performance and Memory-Access Characterization of Data Mining Application. Bradford,Jeffrey P.,et al.
  3. CHIDDAM: A Data Mining based Techniques for Cache Hierarchy Determination in Commercial Applications. Elakkumanan, Praveen. et al.
  4. Cache-conscious Frequent Pattern Mining on a Modern Processor. Ghoting, Amol. et al.
  5. Mining Compressed Frequent-Pattern Sets. Xin,Dong, et al.
  6. Mining Association Rules between Sets of Items in Large Databases. Agrawal, Rakesh. et al.
  7. Custom Memory Placement for Parallel Data Mining. Parthasarathy, S. et al.
  8. Research Issues in Data Stream Association Rule Mining. Jiang, Nan. et al.
  9. Resource-Aware Mining with Variable Granularities in Data Streams. Teng, Wei-Guang. et al.
  10. Memory issues in frequent itemset mining. Goethals, Bart.
  11. Caching for Multi-dimensional Data Mining Queries. Nag, Biswadeep. et al.
  12. Using Distributed Query Result Caching to Evaluate Queries for Parallel Data Mining Algorithms. Taylor, Merwyn,G. et al.
  13. Parallel Data Mining for Association Rules on Shared-memory Systems. Zaki, Mohammad J.,et al.
  14. Using Available Remote Memory Dynamically for Parallel Data Mining Application on ATM-Connected PC cluster. Oguchi, Masato. et al.
  15. Data Organization and Access for Efficient Data Mining. Dunkel, Brian. et al.
Return to Main Page