A characterization of data mining algorithms on a modern processor

1st International Workshop on Data Management on New Hardware, DaMoN 2005, Co-located with ACM SIGMOD/PODS 2005

Volumn , Issue , 2005, Pages

  Ghoting, Amol ^a   Buehrer, Gregory ^a   Parthasarathy, Srinivasan ^a   Kim, Daehyun ^b   Nguyen, Anthony ^b   Chen, Yen Kuang ^b   Dubey, Pradeep ^b  

^a Ohio State University   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING ALGORITHM; DECISION TREE INDUCTION; FREQUENT ITEMSET MINING; GRAPH MINING; MEMORY ACCESS; MEMORY SYSTEMS; MODERN PROCESSORS; OUTLIER DETECTION; PREFETCHING; SEQUENCE MINING; SIMULTANEOUS MULTI-THREADING; SPATIAL LOCALITY; TEMPORAL LOCALITY;

CLUSTERING ALGORITHMS; DECISION TREES; MULTITASKING; NANOTECHNOLOGY;

DATA MINING;

EID: 77954018752     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1114252.1114258     Document Type: Conference Paper

References (22)

1. A. Ailamaki, D. J. DeWitt, M. Hill, and D. Wood. DBMSs on a modern processor: Where does time go? In Proceedings of International Conference on Very Large Data Bases (VLDB), 1999.
2. L. Barroso, K. Gharachorloo, and F. Bugnion. Memory system characterization of commercial workloads. In Proceedings of the International Symposium on Computer Architecture (ISCA), 1998.
3. S. Bay and M. Schwabacher. Mining distance-based outliers in near linear time with randomization and a simple pruning rule. In Proceedings of the International Conference on Knowledge Discovery and Data Mining(KDD), 2003.
4. M. Bender, E. Demaine, and M. Farach-Colton. Cache-oblivious b-trees. In Proceedings of the International Symposium on Foundations of Computer Science (FOCS), 2000.
5. J. Bradford and J. Fortes. Performance and memory-access characterization of data mining applications. In Proceedings of the Workshop on Workload Characterization (WWC), 1998.
6. D. Burdick, M. Calimlim, and J. Gehrke. MAFIA: A maximal frequent itemset mining algorithm for transactional databases. In Proceedings of the International Conference on Data Engineering (ICDE), 2001.
7. S. Chen, A. Ailamaki, P. Gibbons, and T. Mowry. Improving hash join performance through prefetching. In Proceedings of the International Conference on Data Engineering (ICDE), 2004.
8. S. Chen, P. Gibbons, and T. Mowry. Improving index performance through prefetching. In Proceedings of the International Conference on Management of Data (SIGMOD), 2001.
9. A. Ghoting, G. Buehrer, S. Parthasarathy, D. Kim, Y. Chen, A. Nguyen, and P. Dubey. Cache-conscious frequent pattern mining on a modern processor. In Proceedings of International Conference on Very Large Data Bases (VLDB) (to appear), 2005.
10. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations. In Proceedings of the ICDM workshop on frequent itemset mining implementations, 2003.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In Proceedings of the International Conference on Management of Data (SIGMOD), 2000.
12. J. Kim, X. Qin, and Y. Hsu. Memory characterization of a parallel data mining workload. In Proceedings of the Workshop on Workload Characterization (WWC), 1999.
13. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proceedings of the International Conference on Data Mining (ICDM), 2001.
14. J. Lo, L. Barroso, S. Eggers, K. Gharachorloo, H. Levy, and S. Parekh. An analysis of database workload performance on simultaneous multithreaded processors. In Proceedings of the International Symposium on Computer Architecture (ISCA), 1998.
15. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Berkeley Symposium on Mathematical Statistics and Probability, 1967.
16. S. Parthasarathy, M. Zaki, M. Ogihara, and W. Li. Parallel data mining for association rules on shared-memory systems. Knowledge and Information Systems Journal, 2001.
17. J. Quinlan. Programs for Machine Learning. 1993.
18. J. Rao and K. Ross. Cache conscious indexing for decision support in main memory. In Proceedings of the International Conference on Very Large Databases (VLDB), 1999.
19. J. Rao and K. Ross. Making B+ trees cache conscious in main memory. In Proceedings of the International Conference on Management of Data (VLDB), 2000.
20. A. Shatdal, C. Kant, and J. Naughton. Cache-conscious algorithms for relational query processing. In Proceedings of the International Conference on Very Large Databases (VLDB), 1994.
21. M. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal, special issue on Unsupervised Learning, 2001.
22. Y. Zhao and G. Karypis. Evaluation of hierarchical clustering algorithms for document datasets. In Proceedings of the International Conference on Information and Knowledge Management (CIKM), 2002.