A Model PM for Preprocessing and Data Mining Proper Process

Data Mining, as defined in 1996 by Piatetsky-Shapiro ([1]) is a step (crucial, but a step nevertheless) in a KDD (Knowledge Discovery in Data Bases) process. The Piatetsky-Shapiro's definition states that the KDD process consists of the following steps: developing an understanding of the application domain, creating a target data set, choosing the data mining task i.e. deciding whether the goal of the KDD process is classification, regression, clustering, etc..., choosing the data mining algorithm(s), data preprocessing, data mining (DM), interpreting mined patterns, deciding if a re-iteration is needed, and consolidating discovered knowledge.

[1]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[2]  Wojciech Ziarko,et al.  Variable Precision Rough Set Model , 1993, J. Comput. Syst. Sci..

[3]  Masahiro Inuiguchi,et al.  Two Directions toward Generalization of Rough Sets , 2003 .

[4]  Ernestina Menasalvas Ruiz,et al.  Data Mining as Generalization: A Formal Model , 2006, Foundations and Novel Approaches in Data Mining.

[5]  Z. Pawlak.  Rough Sets: Theoretical Aspects of Reasoning about Data , 1991 .

[6]  Yiyu Yao,et al.  Induction of Classification Rules by Granular Computing , 2002, Rough Sets and Current Trends in Computing.

[7]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[8]  Tsau Young Lin,et al.  Foundations and Novel Approaches in Data Mining , 2006, Studies in Computational Intelligence.

[9]  Ernestina Menasalvas Ruiz,et al.  Data Preprocessing and Data Mining as Generalization , 2008, Data Mining: Foundations and Practice.