Theoretical frameworks for data mining
暂无分享,去创建一个
[1] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[2] Heikki Mannila,et al. Inductive Databases and Condensed Representations for Data Mining , 1997, ILPS.
[3] Jorma Rissanen,et al. Hypothesis Selection and Testing by the MDL Principle , 1999, Comput. J..
[4] Heikki Mannila,et al. Verkamo: Fast Discovery of Association Rules , 1996, KDD 1996.
[5] Padhraic Smyth,et al. From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.
[6] Sunita Sarawagi,et al. Mining Surprising Patterns Using Temporal Description Length , 1998, VLDB.
[7] Jean-François Boulicaut,et al. Modeling KDD Processes within the Inductive Database Framework , 1999, DaWaK.
[8] Sylvia Richardson,et al. Markov Chain Monte Carlo in Practice , 1997 .
[9] AgrawalRakesh,et al. Mining association rules between sets of items in large databases , 1993 .
[10] Heikki Mannila,et al. A database perspective on knowledge discovery , 1996, CACM.
[11] Jean-François Boulicaut,et al. Querying Inductive Databases: A Case Study on the MINE RULE Operator , 1998, PKDD.
[12] Heikki Mannila,et al. Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.