A Pattern Search in Data Analysis

Chun-Hung Tzeng ； Fu-Shing Sun

《International Journal of Electronic Commerce Studies》 1卷2期 (2010/12) Pp. 117-137

並列摘要

This paper introduces a probabilistic model of two-class pattern recognition. The measurable sets are defined by a similarity, which is a reflexive and symmetric binary relation. The heuristic information model is formulated by a type of data clustering called representative clustering. The heuristic information about a data record is a data subset containing the record, which is computed by comparing the record with all representative records. For the corresponding classifiers, both Bayes and Neyman-Pearson Theorems are proved in this paper. In application, the knowledge discovering process searches for similarity and representative clustering in a training data set. The evaluation is extended to records in a testing data set. The experiment shows the trade-off between the number of representatives and classifier performance.

並列關鍵字

Pattern-recognition ； Similarity ； Representative ； Heuristic-information

參考文獻

L. Devroye and G. L. Gyoerffi. A Probabilistic Theory of Pattern Recognition. Springer, 1996.

R. Hastie, T. Tibshirami and J. Friedman. The Elements of Statistical Learning. Springer, 2001.

M. A. E. Maloof. Machine Learning and Data Mining for Computer Security. Springer-Verlag, 2006.

C.-H. Tzeng. A Theory of Heuristic Information in Game-Tree Search. Springer-Verlag, 1988.

S. Greco, B. Matarazzo, R. Slowinski, Rough set theory for multicriteria decision analysis, European Journal of Operational Research, 129(1), p 1-47, 2001, Elsevier.