Klassifikation von Mustern

LITERATURVERZEICHNIS 463
[Flake und Lawrence, 2002] Flake, G.W., Lawrence, S. Efficient svm regression training with smo.
Machine Learning, 46(1-3):271–290, 2002.
[Fletcher, 1987] Fletcher, R. Practical Methods of Optimization. J. Wiley, Chichester, 2. Aufl., 1987.
[Flickner et al., 1995] Flickner, M., Swahney, H., Niblack, W., Ashley, J., Huang, Q., Dom, B., Gorkani,
M., Hafner, J., Lee, D., Petkovic, D., Steele, D., Yanker, P. Querying by image and video content:
The QBIC System. IEEE Trans. on Computers, 28:23–32, 1995.
[Foley, 1972] Foley, D.H. Considerations of sample and feature size. IEEE Trans. on Information
Theory, 18:618–626, 1972.
[Forney, 1973] Forney, G.D. The Viterbi algorithm. Proc. IEEE, 61:268–278, 1973.
[Frazer, 1957] Frazer, D.A.S. Nonparametric Methods in Statistics. J. Wiley, New York, 1957.
[Freund und Schapire, 1996] Freund, Y., Schapire, R.E. Experiments with a new boosting algorithm. In
Proc. 13th Int. Conf. Machine Learning, S. 148–156, 1996.
[Freund und Shapire, 1997] Freund, Y., Shapire, R.E. A decision theoretic generalization of online learning
and application to boosting. J. on Computer and Systems Sciences, 55:119–139, 1997.
[Frey und Jojic, 2003] Frey, B.J., Jojic, N. Transformation-invariant clustering using the EM-algorithm.
IEEE Trans. on Pattern Analysis and Machine Intelligence, 25:1–17, 2003.
[Friedman et al., 2000] Friedman, J., Hastie, T., Tibshirani, R. Additive logistic regression: A statistical
view of boosting. The Annals of Statistics, 38(2):337–374, 2000.
[Frigui und Nasraoui, 2004] Frigui, H., Nasraoui, O. Unsupervised learning of prototypes and attribute
weights. Pattern Recognition, 37:567–581, 2004.
[Fromm und Northouse, 1976] Fromm, F.R., Northouse, R.A. CLASS, a nonparametric clustering algorithm.
Pattern Recognition, 8:107–114, 1976.
[Frossyniotis et al., 2004] Frossyniotis, D., Likas, A., Stafylopatis, A. A clustering method based on
boosting. Pattern Recognition Letters, 25:641–654, 2004.
[Fu, 1968] Fu, K.S. Sequential Methods in Pattern Recognition and Machine Learning. Academic
Press, New York, 1968.
[Fu, 1974] Fu, K.S. Syntactic Methods in Pattern Recognition. Academic Press, New York, 1974.
[Fu, 1976] Fu, K.S. Tree languages and syntactic pattern recognition. In C.H. Chen, Hg., Pattern
Recognition and Artifical Intelligence, S. 257–291. Academic Press, New York, 1976.
[Fu, 1982] Fu, K.S. Syntactic Pattern Recognition and Applications. Prentice Hall, Englewood Cliffs,
N.J., 1982.
[Fu und Mendel, 1970] Fu, K.S., Mendel, J.M. Adaptive, Learning, and Pattern Recognition Systems.
Academic Press, New York, 1970.
[Fukunaga und Hostetler, 1975] Fukunaga, K., Hostetler, L.D. The estimation of the gradient of a density
function, with applications to pattern recognition. IEEE Trans. on Information Theory, 21:32–
40, 1975.
[Fukunaga und Narendra, 1975] Fukunaga, K., Narendra, P.M. A branch and bound algorithm for computing
k-nearest neighbours. IEEE Trans. on Computers, 24:750–753, 1975.
[Gader et al., 1996] Gader, P.D., Mohamed, M.A., Keller, J.M. Fusion of handwritten word classifiers.
Pattern Recognition Letters, 17:577–584, 1996.
[Ganti et al., 1999] Ganti, V., Gehrke, J., Ramakrishnan, R. Mining very large databases. IEEE Computer,
32(8):38–45, 1999.
[Gates, 1972] Gates, G.W. The reduced nearest neighbour rule. IEEE Trans. on Information Theory,
18:431–433, 1972.
[Gauvain und Lee, 1994] Gauvain, J.-L., Lee, C.-H. Maximum a posteriori estimation for multivariate
Gaussian mixture observations of Markov chains. IEEE Trans. on Speech and Audio Processing,
2:291–298, 1994.
[Gelfand et al., 1994] Gelfand, S., Ravishankar, C., Delp, E. An iterative growing and pruning algorithm
for classification tree design. IEEE Trans. on Pattern Analysis and Machine Intelligence, 13:302–
320, 1994.