Klassifikation von Mustern

LITERATURVERZEICHNIS 459
structures for improving performance of multimedia databases. ACM Computing Surveys, 33:322–
373, 2001.
[Borgelt und Kruse, 2003] Borgelt, C., Kruse, R. Operations and evaluation measures for learning possibilistic
graphical models. Artificial Intelligence, 148(1-2):385–418, 2003.
[Borotschnig et al., 2000] Borotschnig, H., Paletta, L., Prantl, M., Pinz, A. Appearance-based active
object recognition. Image and Vision Computing, 18:715–727, 2000.
[Bourne, 2003] Bourne, R.A. Explaining default intuitions using maximum entropy. Journal of Applied
Logic, 1:255–271, 2003.
[Braun und Weisbrod, 1993] Braun, H., Weisbrod, J. Evolving neural networks for application oriented
problems. In Proc. of the Second Annual Conference on Evolutionary Programming, S. 62–71.
Evolutionary Programming Society, San Diego, California, USA, 1993.
[Braun und Zagorski, 1994] Braun, H., Zagorski, P. ENZO-M – A hybrid approach for optimizing
neural networks by evolution and learning. In Proc. 3. Conference on Parallel Problem Solving
from Nature, S. 440–451. Springer, LNCS 866, Berlin, Heidelberg, 1994.
[Breiman, 1993] Breiman, L. Better subset selection using the non-negative garotte. Techn. Ber., University
of California, Berkeley, CA, 1993.
[Breiman, 1996] Breiman, L. Bagging predictors. Machine Learning, 24(2):123–140, 1996.
[Breiman, 1999] Breiman, L. Prediction games and arcing algorithms. Neural Computation, 11:1493–
1518, 1999.
[Breiman et al., 1984] Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J. Classification and Regression
Trees. Wadsworth Int., Belmont, CA, 1984.
[Breiman et al., 1977] Breiman, L., Meisel, W., Purcell, E. Variable kernel estimates of multivariate
densities. Technometrics, 19:261–270, 1977.
[Bron und Kerbosch, 1973] Bron, C., Kerbosch, J. Finding all cliques of an undirected graph. Communic.
of the Association for Computing Machinery, 16:575–577, 1973.
[Burbham und Anderson, 2002] Burbham, K.P., Anderson, D.R. Model Selection and Multi-Model Inference.
Springer, Berlin Heidelberg, 2002.
[Burges, 1998] Burges, C. A tutorial on support vector machines for pattern recognition. Data Mining
and Knowledge Discovery, 2(2):121–167, 1998.
[Cai und Liu, 2001] Cai, J., Liu, Z.-Q. Hidden Markov models with spectral features for 2D shape
recognition. IEEE Trans. on Pattern Analysis and Machine Intelligence, 23:1454–1458, 2001.
[Cai und Liu, 2002] Cai, J., Liu, Z.-Q. Pattern recognition using Markov random field models. Pattern
Recognition, 35:725–733, 2002.
[Campbell et al., 2003] Campbell, C., Lin, C.-J., Keerthi, S.S., Sanchez, V.D. Editorial: Special issue
on support vector machines. Neurocomputing, 55(1-2):1–3, 2003.
[Cha und Srihari, 2002a] Cha, S.-H., Srihari, S.N. A fast nearest neighbor search algorithm by filtration.
Pattern Recognition, 35:515–525, 2002a.
[Cha und Srihari, 2002b] Cha, S.-H., Srihari, S.N. On measuring the distance between histograms. Pattern
Recognition, 35:1355–1370, 2002b.
[Chana und Chinga, 2004] Chana, E.Y., Chinga, W.K. An optimization algorithm for clusterung using
weighted dissimilarity measures. Pattern Recognition, 37:943–952, 2004.
[Chang und Pavlidis, 1977] Chang, R.L.P., Pavlidis, T. Fuzzy decision tree algorithms. IEEE Trans. on
Systems, Man, and Cybernetics, 7:28–34, 1977.
[Chellappa und Chatterjee, 1985] Chellappa, R., Chatterjee, S. Classification of textures using Gaussian
Markov random fields. IEEE Trans. on Acoustics, Speech, and Signal Processing, 33:559–563,
1985.
[Chen, 1973] Chen, C.H. Statistical Pattern Recognition. Hayden, New York, 1973.
[Chen et al., 2000] Chen, J.-Y., Bouman, C.A., Dalton, J.C. Hierarchical browsing and search of large
image databases. IEEE Trans. on Image Processing, 9:442–455, 2000.
[Chen und Kundu, 1995] Chen, J.L., Kundu, A. Unsupervised texture segmentation using multichannel