Feature selection by markov chain Monte Carlo sampling - A bayesian approach

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3138, Issue , 2004, Pages 1034-1042

  Egmont Petersen, Michael ^a  

^a UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BAYESIAN NETWORKS; CHAINS; FEATURE EXTRACTION; MARKOV PROCESSES; PATTERN RECOGNITION;

BAYESIAN APPROACHES; BAYESIAN NETWORK CLASSIFIERS; MARKOV CHAIN MONTE CARLO METHOD; MARKOV CHAIN MONTE CARLO SAMPLINGS; MODEL SELECTION; PROPOSAL DISTRIBUTION; REGULARIZATION PRIORS; SAMPLE MODELS;

MONTE CARLO METHODS;

EID: 35048903577     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27868-9_114     Document Type: Article

References (18)

1. Foroutan, L, Sklansky, J.: Feature selection for automatic classification of non-gaussian data. IEEE Transactions on Systems, Man, and Cybernetics 17 (1987) 187-198
2. Kittler, J.: Computational problems of feature selection pertaining to large data sets. In: Proceedings of Pattern Recognition in Practice. (1980) 405-414
3. Jain, A., Zongker, D.: Feature selection: Evaluation, application, and small sample performance. IEEE transactions on pattern analysis and machine intelligence 19 (1997) 153-158
4. Kudo, M., Sklansky, J.: Comparison of algorithms that select features for pattern classifiers. Pattern recognition 33 (2000) 25-41
5. Waller, W.O., Jain, A.K.: On the monotonicity of the performance of a bayesian classifier. IEEE Transactions on Information Theory 24 (1978) 120-126
6. Egmont-Petersen, M., Talmon, J., Hasman, A., Ambergen, A.: Assessing the importance of features for multi-layer perceptrons. Neural networks 11 (1998) 623-635
7. Giudici, P., Castelo, R.: Improving markov chain monte carlo model search for data mining. Machine learning 50 (2003) 127-158
8. Madigan, D., York, J.: Bayesian graphical models for discrete-data. International statistical review 63 (1995) 215-232
9. Chandrasekaran, B.: Independence of measurements and the mean recognition accuracy. IEEE Transactions of Information Theory 17 (2002) 452-456
10. Trunk, G.:. A problem of dimensionality: a simple example. IEEE Transactions of Pattern Analysis and Machine Intelligence 1 (1979) 306-307
11. Forsythe, A., Engleman, L, Jennrich, R., May, P.R.A.: A stopping rule for variable selection in multiple regression. Journal of the American Statistical Association 68 (1973) 75-77
12. McLachlan, G.J.: Discriminant analysis and Statistical Pattern Recognition. John Wiley & Sons, New York (1992)
13. Siedlecki, W., Sklansky, J.: On automatic feature selection. Journal of Pattern Recognition and Artificial Intelligence 2 (1988) 197-220
14. Siedlecki, W., Sklansky, J.: A note on genetic algorithms for large-scale feature selection. Pattern Recognition Letters 10 (1989) 335-347
15. Cooper, G.F., Herskovits, E.: A bayesian method for the induction of probabilistic networks from data. Machine learning 9 (1992) 309-347
16. Chib, S., Greenberg, E.: Understanding the metropolis-hastings algorithm. American statistician 49 (1995) 327-335
17. Baesens, B., Egmont-Petersen, M., Castelo, R., Vanthienen, J.: Learning bayesian network classifiers for credit scoring using markov chain monte carlo search. In: Proceedings of the International Conference on Pattern Recognition, Piscataway, IEEE Computer Society (2002) 49-52
18. Friedman, N., Geiger, D., Goldszmidt, M.: Bayesian network classifiers. Machine learning 29 (1997) 131-163