论文信息 - On generating synthetic database for classification

On generating synthetic database for classification

In order to evaluate the performance of the large number of classifiers that have been developed and are being developed, proper generation of data to model the realistic world is an important preprocess. In a real world situation, the data often obeys some common distributions. In this paper, the methods and distribution models adopted to generate the data are explained in detail.

Hongjun Lu | Sam Yuan Sung | Ying Lu

[1] Youn-Long Lin,et al. Performance-driven soft-macro clustering and placement by preserving HDL design hierarchy , 1998, ISPD '98.

[2] Gomer Thomas,et al. Practitioner problems in need of database research , 1991, SGMD.

[3] J. Ross Quinlan,et al. Simplifying Decision Trees , 1987, Int. J. Man Mach. Stud..

[4] W. Scott Spangler,et al. Learning Useful Rules from Inconclusive Data , 1991, Knowledge Discovery in Databases.

[5] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.

[6] Meng Chang Chen,et al. Summary Data Estimation Using Decision Trees , 1991, Knowledge Discovery in Databases.

[7] Tomasz Imielinski,et al. An Interval Classifier for Database Mining Applications , 1992, VLDB.

[8] Tomasz Imielinski,et al. Database Mining: A Performance Perspective , 1993, IEEE Trans. Knowl. Data Eng..

[9] William Frawley,et al. Knowledge Discovery in Databases , 1991 .

[10] Tomasz Imielinski,et al. Research Directions in Knowledge Discovery , 1991, SIGMOD Rec..

[11] Andrew K. C. Wong,et al. Statistical Technique for Extracting Classificatory Knowledge from Databases , 1991, Knowledge Discovery in Databases.

[12] Arbee L. P. Chen,et al. An Efficient Algorithm for Deriving Compact Rules from Databases , 1995, DASFAA.

[13] Christos Faloutsos,et al. Efficient Similarity Search In Sequence Databases , 1993, FODO.