The Dissimilarity Representation for Pattern Recognition: Foundations and Applications

Dissimilarity Representation for Pattern Recognition: The Foundations and Applications

Volumn 64, Issue , 2005, Pages 1-607

  Pekalska, Elibieta ^a   Duin, Robert P W ^a  

^a Delft University of Technology ^*  (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85131970312     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/5965     Document Type: Book

References (540)

1. Agarwala, R., Bafna, V., Farach, M., Paterson, M., and Thorup, M. (1999). On the approximability of numerical taxonomy (fitting distances by tree metrics). SIAM Journal on Computing, 28(3), 1073-1085.
2. Aha, D., Kibler, D., and Albert, M. (1991). Instance-based learning algo-rithms. Machine Learning, 6, 37-66.
3. Akaike, H. (1973). Information theory and an extension of the maximum likelihood principle. In International Symposium on Information Theory, pages 267-281.
4. Alpay, D., Dijksma, A., Rovnak, J., and de Snoo, H. (1997). Schur Func-tions, Operator Colligations, and Reproducing Kernel Pontryagin Spaces. Birkhauser Verlag, Basel-Boston-Berlin.
5. Anderberg, M. (1973). Cluster Analysis for Applications. Academic Press, New York, NY.
6. Anderson, T. and Bahadur, R. (1962). Classification into two multivariate normal population with different covariance matrices. Annals of Mathe-matical Statistics, 33, 420-431.
7. Arkadiev, A. and Braverman, E. (1964). Teaching a computer pattern recog-nition. Nauka.
8. Atkeson, C., Moore, A., and Schaal, S. (1997). Locally weighted learning. AI Review, 11, 11-73.
9. Avesani, P., Blanzieri, E., and Ricci, F. (1999). Advanced metrics for class-driven similarity search. In International Workshop on Database and Expert Systems Applications, pages 223-227, Italy.
10. Ayad, H., Basir, O., and Kamel, M. (2004). A probabilistic model us-ing information theoretic measures for cluster ensembles. In F. Roli, J. Kittler, and T. Windeatt, editors, Multiple Classifier Systems, LNCS, volume 3077, pages 144-153.
11. Ball, K. (1990). Isometric embedding in?p-spaces. European Journal of Combinatorics, 11, 305-311.
12. Banfield, J. and Raftery, A. (1993). Model-based gaussian and non-gaussian clustering. Biometrics, 49, 803-821.
13. Barnett, V. and Lewis, T. (1994). Outliers in statistical data. New York: Wiley, 3rd edition.
14. Barthelemy, J. and Guenoche, A. (1991). Trees and Proximity Representa-tions. Chichester: Wiley.
15. Bartkowiak, A. (2000). Identifying multivariate outliers by dynamic graphics-as applied to some medical data. In M. Ahsanullah and F. F. Yildirim, editors, Applied Statistical Science IV, pages 29-36, New York. Nova Science Publishers.
16. Bartkowiak, A. (2001). A semi-stochastic grand tour for identifying outliers and finding a clean subset. Biometrical Letters, 38(1), 11-31.
17. Bartkowiak, A. and Szustalewicz, A. (2000). Outliers-finding and classify-ing which genuine and which spurious. Computational Statistics, 15(1), 3-12.
18. Basri, R. and Jacobs, D. (1997). Constancy and similarity. Computer Vision and Image Understanding, 65(3), 447-449.
19. Basri, R., Costa, L., Geiger, D., and Jacobs, D. (1996). Distance metric between 3D models and 2D images for recognition and classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4), 465-470.
20. Basri, R., Costa, L., Geiger, D., and Jacobs, D. (1998). Determining the similarity of deformable shapes. Vision Research, 38, 2365-2385.
21. Baulieu, F. (1989). A classification of presence/absence based dissimilarity coefficients. Algebra Universalis, 20, 351-367.
22. Baulieu, F. (1997). Two variant axiom systems for presence/absence based dissimilarity coefficients. Journal of Classification, 14, 159-170.
23. Belkin, M. and Niyogi, P. (2002a). Laplacian eigenmaps and spectral tech-niques for embedding and clustering. In Advances in Neural Information Processing Systems, volume 14, pages 585-591. The MIT Press.
24. Belkin, M. and Niyogi, P. (2002b). Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6), 1373-1396.
25. Bellman, R. (1957). Dynamic Programming. Princeton University Press.
26. Belongie, S. and Malik, J. (2000). Matching with shape context. In IEEE Workshop on Content-based Access of Image and Video Libraries, pages 20-26.
27. Belongie, S., Malik, J., and Puzicha, J. (2002). Shape matching and object recognition using shape contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(24), 509-522.
28. Bennett, C., Gacs, P., Li, M., Vitanyi, P., and Zurek, W. (1998). Infor-mation distance. IEEE Transactions on Information Theory, IT-44(4), 1407-1423.
29. Bennett, K. and Mangasarian, O. (1992). Robust linear programming dis-crimination of two linearly inseparable sets. Optimization Methods and Software, 1, 23-24.
30. Bennett, K. and Mangasarian, O. (1999). Combining support vector and mathematical programming methods for induction. In B. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods, Support Vector Learning, pages 307-326. MIT Press, Cambridge, MA.
31. Berchtold, S., Ertl, B., Keim, D., Kriegel, H.-P., and Seidl, T. (1998). Fast nearest neighbor search in high-dimensional spaces. In International Conference on Data Engineering, Orlando, Florida.
32. Berg, C., Christensen, J., and Ressel, P. (1984). Harmonic Analysis on Semigroups. Springer-Verlag.
33. Bertsekas, D. (1995). Nonlinear Programming. Athena Scientific, Belmont, MA.
34. Bezdek, J. and Hathaway, R. (2002). VAT: A tool for visual assessment of (cluster) tendency. In International Joint Conference on Neural Net-works, pages 2225-2230, Piscataway, NJ. IEEE Press.
35. Bezdek, J. and Pal, N. (1998). Some new indexes of cluster validity. IEEE Transactions on Systems, Man and Cybernetics, 28(3), 301-315.
36. Bezdek, J., Keller, J., Krishnapuram, R., and Pal, N. (1999). Fuzzy Models and Algorithms for Pattern Recognition and Image Processing. Boston.
37. Bialynicki-Birula, A. (1976). Algebra liniowa z geometriq. PWN, Warszawa.
38. Billingsley, P. (1995). Probability and Measure. John Wiley & Sons, New York, 3rd edition.
39. Bilmes, J. (1997). A gentle tutorial on the em algorithm and its application to parameter estimation for gaussian mixture and hidden rnarkov mod-els. Technical Report ICSI-TR-97-021, Signal, Speech, and Language Interpretation Laboratory, University of Washington.
40. Birkholc, A. (1986). Analiza matematyczna. Funkcje wielu zmiennych. PWN, Warszawa.
41. Bishop (1995). Neural Networks for Pattern Recognition. Oxford University Press.
42. Bishop, C., Svensen, M., and Williams, C. (1996). GTM: A principled alter-native to the self-organizing map. In C. Von der Malsburg, C. Von Seelen, J. Vorbrggen, and B. Sendhoff, editors, International Conference on Ar-tificial Neural Networks, pages 165-170, Berlin. Springer-Verlag.
43. Bishop, C., Svensen, M., and Williams, C. (1998). Developments of the generative topographic mapping. Neurocomputing, 21, 203-224.
44. Blumenthal, L. (1936). Remarks concerning the Euclidean four-point prop-erty. Ergebnisse eines Math. Koll., 7, 8-10.
45. Blumenthal, L. (1953). Theory and Applications of Distance Geometry. Oxford University Press, Amen House, London.
46. Bognar, J. (1974). Indefinite Inner Product Spaces. Springer-Verlag, Berlin Heidelberg New York.
47. Bonsangue, M., van Breugel, F., and Rutten, J. (1998). Generalized metric spaces: Completion, topology and powerdomains via the Yoneda embed-ding. Theoretical Computer Science, 193, 1-51.
48. Bookstein, A., Klein, S., and Raita, T. (2001). Fuzzy Hamming distance: A new dissimilarity measure. In A. Amir and G. Landau, editors, CPM 2001: LNCS 2089, pages 86-97.
49. Borg, I. and Groenen, P. (1997). Modern Multidimensional Scaling. Springer-Verlag, New York.
50. Borgefors, G. (1986). Distance transformation in digital images. Compure Vision, Graphics and Image Processing, 34, 344-371.
51. Bourgain, J. (1985). On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52, 46-52.
52. Boyd, S. and Vandenberghe, L. (2003). Convex Optimization. Cambridge University Press.
53. Bradley, A. (1997). The use of the area under the ROC curve in the evalu-ation of machine learning algorithms. Pattern Recognition, 30(7), 1145-1159.
54. Bradley, P., Mangasarian, O., and Street, W. (1998). Feature selection via mathematical programming. INFORMS Journal on Computing, 10, 209-217.
55. Breiman, L. (1996a). Bagging predictors. Machine Learning, 24(2), 123-140.
56. Breiinan, L. (1996b). Bias, variance, and arcing classifiers. Technical Report 460, Statistic Department, University of California.
57. Breiman, L., Friedman, J., Olshen, R., and Stone, C. (1984). Classification and regression trees. Wadsworth & Brooks.
58. Bretagnolle, J., Dacunha Castelle, D., and Krivine, J. (1966). Lois stables et espaces lp. Ann. Inst. Henri Poincare, 11(3), 231-259.
59. Bruske, J. and Sommer, G. (1997). Topology representing network for intrinsic dimensionality estimation. In International Conference on Ar-tificial Neural Networks, Springer LNCS 1327, pages 595-600.
60. Buhmann, J. and Hofmann, T. (1994). A maximum entropy approach to pairwise data clustering. In International Conference on Pattern Recog-nition., volume 2, pages 207-212, Jerusalem, Israel.
61. Buhmann, J. and Hofmann, T. (1995). Hierarchical pairwise data clustering by mean-field annealing. In International Conference on Artificial Neural Networks, pages 197-202.
62. Bunke, H. and Sanfeliu, A., editors (1990). Syntactic and Structural Pattern Recognition Theory and Applications. World Scientific.
63. Bunke, H. and Shearer, K. (1997). On a relation between graph edit dis-tance and maximum common subgraph. Pattern Recognition Letters, 18(8), 689-694.
64. Bunke, H. and Shearer, K. (1998). A graph distance metric based on the maximal common subgraph. Pattern Recognition Letters, 19(3-4), 255-259.
65. Bunke, H., Gunter, S., and Jiang, X. (2001). Towards bridging the gap between statistical and structural pattern recognition: Two new concepts in graph matching. In International Conference on Advances in Pattern Recognition: Springer LNCS 2013, pages 1-11.
66. Bunke, H., Jiang, X., Abegglen, K., and Kandel, A. (2002). On the weighted mean of a pair of strings. Pattern Analysis and Applications, 5(1), 23-30.
67. Burges, C. (1998). Geometry and invariance in kernel based methods. In B. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods, Support Vector Learning. MIT Press.
68. Campbell, C. and Bennett, K. (2000). A linear programming approach to novelty detection. In Advances in Neural Information Processing Sys-tems, pages 395-401.
69. Cayley, A. (1841). On the theorem in the geometry of position. Cambridge Mathematical Journal, 2, 267-271.
70. Cech, E. (1966). Topological Spaces. Wiley, London.
71. Cha, S. and Srihari, S. (2000). Distance between histograms of angular measurements and its application to handwritten character similarity. In International Conference on Pattern Recognition, volume 2, pages 21-24.
72. Chabrillac, Y. and Crouzeix, J.-P. (1984). Definiteness and semidefiniteness of quadratic forms revisited. Linear Algebra and its Applications, 63(4), 283-292.
73. Chan, T. and Goldfarb, L. (1992). Primitive pattern learning. Pattern Recognition, 25(8), 883-889.
74. Chang, C.-C. and Lin, C.-J. (2001). LIBSVM: A library for support vector machines, http://www.csie.ntu.edu.tw/~cjlin/libsvm.
75. Chaudhuri, B. and Rosenfeld, A. (1996). On a metric distance between fuzzy sets. Pattern Recognition Letters, 17, 1157-1160.
76. Chaudhuri, B. and Rosenfeld, A. (1999). On a metric distance between fuzzy sets. Information Sciences, 118, 159-171.
77. Cheng, Y. (1995). Mean shift, mode seeking, and clustering. IEEE Trans-actions on Pattern Analysis and Machine Intelligence, 17(8), 790-799.
78. Chepoi, V. and Fichet, B. (2000). e-approximation via subdominants. J. Mathematical Psychology, 44, 600-616.
79. Cherkassky, V. and Mulier, F. (1998). Learning from data: Concepts, The-ory and Methods. John Wiley & Sons, Inc., New York, NY, USA.
80. Cho, D. and Miller, D. (2002). A Low-complexity Multidimensional Scaling Method Based on Clustering. Concept paper.
81. Chow, C. (1970). On optimum recognition error and reject tradeoff. IEEE Transactions on Information Theory, IT-16(1), 41-46.
82. Chung, K.-L. (2001). A Course in Probability Theory. Academic Press, New York, 3rd edition.
83. Cilibrasi, R. and Vitanyi, P. (2004). Automatic meaning discovery using Google, http://xxx.lanl.gov/abs/cs.CL/0412098.
84. Cilibrasi, R. and Vitanyi, P. (2005). Clustering by compression. IEEE Transactions on Information Theory, 41(4), 1523-1545.
85. Cilibrasi, R., Vitanyi, P., and de Wolf, R. (2004). Algorithmic clustering of music based on string compression. Computer Music Journal, 28(4), 49-67.
86. Cohen, J. and Farach, M. (1997). Numerical taxonomy on data: Experi-mental results. Journal of Computational Biology, 4(4).
87. Constantinescu, T. and Gheondea, A. (2001). Representations of Hermitian kernels by means of Krein spaces II. invariant kernels. Communications in Mathematical Physics, 216, 409-430.
88. Conway, B. (1990). A Course in Functional Analysis. Undergraduate Texts in Mathematics. Springer-Verlag, 2nd edition.
89. Corpet, F., Servant, F., Gouzy, J., and Kahn, D. (2000). Prodom and prodom-cg: Tools for protein domain analysis and whole genome com-parisons. Nucleid Acids Research, 28, 267-269.
90. Costa, L. d. F. and Cesar, R.M., J. (2001). Shape Analysis and Classifica-tion. CRC Press, Boca Raton.
91. Courrieu, P. (2002). Straight monotonic embedding of data sets in Eu-clidean spaces. Neural Networks, 15, 1185-1196.
92. Cover, T. and Hart, P. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1). 21-27.
93. Cox, T. and Cox, M. (1995). Multidimensional Scaling. Chapman & Hall, London.
94. Cox, T. and Cox, M. (2000). A General Weighted Two-Way Dissimilarity Coefficient. Journal of Classification, 17, 101-121.
95. Coxeter, H. (1998). Non-Euclidean Geometry. The Mathematical Associa-tion of America, Washington, DC, 6th edition.
96. Cristianini, N. and Shawe-Taylor, J. (2000). Support Vector Machines and other kernel-based learning methods. Cambridge University Press, UK.
97. Critchley, F. and Fichet, B. (1997). On (Super-)Spherical Distance Matrices and Two Results from Schoenberg. Linear Algebra and its Applications, 251, 145-165.
98. Crouzeix, J. and Ferland, J. (1982). Criteria for quasiconvexity and pseu-doconvexity: Relations and comparisons. Mathematical Programming, 23(2), 193-205.
99. Csiszar, I. (1967). Information-type measures of divergence of probability distributions and indirect observations. Studia Scientiarium Mathemati-carum Hungarica, 2, 299-318.
100. Dasarthy, B., editor (1991). Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques. IEEE Computer Society Press, Los Alamitos, CA.
101. Dasarthy, B. (1994). Minimal consistent set (MCS) identification for op-timal nearest neighbor decision systems design. IEEE Transactions on Systems, Man, and Cybernetics, 24(3), 511-517.
102. Day, M. (1944). Convergance, closure and neigbhoorhoods. Duke Mathe-matical Journal, 11, 181-199.
103. de Carvalho, F. (1994). New Approaches in Classification and Data Anal-ysis, chapter Proximity coefficients between Boolean symbolic objects, pages 387-394. Springer-Verlag.
104. de Carvalho, F. (1998). Data Science, Classification and Related Meth-ods, chapter Extension based proximities between constrained Boolean symbolic objects, pages 370-378. Springer-Verlag.
105. de Diego, I., Moguerza, J., and Munoz, A. (2004). Combining kernel in-formation for support vector classification. In F. Roli, J. Kittler, and T. Windeatt, editors, Multiple Classifier Systems, LNCS, volume 3077, pages 102-111.
106. de Ridder, D. and Duin, R. (1997). Sammon’s mapping using neural net-works: A comparison. Pattern Recognition Letters, 18(11-13).
107. de Ridder, D., Pekalska, E., and Duin, R. (2002). The economics of clas-sification: Error vs. complexity. In R. Kasturi, D. Laurendeau, and C. Suen, editors, International Conference on Pattern Recognition, vol-ume 3, pages 244-247, Quebec City, Canada.
108. de Ridder, D., Duin, R., Egmont-Petersen, M., van Vliet, L., and Verbeek, P. (2003a). Nonlinear image processing using artificial neural networks. Advances in Imaging and Electron Physics, 126, 351-450
109. de Ridder, D., Kouropteva, O., Okun, O., Pietikainen, M., and Duin, R. (2003b). Supervised locally linear embedding. In Joint Interna-tional Conferences: ICANN/ICONIP, Lecture Notes in Computer Sci-ence, vol. 2714, pages 333-341
110. de Soete, G. (1984a). Additive tree representations of incomplete dissimi-larity data. Quality and Quantity, 18, 387-393.
111. de Soete, G. (1984b). A least squares algorithm for fitting an ultrametric tree to a dissimilarity matrix. Pattern Recognition Letters, 2, 133-137.
112. de Soete, G. (1984c). Ultrametric tree representations of incomplete dis-similarity data. Journal of Classification, 1, 235-242.
113. de Soete, G. and Caroll, J. (1996). Clustering and Classification, chap-ter Tree and other Network Models for Representing Dissimilarity Data, pages 157-198. London: World Scientific
114. de Veld, D., Skurichina, M., Witjes, M., and et.al. (2003). Autofluorescence characteristics of healthy oral mucosa at different anatomical sites. Lasers in Surgery and Medicine, 23, 367-376.
115. Debnath, L. and Mikusinski, P. (1990). Introduction to Hilbert Spaces with Applications. Academic Press, San Diego.
116. DELVE (Website). Data for evaluating learning in valid experiments. Uni-versity of Toronto, Department of Computer Science, http://www.es.toronto.edu/~delve/.
117. Demartines, P. and Herault, J. (1997). Curvilinear component annalysis: A self-organizing neural network for nonlinear mapping of data sets. IEEE Transations on Neural Networks, 8(1), 148-154.
118. Dempster, A., Laird, N., and Rubin, D. (1977). Maximum likelihood from incomplete data via the ern algorithm. Journal of the Royal Statistical Society, Series B, 39(1), 1-38.
119. Denceux, T. and et al. (Website). Belief functions and pattern recognition: Matlab software, http://www.hds.utc.fr/~tdenoeux/software.htm.
120. Denoeux, T. and Masson, M.-H. (2004). EVCLUS: Evidential clustering of proximity data. IEEE Transations on Systems, Man and Cybernetics, 34(1), 95-109.
121. Devijver, P. and Kittler, J. (1982). Pattern recognition: A statistical ap-proach. Prentice/Hall, London.
122. Devroye, L., Gyorfi, L., and Lugosi, G. (1996). A Probabilistic Theory of Pattern Recognition. Springer-Verlag.
123. Deza, M. and Laurent, M. (1994). Applications of cut polyhedra. Journal of Computational and Applied Mathematics, 55(2), 217-247.
124. Deza, M. M. and Laurent, M. (1997). Geometry of Cuts and metrics. Springer-Verlag.
125. Domeniconi, C., Peng, J., and Gunopulos, D. (2002). Locally adaptive metric nearest-neighbor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(9), 1281-1285.
126. Domingos, P. (2000a). A unified bias-variance decomposition and its appli-cations. In International Conference on Machine Learning, pages 231-238. Morgan Kaufmann.
127. Domingos, P. (2000b). A unified bias-variance decomposition for zero-one and squared loss. In International Conference on Artificial Intelligence, pages 564-569, Austin, Texas. AAAI Press.
128. Domingos, P. and Pazzani, M. (1997). On the optimality of the simple bayesian classifier under zero-one loss. Machine Learning, 29(2-3), 103-130.
129. Donoho, D. and Grimes, C. (2003). Hessian eigenmaps: Locally linear em-bedding techniques for high-dimensional data. In Proceedings of the Na-tional Academy of Arts and Sciences, volume 100, pages 5591-5596.
130. Dritschel, M. and Rovnyak, J. (1996). Operators on indefinite inner product spaces. Lectures on Operator Theory and its Applications, Fields Institute Monographs, pages 141-232.
131. Dubuisson, M. and Jain, A. (1994). Modified Hausdorff distance for object matching. In International Conference on Pattern Recognition, volume 1, pages 566-568.
132. Duch, W. (2000). Similarity based methods: A general framework for classi-fication, approximation and association. Control and Cybernetics, 29(4), 937-968.
133. Duch, W., Naud, A., and Adamczak, R. (1998). A framework for similarity-based methods. In Polish Conference on Theory and Applications of Artificial Intelligence, pages 33-60, Lod’z.
134. Duch, W., Adamczak, R., and Diercksen, G. (2000). Classification, asso-ciation and pattern completion using neural similarity based methods. Applied Mathematics and Computer Science, 10(4), 101-120.
135. Duda, R., Hart, P., and Stork, D. (2001). Pattern Classification. John Wiley & Sons, Inc., 2nd edition.
136. Duin, R. (1999). Compactness and complexity of pattern recognition prob-lems. In International Symposium on Pattern Recognition’ In Memoriam Pierre Devijver’, pages 124-128, Royal Military Academy, Brussels.
137. Duin, R. (2002). The combining classifier: To train or not to train? In International Conference on Pattern Recognition, volume 2, pages 765-770, Quebec City, Canada.
138. Duin, R. and Pekalska, E. (2001). Complexity of dissimilarity based pattern classes. In Scandinavian Conference on Image Analysis, Bergen, Norway.
139. Duin, R. and Pekalska, E. (2002). Possibilities of zero-error recognition by dissimilarity representations. In J. Inesta and L. Mico, editors, Pattern Recognition in Information Systems, Allicante, Spain.
140. Duin, R. and Pekalska, E. (2005). Object representation, sample size and data set complexity. In T. Ho and M. Basu, editors, Data Complexity in Pattern Recognition, page to appear. Springer-Verlag.
141. Duin, R. and Tax, D. (1998). Classifier conditional posterior probabilities. In Advances in Pattern Recognition, LNCS, volume 1451, pages 611-619, Sydney. Joint I APR International Workshops on SSPR and SPR.
142. Duin, R. and Verveer, P. (1995). An evaluation of intrinsic dimension-ality estimators. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(1), 81-85.
143. Duin, R., de Ridder, D., and Tax, D. (1997). Experiments with object based discriminant functions; a featureless approach to pattern recogni-tion. Pattern Recognition Letters, 18(11-13), 1159 T166.
144. Duin, R., de Ridder, D., and Tax, D. (1998). Featureless pattern classifica-tion. Kybernetika, 34(4), 399-404.
145. Duin, R., Pekalska, E., and de Ridder, D. (1999). Relational Discriminant Analysis. Pattern Recognition Letters, 20(11-13), 1175-1181.
146. Duin, R., Roli, F., and de Ridder, D. (2002). A note on core research issues for statistical pattern recognition. Pattern Recognition Letters, 23(4), 493-499.
147. Duin, R., Pekalska, E., Paclfk, P., and Tax, D. (2004a). The dissimilar-ity representation, a basis for domain based pattern recognition? In L. Goldfarb, editor, Pattern representation and the future of pattern recognition, ICPR 2004 Workshop Proceedings, pages 43-56, Cambridge, United Kingdom.
148. Duin, R., Juszczak, P., de Ridder, D., Paclik, P., Pekalska, E., and Tax, D. (2004b). PR-Tools. Website, http://prtools.org.
149. Dunford, N. and Schwarz, J. (1958). Linear operators. Part I: General theory. Interscience Publishers, Inc., New York.
150. Edelman, S. (1999). Representation and Recognition in Vision. MIT Press, Cambridge.
151. Edelman, S. and Duvdevani-Bar, S. (1997). Similarity, connectionism, and the problem of representation in vision. Neural Computation, 9, 701-720.
152. Edelman, S., Cutzu, S., and Duvdevani-Bar, S. (1996). Similarity to refer-ence shapes as a basis for shape representation. Cognitive Science Con-ference.
153. Edelman, S., Cutzu, S., and Duvdevani-Bar, S. (1998). Representation is representation of similarities. Behavioral and Brain Sciences, 21, 449-498.
154. Effros, E. and Ruan, Z.-J. (2000). Operator Spaces. Clarendon Press, Oxford.
155. Eiben, A. E. S. J. (2003). Introduction to Evolutionary Computing. Springer.
156. Eiter, T. and Mannila, H. (1997). Distance measures for point sets and their computation. Acta Informatica, 34(2), 109-133.
157. Esposito, F., Malerba, D., Tamma, V., Bock, H., and Lisi, F. (2000). Anal-ysis of Symbolic Data, chapter Similarity and Dissimilarity. Springer-Verlag.
158. Everitt, B. and Rabe-Hesketh, S. (1997). The Analysis of Proximity Data. Arnold, London.
159. Everitt, B., Landau, S., and Leese, M. (2001). Cluster Analysis. Arnold, London, 4th edition.
160. Evgeniou, T., Pontil, M., and Poggio, T. (2000). Regularization networks and support vector machines. Advances in Computational Mathematics, 13(1), 1-50.
161. Faloutsos, C. and Lin, K.-I. (1995). FastMap: A fast algorithm for indexing, data-mining and visualization of tradditional and multimedia datasets. In ACM SIGMOD, International Conference on Management of Data, pages 163-174, California.
162. Farach, M., Kannan, S., and Warnow, T. (1995). A robust model for finding optimal evolutionary trees. Algorithmica, 13, 155-179.
163. Fault data (Website), http://www.sidanet.org.
164. Feller, W. (1968). An Introduction to Probability Theory and Its Applica-tions, volume 1. Wiley, New York, 3rd edition.
165. Feller, W. (1971). An Introduction to Probability Theory and Its Applica-tions, volume 2. Wiley, New York, 3rd edition.
166. Fichtenholz, G. (1997). Rachunek rozniczkowy i calkowy. Paristwowe Wydawnictwo Naukowe, Warszawa.
167. Fiedler, M. (1998). Ultrametric sets in Euclidean point spaces. Journal of Linear Algebra, 3, 23-30.
168. Fischer, B., Thomas Zoller, T., and Buhmann, J. (2001). Path based pair-wise data clustering with application to texture segmentation. In Interna-tional Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition, pages 235-250.
169. Fish contours (Website). University of Surrey, http://www.ee.surrey.ac.uk/Personal/F.Mokhtarian/.
170. Fraley, C. and Raftery, A. (1998). How many clusters? Which clustering method? Answers via model-based cluster analysis. Computer Journal, (41), 578-588.
171. Fred, A. and Jain, A. (2002a). Data clustering using evidence accumulation. In R. Kasturi, D. Laurendeau, and C. Suen, editors, International Con-ference on Pattern Recognition, pages 276-280, Quebec City, Canada.
172. Fred, A. and Jain, A. (2002b). Robust data clustering. In IEEE Computer Society Conference on Computer Vision and Pattern Recognition, pages 442-451, Madison-Wisconsin, USA.
173. Fred, A. and Jain, A. (2003). Evidence accumulation clustering based on the k-means algorithm. In Structural, Syntactic, and Statistical Pattern Recognition, LNCS vol. 2396, volume 2, pages 128-133. Springer-Verlag.
174. Fred, A. and Leitao, J. (2003). A new cluster isolation criterion based on dissimilarity increments. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(8), 944-958.
175. Freeman, H. and Glass, J. (1961). On the encoding of arbitrary geometric configurations. IRE Transactions, EC-10(2), 260-268.
176. Frelicot, C. and Emptoz, H. (1998). A pretopological approach for pattern classification with reject options. In A. Amin, D. Dori, P. Pudil, and H. Freeman, editors, Joint IAPR International Workshops on SSPR and SPR, LNCS, volume 1451, pages 707-715. Springer.
177. Freund, Y. and Schapire, R. E. (1996). Experiments with a new boosting algorithm. In Machine Learning: Proc. of the 13th International Con-ference, pages 148-156.
178. Friedman, J. (1994). Flexible metric nearest neighbor classification. Tech-nical Report 113, Stanford University Statistics Department.
179. Fu, K. (1982). Syntactic Pattern Recognition and Applications. Pretice-Hall.
180. Fujie, T. and Kojima, M. (1997). Semidefinite programming relaxation for nonconvex quadratic programs. Journal of Global Optimization, 10, 367-380.
181. Fukunaga, K. (1990). Introduction to Statistical Pattern Recognition. Aca-demic Press.
182. Gaal, S. (1964). Point-Set Topology. Academic Press, New York.
183. Garrett, P. (2003). Notes on functional analysis, http://www.math.umn.edu/~garrett/m/fun/.
184. Gascuel, O. (1997). BIONJ: An improved version of the NJ algorithm based on a simple model of sequence data. Molecular Biology and Evolution, 14, 685-695.
185. Gascuel, O. (2000). Data model and classification by trees: The minimum variance reduction (MVR) method. Journal of Classification, 17, 67-99.
186. Gastl, G. and Hammer, P. (1967). Extended topology, neighboorhoods and convergents. In Colloquium on Convexity 1965, pages 104-116, Copen-hagen. Kobenhavns Univ. Matematiske Inst.
187. Gavrila, D. (2000). Pedestrian detection from a moving vehicle. In European Conference on Computer Vision, Dublin, Ireland.
188. Gavrila, D. and Philomin, V. (1999). Real-time object detection for smart vehicles. In IEEE International Conference on Computer Vision, Kerkyra.
189. Gdalyahu, Y. and Weinshall, D. (1999). Flexible syntactic matching of curves and its application to automatic hierarchical classification of sil-houettes. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, 21(12).
190. Geman, S., Bienenstock, E., and Doursat, R. (1992). Neural networks and the bias/variance dilemma. Neural Computation, 4, 1-58.
191. Ghahramani, S. (2000). Fundmentals of Probability. Pretice Hall.
192. Gibbs, A. and Su, F. (2002). On choosing and bounding probability metrics. International Statistical Review, 70(3), 419-435.
193. Girosi, F. (1998). An equivalence between sparse approximation and sup-port vector machines. Neural Computation, 10(6), 1455-1480.
194. Gnilka, S. (1994). On extended topologies, i: Closure operators. Cornmen-tationes Mathernaticae, 34, 81 94.
195. Gnilka, S. (1995). On extended topologies, ii: Compactness, quasi-metrizability, symmetry. Commentationes Mathernaticae, 35, 147-162.
196. Gnilka, S. (1997). On continuity in extended topologies. Annales Societatis Mathernaticae Polonae. Seria I. Commentationes Mathernaticae, 37, 99-108.
197. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Ma-chine Learning. Kluwer Academic Publishers, Boston, MA.
198. Goldfarb, L. (1984). A unified approach to pattern recognition. Pattern Recognition, 17, 575-582.
199. Goldfarb, L. (1985). A new approach to pattern recognition. In L. Kanal and A. Rosenfeld, editors, Progress in Pattern Recognition, volume 2, pages 241-402. Elsevier Science Publishers BV.
200. Goldfarb, L. (1990). On the foundations of intelligent processes-I. An evolving model for pattern recognition. Pattern Recognition, 23(6), 595-616.
201. Goldfarb, L. (1992). What is distance and why do we need the metric model for pattern learning? Pattern Recognition, 25(4), 431-438.
202. Goldfarb, L. and Deshpande, S. (1997). What is a symbolic measurement process? In Systems, Man and Cybernetics, volume 5, pages 4139-4145, Orlando, Florida.
203. Goldfarb, L. and Golubitsky, O. (2001). What is a structural measurement process? Technical Report TR01-147, University of New Brunswick, Fredericton, Canada.
204. Goldfarb, L., Abela, J., Bhavsar, V., and Kamat, V. (1992). Transforma-tion systems are more economical and informative class descriptions than formal grammars. In International Conference on Pattern Recognition, volume 2, pages 660-664, The Netherlands.
205. Goldfarb, L., Abela, J., Bhavsar, V., and Kamat, V. (1995). Can a vector space based learning model discover inductive class generalization in a symbolic environment? Pattern Recognition Letters, 16(7), 719-726.
206. Goldfarb, L., Golubitsky, O., and Korkin, D. (2000a). What is a struc-tural representation? Technical Report TR00-137, University of New Brunswick, Fredericton, Canada.
207. Goldfarb, L., Golubitsky, O., and Korkin, D. (2000b). What is a structural representation in chemistry? Towards a unified framework for CADD. Technical Report TR00-138, University of New Brunswick, Fredericton, Canada.
208. Goldfarb, L., Gay, D., Golubitsky, O., and Korkin, D. (2004). What is a structural representation? second version. Technical Report TR04-165, University of New Brunswick, Fredericton, Canada.
209. Goldstone, R. (1994). Similarity, interactive activation, and mapping. Jour-nal of Experimental Psychology, 20, 3-28.
210. Goldstone, R. (1998). Hanging together: A connectionist model of sim-ilarity. In J. Grainger and A. Jacobs, editors, Localized Connectionist Approaches to Human Cognition, pages 283-325. NJ: Lawrence Erlbaum Associates, Mahwah.
211. Goldstone, R. (1999). Similarity. In R. Wilson and F. Keil, editors, MIT encyclopedia of the cognitive sciences, pages 763-765. MA: MIT Press, Cambridge.
212. Gordon, A. (1996). Clustering and Classification, chapter Hierarchical Clas-sification, pages 65-122. London: World Scientific.
213. Gould, N. and Toint, P. (2002). Numerical methods for large-scale non-convex quadratic programming. In A. Siddiqi and M. Kotcvara, editors, Trends in Industrial and Applied Mathematics, pages 149-179. Kluwer Academic Publishers, Dordrecht, The Netherlands.
214. Gowda, K. and Diday, E. (1991). Unsupervised learning through symbolic clustering. Pattern Recognition Letters, 12, 259-264.
215. Gower, J. (1971). A general coefficient of similarity and some of its prop-erties. Biometrics, 27, 25-33.
216. Gower, J. (1982). Euclidean distance geometry. Mathematical Scientist, (7), 1-14.
217. Gower, J. (1986). Metric and Euclidean Properties of Dissimilarity Coeffi-cients. Journal of Classification, 3, 5-48.
218. Gower, J. and Ross, G. (1969). Minimum spanning trees and single linkage cluster analysis. Applied Statistics, 18, 54-64.
219. Graepel, T., Herbrich, R., Bollmann-Sdorra, P., and Obermayer, K. (1999a). Classification on pairwise proximity data. In Advances in Neural Information System Processing 11, pages 438-444.
220. Graepel, T., Herbrich, R., Scholkopf, B., Smola, A., Bartlett, P., Muller, K.-R., Obermayer, K., and Williamson, R. (1999b). Classification on proximity data with LP-machines. In International Conference on Arti-ficial Neural Networks, pages 304-309.
221. Grenander, U. (1976). Pattern synthesis: Lectures in pattern theory, volume 1. Springer-Verlag.
222. Grenander, U. (1978). Pattern analysis: Lectures in pattern theory, volume 2. Springer-Verlag.
223. Grenander, U. (1981). Regular structures: Lectures in pattern theory, vol-ume 3. Springer-Verlag.
224. Greub, W. (1975). Linear Algebra. Springer-Verlag.
225. Griffiths, A. and Bridge, D. (1997). Towards a theory of optimal similarity measures. In Workshop on Case-Based Reasoning, United Kingdom.
226. Grother, P., Candela, G., and Blue, J. (1997). Fast implementations of nearest-neighbor classifiers. Pattern Recognition, 30(3), 459-465.
227. Griinwald, P. (2005). Advances in Minimum Description Length: Theory and Applications, chapter Minimum Description Length Tutorial. MIT Press.
228. Guerin-Dugue, A., Teissier, P., Delso Gafaro, G., and Herault, J. (1999). Curvilinear component analysis for high-dimensional data representation: II. examples of additional mapping constraints in specific applications. In Conference on Artificial and Natural Neural Networks, LNCS 1607, pages 635-644, Spain.
229. Guo, P., Chen, C., and Lyu, M. (2002). Cluster number selection for a small set of samples using the bayesian ying-yang model. IEEE Transactions on Neural Networks, 13(3), 757-763.
230. Haasdonk, B. (2005). Feature space interpretation of svms with indefinite kernels. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, 25(5), 482-492.
231. Hadlock, F. and Hoffman, F. (1978). Manhattan trees. Utilitas Mathemat-ical 13, 55-67.
232. Hagedoorn, M. and Veltkamp, R. (1999a). Reliable and efficient pattern matching using an affine invariant metric. International Journal of Com-puter Vision, 31(2-3), 103-115.
233. Hagedoorn, M. and Veltkamp, R. (1999b). A robust affine invariant metric on boundary patterns. International Journal of Pattern Recognition and AHicifial Intelligence, 13(8), 1151-1164.
234. Halkidi, M., Batistakis, Y., and Vazirgiannis, M. (2001). On clustering validation techniques. Intelligent Information Systems Journal, 17(2-3), 107-145.
235. Halmos, P. (1974). Measure Theory. Springer-Verlag, New York.
236. Hampel, F., Ronchetti, E., Rousseeuw, P., and Stahel, W. (1986). Robust Statistics the Approach Based on Influence Functions. John Wiley & Sons, New York.
237. Hand, D. (1997). Construction and Assesment of Classification Rules. John Wiley & Sons, Chester, England.
238. Hansen, J. and Heskes, T. (2000). General Bias/Variance decomposition with target independent variance of error functions derived from the ex-ponential family of distributions. In International Conference on Pattern Recognition, volume 2, pages 207-210, Barcelona, Spain.
239. Hart, P. (1968). The condensed nearest neighbor rule. IEEE Transactions on Information Theory, 14, 515-516.
240. Hartigan, J. (1975). Clustering Algorithms. Wiley, New York, NY.
241. Hastie, T. and Stuetzle, W. (1989). Principal curves. Journal of the Amer-ican Statistical Association, 84, 502-516.
242. Hastie, T. and Tibshirani, R. (1996). Discriminant adaptive nearest neigh-bor classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(6), 607-616.
243. Hastie, T., Tibshirani, R., and Friedman, J. (2001). The Elements of Sta-tistical Learning. Springer Verlag, New York Berlin Heidelberg.
244. Hathaway, R. and Bezdek, J. (2003). Visual cluster validity (VCV) for pro-totype generator clustering models. Pattern Recognition Letters, 24(9-10), 1563-1569.
245. Heiser, W. (1991). A generalized majorization method for least squares multidimensional scaling of pseudodistances that may be negative. Psy-chometrica, 56, 7-27.
246. Herault, J., Jausions-Picaud, C., and Guerin-Dugue, A. (1999). Curvilinear component analysis for high dimensional data representation: I. theoret-ical aspects and practical use in the presence of noise. In Conference on Artificial and Natural Neural Networks, LNCS 1607, pages 625-634, Spain.
247. Heskes, T. (1998). Bias/variance decompositions for likelihood-based esti-mators. Neural Computation, 10, 1425-1433.
248. Hettich, S., Blake, C., and Merz, C. (1998). UCI repository of Machine Learning databases. http://www.ics.uci.edu/~mlearn/MLRepository.html.
249. Hjort, P., Lisonek, P., Markvorsen, S., and Thomassen, C. (1998). Finite metric spaces of strictly negative type. Linear Algebra and Its Applica-tions, 270, 255-273.
250. Ho, T. (1998). The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, 20(8), 832-844.
251. Hofmann, T. and Buhmann, J. (1997). Pairwise data clustering by deter-ministic annealing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(1), 1-14.
252. Hofstadter, D. (1979). Godel, Escher, Bach-an Eternal Golden Braid. Basic Books.
253. Hoppner, F., Klawonn, F., Kruse, R., and Runkler, T. A. (1999). Fuzzy Cluster Analysis. Chichester, England.
254. Horn, R. and Johnson, C. (1991). Topics in Matrix Analysis. Cambridge University, Oxford.
255. Hotelling, H. (1933). Analysis of a complex of statistical variables into principal components. Journal of Educational Psychology, 24, 417-441.
256. Hoyle, D. and Rattray, M. (2003a). Limiting form of the sample covariance matrix eigenspectrum in pea and kernel pea. In S. Thrun, L. Saul, and B. Scholkopf, editors, Neural Information Processing Systems conference.
257. Hoyle, D. and Rattray, M. (2003b). Pea learning for sparse high-dimensional data. Europhysics Letters, 62(1), 117-123.
258. Hoyle, D. and Rattray, M. (2004a). Principal component analysis eigenvalue spectra from data with symmetry breaking structure. Physical Review, E(69).
259. Hoyle, D. and Rattray, M. (2004b). A statistical mechanics analysis of gram matrix eigenvalue spectra. In J. Shawe-Taylor and Y. Singer, ed-itors, Conference on Learning Theory, volume 3120 of Lecture Notes in Artificial Intelligence, pages 579-593.
260. Huber, P. (1981). Robust Statistics. John Wiley & Sons, New York.
261. Hughes, B. (2004). Trees and ultrametric spaces: A categorical equivalence. Advances in Mathematics, 189, 148-191.
262. Hughes, N. and Lowe, D. (2003). Artefactual structure from least squares multidimensional scaling. In Advances in Neural Information Processing Systems (NIPS 2002). MIT Press.
263. Huttenlocher, D., Klanderman, G., and William, J. (1993). Comparing images using the Hausdorff distances. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15, 850-863.
264. Ichino, M. and Yaguchi, H. (1994). General Minkowski metrics for mixed features type data analysis. IEEE Transaction on System, Man and Cybernetics, 24, 698-708.
265. Indyk, P. (2001). Algorithmic applications of low-distortion geometric em-beddings. In Annual Symposium on Foundations of Computer Science, pages 10-33, Las Vegas, Nevada.
266. Iohvidov, I., Krem, M., and Langer, H. (1982). Introduction to the Spectral Theory of Operators in Spaces with an Indefinite Metric. Akademie-Verlag, Berlin.
267. Isomap (Website). Isomap. http://isomap.stanford.edu/.
268. Jacobs, D., Weinshall, D., and Gdalyahu, Y. (2000). Classification with Non-Metric Distances: Image Retrieval and Class Representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(6), 583-600.
269. Jain, A. and Zongker, D. (1997). Feature selection: Evaluation, application, and small sample performance. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(2), 153-158.
270. Jain, A., Murthy, M., and Flynn, P. (1999). Data clustering: A review. ACM Computing Surveys, 31(3), 264-323.
271. Jain, A., Duin, R., and Mao, J. (2000). Statistical pattern recognition: A review. IEEE Transactions on Pattern Analysis and Machine Intelli-gence, 22(1), 4-37.
272. Jain, A. K. and Chandrasekaran, B. (1987). Dimensionality and sample size considerations in pattern recognition practice. In P. R. Krishnaiah and L. N. Kanal, editors, Handbook of Statistics, volume 2, pages 835-855. North-Holland, Amsterdam.
273. Jain, A. K. and Dubes, R. C. (1988). Algorithms for Clustering Data, Prentice Hall, Englewood Cliffs, NJ.
274. James, G. (2003). Variance and bias for general loss functions. Machine Learning, 51, 115-135.
275. Japkowicz, N., Myers, C., and Gluck, M. (1995). A novelty detection ap-proach to classification. In International Joint Conference on Artificial Intelligence, pages 518-523.
276. Jardine, N. and Sibson, R. (1971). Mathematical Taxonomy. Wiley, Lon-don.
277. Jensen, F. (1996). An Introduction to Bayesian Networks. Springer-Verlag, New York.
278. Jiang, M., Tseng, S., and Su, C. (2001). Two-phase clustering process for outliers detection. Pattern Recognition Letters, 22(6-7), 691-700.
279. Johnson, W., Lindenstrauss, J., and Schechtman, G. (1987). On Lipschitz embedding of finite metric spaces in low dimensional normed spaces. In J. Lindenstrauss and V. Milman, editors, Geometrical Aspects of Func-tional Analysis, Lecture Notes, 1267. Springer-Verlag.
280. Juszczak, P. and Duin, R. (2003). Uncertainty sampling for one-class clas-sifiers. In N. Chawla, N. Japkowicz, and A. Kolcz, editors, ICML Work-shop: Learning with Imbalanced Data Sets II., pages 81-88.
281. Karzanov, A. (1985). Metrics and undirected graphs. Mathematical pro-gramming, 32, 183-198.
282. Kashyap, R. (1982). Optimal choice of ar and ma parts in autoregressive moving average models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 4, 99-104.
283. Kegl, B. (2002). Intrinsic dimension estimation using packing numbers. In Neural Information Processing Systems, Vancouver, Canada.
284. Kelley, J. (1975). General Topology. Springer-Verlag, New York.
285. Kelly, J. (1970). Hypermetric spaces. In L. Kelly, editor, The Geometry of Metric and Linear Spaces, Lecture Notes in Mathematics, volume 490, pages 17-31. Springer.
286. Kernel Machines (Website), http://www.kernel-machines.org/.
287. Khalimsky, E. (1987). Topological structures in computer science. Journal of Applied Mathematics and Simulation, 1, 25-40.
288. Khalimsky, E., Kopperman, R., and Meyer, P. (1990). Computer graphics and connected topologies on finite ordered sets. Topology and its Appli-cations, 36, 1-17.
289. Kim, J. and Warnow, T. (1999). Tutorial on phylogenetic tree estimation. In Intelligent Systems for Molecular Biology, Heidelberg, Germany.
290. Kittler, J., Hatef, M., Duin, R., and Matas, J. (1998). On combining classi-fiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(3), 226-239.
291. Klein, E. and Thompson, A. (1984). Theory of Correspondences. John Wiley & Sons, New York.
292. Kohonen, T. (2000). Self-organizing maps. Springer-Verlag, 3rd edition.
293. Kong, T., Kopperman, R., and Meyer, P. (1991). A topological approach to digital topology. American Mathematical Monthly, 98, 901-917.
294. Kong, T., Kopperman, R., and Meyer, P. (1992). Special issue on digital topology. Topology and its Applications, 46.
295. Koppel, M. and Schler, J. (2004). Authorship verification as a one-class classification problem. In International Conference on Machine Learning.
296. Korkin, D. and Goldfarb, L. (2002). Multiple genome rearrangement: A general approach via the evolutionary genome graph. Bioinformatics, 18, 303-311.
297. Kothe, G. (1969). Topological vector spaces I. Springer-Verlag, Berlin, Heidelberg, New York.
298. Krauthgamer, R., Linial, N., and Magen, A. (2004). Metric embeddings-beyond one-dimensional distortion. Discrete and Computational Geom-etry, 31, 339-356.
299. Kreyszig, E. (1978). Introductory Functional Ananlysis with Applications. John Wiley & Sons, New York.
300. Kreyszig, E. (1991). Differential Geometry. Dover, New York.
301. Kruskal, J. (1964). Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis. Psychometrika, 29, 1-27.
302. Kruskal, J. (1977). Multidimensional scaling and other methods for dis-covering structure. In Statistical methods for digital computers, pages 296-339. John Wiley & Sons, New York.
303. Kruskal, J. and Wish, M. (1978). Multidimensional scaling. Sage Publica-tions, Newbury Park, CA.
304. Krysicki, W., Bartos, J., Dyczka, W., Krolikowska, K., and Wasilewski, M. (1995). Rachunek prawdopodobienstwa i statystyka matematyczna w zadoniach, czesc I i II. Pahstwowe Wydawnictwo Naukowe, Warszawa.
305. Kuncheva, L. (2004). Combining Pattern Classifiers. Methods and Algo-rithms. Wiley.
306. Kuncheva, L. and Whitaker, C. (2002). Using diversity with three vari-ants of boosting: Aggressive, conservative and inverse. In J. Kittler and F. Roli, editors, Multiple Classifier Systems, LNCS, volume 2364, pages 81-90. Springer-Verlag.
307. Kuncheva, L. and Whitaker, C. (2003). Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy. Machine Learning, 51(2), 181-207.
308. Kuncheva, L., Skurichina, M., and Duin, R. (2002). An experimental study on diversity for bagging and boosting with linear classifiers. Information Fusion, 3(2), 245-258.
309. Kurcyusz, S. (1982). Matematyczne podstawy teorii optymalizacji. PWN, Warszawa.
310. Lai, C., Tax, D., Pekalska, E., Duin, R., and Pachk, P. (2002). On com-bining one-class classifiers for image database retrieval. In J. Kittler and F. Roli, editors, Multiple Classifier Systems, LNCS, volume 2364, pages 212-221. Springer-Verlag.
311. Lai, C., Tax, D., Duin, R., Pekalska, E., and Paclfk, P. (2004). A study on combining image representations for image classification and retrieval. International Journal of Pattern Recognition and Artificial Intelligence, 18(5), 867-890.
312. Lam, L. (2000). Classifier combinations: Implementation and theoretical issues. In J. Kittler and F. Roli, editors, Multiple Classifier Systems, LNCS, volume 1857, pages 78-86.
313. Lance, G. and Williams, W. (1967). A general theory of classificatory sorting strategies. I. hierarchical systems. Computer Journal, (9), 373-380.
314. Landgrebe, D. (2003). Signal theory methods in multispectral remote sens-ing. John Wiley & Sons.
315. Lang, S. (2004). Linear algebra. Springer, 3rd edition.
316. Laub, J. and Muller, K.-R. (2004). Feature discovery in non-metric pairwise data. Journal of Machine Learning Research, pages 801-818.
317. Law, M. (Website). Manifold learning techniques-a collection of papers, http://wot.cse.msu.edu/~lawhiu/manifold/.
318. Lebourgeois, F. and Emptoz, H. (1996). Pretopological approach for su-pervised learning. In International Conference on Pattern Recognition, pages 256-260, Los Alamitos, CA. IAPR, IEEE Computer Society Press.
319. Lee, J., Lendasse, A., Donckers, N., and Verleysen, M. (2000). A robust nonlinear projection method. In European Symposium on Artificial Neu-ral Networks, pages 13-20, Bruges, Belgium.
320. Lee, J., Lendasse, A., and Verleysen, M. (2002). Curvilinear distance analy-sis versus isomap. In European Symposium on Artificial Neural Networks, pages 185-192, Bruges, Belgium.
321. Lee, M. (Website). Similarity judgements, http://www.psychology.adelaide.edu.au/members/staff/michaellee.html.
322. Lemin, A. (1985). Isometric embeddings of isosceles (non-archimedean) spaces in Euclidean spaces. Soviet Math. Dokl, 32(3), 740-744.
323. Leon, S. (1998). Linear Algebra with Applications. Prentice Hall, 6th edi-tion.
324. Levenshtein, V. (1966). Binary codes capable of correcting delations, inser-tions and reversals. Soviet Phys. Dokl, 6, 707-710.
325. Levina, E. and Bickel, P. (2001). The earth mover’s distance is the Mallows distance: Some insights from statistics. In International Conference on Computer Vision, Vancouver, Canada.
326. Li, M. and Vitanyi, P. (1997). An Introduction to Kolmogorov Complexity and Its Applications. Springer-Verlag, New York, 2nd edition.
327. Li, M., Chen, X., Li, X., Ma, B., and Vitanyi, P. (2003). The similarity metric. In ACM-SIAM Symposium on Discrete Algorithms, pages 863-872, Baltimore, Maryland, USA.
328. Ligteringen, R., Duin, R., Frietman, E., and Ypma, A. (1997). Machine diagnostics by neural networks, experimental setup. In P. J. H.E. Bal, H. Corporaal and J. Tonino, editors, Annual Conference of the Advanced School for Computing and Imaging, pages 185-190, The Netherlands.
329. Lin, D. (1998). An information-theoretic definition of similarity. In In-ternational Conference on Machine Learning, pages 296-304. Morgan Kaufmann, San Francisco, CA.
330. Linial, N. (2002). Finite metric spaces-combinatorics, geometry and al-gorithms. In International Congress of Mathematicians, pages 573-586, Beijing, China.
331. Liu, T.-L. and Geiger, D. (1999). Approximate tree matching and shape similarity. In International Conference on Computer Vision, pages 456-462, Greece.
332. LLE (Website). Locally linear embedding, http://www.cs.toronto.edu/~roweis/lle/.
333. Lowe, D. (1995). Similarity metric learning for a variable-kernel classifier. Neural Computation, 7(1), 72-85.
334. MacKay, D. (2003). Information Theory, Inference, and Learning Algo-rithms. Cambridge University Press.
335. MacQueen, J. (1967). Some methods for classification and analysis of multi-variate observations. In 5th Berkeley Symposium on Mathematical Statis-tics and Probability, pages 281-297, Berkeley, CA.
336. Malerba, D., Esposito, F., Gioviale, V., and V. Tamma (2001). Com-paring dissimilarity measures in symbolic data analysis. In Joint Confer-ences on’New Techniques and Technologies for Statistcs’ and’ Exchange of Technology and Know-how’, pages 473-481.
337. Malone, S. and Trosset, M. (2000). A study of the stationary configurations of the sstress criterion for metric multidimensional scaling. Technical Report 00-06, Department of Computational and Applied Mathematics, Rice University.
338. Malone, S., Tarazaga, P., and Trosset, M. (2002). Better initial configura-tions for metric multidimensional scaling. Computational Statistics and Data Analysis, 41, 143-156.
339. Mangasarian, O. (1999). Arbitrary-norm separating plane. Operations Re-search Letters, 24(1-2), 15-23.
340. Manly, B. (1994). Multivariate Statistical Methods. Chapman & Hall, En-glewood Cliffs, New Jersey.
341. Manning, C. and Schiitze, H. (1999). Foundations of Statistical Natural Language Processing. MIT Press, Cambridge, MA.
342. Mao, J. and Jain, A. (1995). Artificial neural networks for feature ex-traction and multivariate data projection. IEEE Transactions on Neural Networks, 6, 296-317.
343. Martinez, T. and Schulten, K. (1994). Topology representing networks. Neural Networks, 7, 507-523.
344. Marzal, A. and Vidal, E. (1993). Computation of normalized edit distance and applications. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(9), 926-932.
345. Mathworld (Website), http://mathworld.wolfram.com.
346. Matousek, J. (1990). Bi-Lipschitz embeddings into low dimensional Eu-clidean spaces. Commentationes Mathematicae Universitatis Carolinae, 31(3), 589-600.
347. Matousek, J. (2002). Lectures on Discrete Geometry. GTM Series. Springer.
348. McLachlan, G. and Basford, K. (1988). Mixture Models: Inference and Applications to Clustering. Marcel Dekker, New York.
349. MCS00 (2000). Multiple Classifier Systems, LNCS.
350. MCS02 (2002). Multiple Classifier Systems, LNCS.
351. Menger, K. (1931). New foundation of Euclidean geometry. American Journal of Mathematics, 53, 721-745.
352. Metropolis, N. and Ulam, S. (1949). The monte carlo method. Journal of the American Statistical Association, 44, 335-341.
353. MFEAT (Website). Multiple features database at UCI repository of Ma-chine Learning databases, http://www.ics.uci.edu/$\sim$mlearn/MLRepository.html.
354. Michalewicz, Z. (1999). Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag.
355. Mico, L. and Oncina, J. (1998). Comparison of fast nearest neighbour clas-sifiers for handwritten character recognition. Pattern Recognition Letters, 19(3-4), 351-356.
356. Mico, L., Oncina, J., and Carrasco, R. (1996). A fast branch & bound nearest neighbour classifier in metric spaces. Pattern Recognition Letters, 17(7), 731-739.
357. Mika, S., Ratsch, G., Weston, J., Scholkopf, A., Smola, A., and Muller, K.-R. (2003). Learning discriminative and invariant nonlinear features. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(5), 623-628.
358. Moler, M. (1993). A scaled conjugate gradient algorithm for fast supervised learning. Neural Networks, 6, 525-533.
359. Moreno-Seco, F., Mico, L., and Oncina, J. (2003). A modification of the LAESA algorithm for approximated k-nn clasification. Pattern Recogni-tion Letters, 24(1-3), 47-53.
360. Mori, G., Belongie, S., and Malik, H. (2001). Shape contexts enable efficient retrieval of similar shapes. In Computer Vision and Pattern Recognition, volume 1, pages 723-730.
361. Mottl, V., Dvoenko, S., Seredin, O., Kulikowski, C., and Muchnik, I. (2001a). Featureless pattern recognition in an imaginary Hilbert space and its application to protein fold classification. In International Work-shop on Machine Learning and Data Mining in Pattern Recognition, pages 322-336, Leipzig.
362. Mottl, V., Dvoenko, S., Seredin, O., Kulikowski, C., and Muchnik, I. (2001b). Featureless regularized recognition of protein fold classes in a hilbert space of pairwise alignment scores as inner products of amino acid sequences. Pattern Recognition and Image Analysis, Advances in Mathematical Theory and Applications, 11(3), 597-615.
363. Moya, M., Koch, M., and Hostetler, L. (1993). One-class classifier net-works for target recognition applications. In World Congress on Neural Networks, pages 797-801, Portland, OR. International Neural Network Society.
364. Munoz, A., de Diego, I., and Moguerza, J. (2003). Support vector machine classifiers for asymmetric, proximities. In International Conference on Artificial Neural Networks, pages 217-224, Istanbul, Turkey.
365. Munkres, J. (2000). Topology. Prentice-Hall, Englewood Cliffs, New Jersey, 2nd edition.
366. Murzin, A., Brenner, S., Hubbard, T., and Chothia, C. (1995). Scop: A structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology, 247, 536-540.
367. Nadler, M. and Smith, E. (1993). Pattern recognition engineering. John Willey & Sons Inc., New York.
368. Navarro, G. (2001). A guided tour to approximate string matching. ACM computing surveys, 33(1), 31-88.
369. Newsgroups data: A subset (Website), http://www.cs.toronto.edu/roweis/data.html.
370. Ng, A., Jordan, M., and Weiss, Y. (2002). On spectral clustering: Anal-ysis and an algorithm. In Advances in Neural Information Processing Systems, volume 14. The MIT Press.
371. Noble, B. and Daniel, J. (1988). Applied linear algebra. Prentice-Hall, Englewood Cliffs, New Jersey.
372. Ong, C., Mary, X., Canu, S., and(2004). Learning with non-positive kernels. In International Conference on Machine Learning, pages 639-646, Brisbane, Australia.
373. Pachk, P. and Duin, R. (2003a). Classifying spectral data using relational representation. In Spectral Imaging Workshop, Graz, Austria.
374. Pach'k, P. and Duin, R. (2003b). Dissimilarity-based classification of spec-tra: Computational issues. Real Time Imaging, 9(4), 237-244.
375. Paredes, R. and Vidal, E. (2000). A class-dependent weighted dissimilarity measure for nearest neighbor classification problems. Pattern Recognition Letters, 21(12), 1027-1036.
376. Parra, L., Deco, G., and Miesbach, S. (1996). Statistical independence and novelty detection with information preserving nonlinear maps. Neural Computation, 8, 260-269.
377. Parzen, E. (1962). On estimation of a probability function and mode. Annals of Mathematical Statistics, 33(3), 1065-1076.
378. Paulsen, V. (2002). Completely Bounded Maps and Operator Algebras. Cambridge Studies in Advanced Mathematics, 78. Cambridge University Press, Cambridge.
379. Pekalska, E. (2002). Dealing with the data flood. Mining data, text and multimedia, chapter Introduction to Multidimensional Scaling. STT/Beweton, The Hague, The Netherlands.
380. Pekalska, E. and Duin, R. (2000). Classifiers for dissimilarity-based pat-tern recognition. In International Conference on Pattern Recognition, volume 2, pages 12-16, Barcelona, Spain.
381. Pekalska, E. and Duin, R. (2001a). Automatic pattern recognition by sim-ilarity representations. Electronic Letters, 37(3), 159-160.
382. Pekalska, E. and Duin, R. (2001b). On combining dissimilarity represen-tations. In J. Kittler and F. Roli, editors, Multiple Classifier Systems, LNCS, volume 2096, pages 359-368. Springer Verlag.
383. Pekalska, E. and Duin, R. (2002a). Dissimilarity representations allow for building good classifiers. Pattern Recognition Letters, 23(8), 943-956.
384. Pekalska, E. and Duin, R. (2002b). Prototype selection for finding efficient representations of dissimilarity data. In R. Kasturi, D. Laurendeau, and C. Suen, editors, International Conference on Pattern Recognition, vol-ume 3, pages 37-40, Quebec City, Canada.
385. Pekalska, E. and Duin, R. (2002c). Spatial representation of dissimilarity data via lower-complexity linear and nonlinear mappings. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Interna-tional Workshop on SPR, + SSPR, LNCS, volume 2396, pages 470-478. Springer-Verlag.
386. Pekalska, E., Duin, R., Kraaijveld, M., and de Ridder, D. (1998a). An overview of Multidimensional Scaling techniques with application to Shell data. Technical Report TN-97-036-1, Pattern Recognition Group, Delft University of Technology, The Netherlands.
387. Pekalska, E., Duin, R., Kraaijveld, M., and de Ridder, D. (1998b). Multidi-mensional Scaling: Applications to Shell data. Technical Report TN-97-036-3, Pattern Recognition Group, Delft University of Technology, The Netherlands.
388. Pekalska, E., Duin, R., Kraaijveld, M., and de Ridder, D. (1998c). Multidi-mensional Scaling: Theoretical Aspects. Technical Report TN-97-036-2, Pattern Recognition Group, Delft University of Technology, The Nether-lands.
389. Pijkalska, E., de Ridder, D., Duin, R., and Kraaijveld, M. (1999). A new method of generalizing Sammon mapping with application to algorithm speed-up. In Conference of the Advanced School for Computing and Imag-ing, pages 221-228, Heijen, The Netherlands.
390. Pekalska, E., Paclik, P., and Duin, R. (2002b). A Generalized Kernel Ap-proach to Dissimilarity Based Classification. Journal of Machine Learn-ing Research, 2(2), 175-211.
391. Pekalska, E., Tax, D., and Duin, R. (2003). One-class LP classifier for dis-similarity representations. In S. T. S. Becker and K. Obermayer, editors, Advances in Neural Information Processing Systems 15, pages 761-768. MIT Press, Cambridge, MA.
392. Pekalska, E., Duin, R., Gunter, S., and Bunke, H. (2004b). On not making dissimilarities Euclidean. In T. Caelli, A. Amin, R. Duin, M. Kamel, and D. de Ridder, editors, Joint IAPR International Workshops on SSPR and SPR, LNCS, pages 1145-1154. Springer-Verlag.
393. Pekalska, E., Harol, A., Lai, C., and Duin, R. (2005a). Pairwise selection of features and prototypes. In International Conference on Computer Recognition Systems, pages 271-278, Rydzyna, Polanad.
394. Pekalska, E., Duin, R., and Pach'k, P. (2005b). Prototype selection for dissimilarity-based classifiers. Pattern Recognition, to appear.
395. Persoon, E. and Fu, K.-S. (1974). Shape Discrimination Using Fourier Descriptors. In 2nd International Conference on Pattern Recognition, pages 126-130, Copehagen, Denmark.
396. Pettis, K., Bailey, T., Jain, A., and Dubes, R. (1979). An intrinsic dimen-sionality estimator from near-neighbor information. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1(1), 25-37.
397. Pisier, G. (2003). Introduction to Operator Space Theory. London Math-ematical Society Lecture Note Series, 294. Cambridge University Press, Cambridge.
398. Press, W., Teukolsky, S., Vetterling, W., and Flannery, B. (1992). Numer-ical Recipes in C. Cambridge University Press, Cambridge.
399. Pryce, J. (1973). Basic methods of linear functional analysis. Hutchinson University Library, London.
400. Puzicha, J., Rubner, Y., Tomasi, C., and Buhmann, J. (1999a). Empiri-cal evaluation of dissimilarity measures for color and texture. In IEEE International Conference on Computer Vision, pages 1165-1173.
401. Puzicha, J., Hofmann, T., and Buhmann, J. (1999b). A theory of proximity based clustering: Structure detection by optimization. Pattern Recogni-tion, 33(4), 617-634.
402. Pyatkov, S. (2002). Operator Theory. Nonclassical problems. VSP, Utecht, Boston, Koln, Tokyo.
403. Raftery, A. (Website). Bayesian model selection papers, http://www.stat.Washington.edu/raftery/Research/Bayes/bayes_papers.html/0.
404. Ramasubramanian, V. and Paliwal, K. (2000). Fast nearest-neighbor search algorithms based on approximation-elimination search. Pattern Recogni-tion, 33(96), 1497-151.
405. Raudys, S. and Duin, R. (1998). On expected classification error of the Fisher linear classifier with pseudo-inverse covariance matrix. Pattern Recognition Letters, 19(5-6), 385-392.
406. Ripley, B. (1996). Pattern Recognition and Neural Networks. Cambridge University Press, Cambridge.
407. Rish, I. (2001). An empirical study of the naive Bayes classifier. In Work-shop on’’Empirical Methods in AT’ accompanying International Joint Conference on Artificial Intelligence.
408. Robert, C. (2001). The Bayesian Choice. Springer-Verlag, New York, 2nd edition.
409. Robinson’s notes (Website). http://www.math.nwu.edu/~clark/310/2001/metric.pdf.
410. Rodrigues, M. (2001). Invariants for Pattern Recognition and Classifica-tion. Series in Machine Perception and Artificial Intelligence, 42. World Scientific Publishing Co.
411. Roth, V., Laub, J., Buhmann, J., and Muller, K.-R. (2003). Going metric: Denoising pairwise data. In Advances in Neural Information Processing Systems, pages 841-856. MIT Press.
412. Rousseeuw, P. and Leroy, A. (1987). Robust Regression and Outlier Detec-tion. John Wiley & Sons, New York.
413. Rousseeuw, P. and van Zomeren, B. (1990). Unmasking multivariate out-liers and leverage points. Journal of the American Statistical Association, 85, 633-639.
414. Rovnyak, J. (1999). Methods of Krein space operator theory, toeplitz lec-tures given at tel aviv.
415. Roweis, S. and Saul, L. (2000). Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science, 290, 2323-2326.
416. Roweis, S., Saul, L., and Hinton, G. (2002). Global coordination of local linear models. Advances in Neural Information Processing Systems, 14.
417. Rubinstein, Y. and Hastie, T. (1997). Discriminative vs informative learn-ing. In Knowledge Discovery and Data Mining, pages 49-53.
418. Rubner, Y. (1999). Texture Metrics. Ph.D. thesis, Stanford University.
419. Rubner, Y., Tomasi, C., and Guibas, L. (1998a). The earth mover’s distance as a metric for image retrieval. Technical Report STAN-CS-TN-98-86, Department of Computer Science, Stanford University.
420. Rubner, Y., Tomasi, C., and Guibas, L. (1998b). A metric for distributions with applications to image databases. In IEEE International Conference on Computer Vision, pages 59-66, Bombay, India.
421. Rudin, W. (1986). Real and Complex Analysis. McGraw-Hill, New York, 3rd edition.
422. Rudin, W. (1991). Functional analysis. McGraw Hill, New York, 2nd edition.
423. Sadovnichij, V. (1991). Theory of Operators. Consultants Bureau, New York and London.
424. Saitou, N. and Nei, M. (1987). The neighbor-joining method: A new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4, 406-425.
425. Sammon Jr.. J. (1969). A nonlinear mapping for data structure analysis. IEEE Transactions on Computers, C-18, 401-409.
426. Sanchez, J., Pla, F., and Ferri, F. (1997). Prototype selection for the nearest neighbor rule through proximity graphs. Pattern Recognition Letters, 18, 507-513.
427. Sanchez, J., Pla, F., and Ferri, F. (1998). Improving the k-ncn classification rule through heuristic modifications. Pattern Recognition Letters, 19, 1165-1170.
428. Santini, S. and Jain, R. (1996). Gabor space and the development of preat-tentive similarity. In International Conference on Pattern Recognition, Vienna, Austria.
429. Santini, S. and Jain, R. (1997). Image databases are not databases with im-ages. In A. D. Bimbo, editor, International Conference on Image Analysis and Processing, Florence, Italy.
430. Santini, S. and Jain, R. (1999). Similarity measures. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(9), 871-883.
431. Saul, L. (2003). Think globally, fit locally: Unsupervised learning of low-dimensional manifolds. Journal of Machine Learning Research, 4, 119-155.
432. Scannell, J., Blakemore, C., and Young, M. (1995). Analysis of connectivity in the cat cerebral cortex. Journal of Neuroscience, 15, 1463-1483.
433. Schaback, R. (1999). Native hilbert spaces for radial basis functions i. In M. Buhman, D. Mache, M. Felten, and M. M.W., editors, Inter-national Series of Numerical Mathematics, volume 132, pages 255-282. Birkhauser-Verlag.
434. Schaback, R. (2000). A unified theory of radial basis functions (native hilbert spaces for radial basis functions ii),. Journal of Computational and Applied Mathematics, 121(1-2), 165-177.
435. Schaback, R. and Wendland, H. (2001). Approximation by positive definite kernels. In M. Buhman and D. Mache, editors, Advanved Problems in Constructive Approximation, International Series in Numerical Mathe-matics, volume 142, pages 203-221. Birkhauser-Verlag.
436. Schenker, A., Last, M., Bunke, H., and Kandel, A. (2003). Compari-son of distance measures for graph-based clustering of documents. In Graph Based Representations in Pattern Recognition, LNCS, volume 2726, pages 202-213. Springer.
437. Schoenberg, I. (1935). Remarks to maurice frechet’s article’sur la definition axiomatique d’une classe d’espace distancies vectoriellement applicable sur l’espace de hilbert. Annals of Mathematics, 36(3), 724-732.
438. Schoenberg, I. (1937). On certain metric spaces arising from Euclidean spaces by a change of metric and their imbedding in hilbert space. Annals of Mathematics, 38, 787-797.
439. Schoenberg, I. (1938a). Metric spaces and completely monotone functions. Annals of Mathematics, 39, 811-841.
440. Schoenberg, I. (1938b). Metric spaces and positive definite functions. Trans-actions on American Mathematical Society, 44, 522-536.
441. Scholkopf, B. (1997). Support vector learning. Ph.D. thesis, Verlag, Munich.
442. Scholkopf, B. (2000). The kernel trick for distances. In Advances in Neural Information Processing Systems, Vancouver, British Columbia, Canada.
443. Scholkopf, B. and Smola, A. (2002). Learning with Kernels. MIT Press, Cambridge.
444. Schdlkopf, B., Sung, K., Burges, C., Girosi, F., Niyogi, P., Poggio, T., and Vapnik, V. (1997a). Comparing support vector machines with gaussian kernels to radial basis function classifiers. IEEE Transations on Signal Processing.
445. Scholkopf, B., Smola, A., and Muller, K.-R. (1998a). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10(5).
446. Scholkopf, B., Mika, S., Burges, C., Knirsch, P., Muller, K.-R., Ratsch, G., and Smola, A. (1999a). Input space vs. feature space in kernel-based methods. IEEE Transations on Neural Networks.
447. Scholkopf, B., Smola, A., and Muller, K.-R. (1999b). Kernel principal component analysis. In B. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods, Support Vector Learning, pages 327-352. MIT Press, Cambridge, MA.
448. Scholkopf, B., Smola, A., Williamson, R., and Bartlett, P. (2000a). New support vector algorithms. Neural Computation, 12, 1207-1245.
449. Scholkopf, B., Platt, J., Smola, A., and Williamson, R. (2001). Estimating the support of a high-dimensional distribution. Neural Computation, 13, 1443-1471.
450. Schwarz, G. (1978). Estimating the dimension of a model. Annals of Statis-tics, 6, 461-464.
451. Scott, D. (2004). Outlier detection and clustering by partial mixture mod-eling. In Computational Statistics, Prague, Czech Republic.
452. Sebastian, T. and Kimia, B. (2001). Curves vs skeletons in object recog-nition. In International Conference on Image Processing, Thessaloniki, Greece.
453. Sebastian, T. and Kimia, B. (2003). Curves vs skeletons in object recogni-tion. Signal Processing, to appear.
454. Sebastian, T., Klein, P., and Kimia, B. (2001). Recognition of shapes by editing shock graphs. In International Conference on Computer Vision, pages 755-762.
455. Sebastian, T., Klein, P., and Kimia, B. (2002). Shock-based indexing into large shape databases. In European Conference on Computer Vision, volume 3, pages 731-746.
456. Sebastian, T., Klein, P., and Kimia, B. (2003). On aligning curves. IEEE Transactions on Pattern Analysis and Machine Intelligence, 25(1), 116-125.
457. Sharvit, D., Chan, J., Tek, H., and Kimia, B. (1998). Symmetry-based in-dexing of image databases. Journal of Visual Communication and Image Representation, 9(4), 366-380.
458. Shawe-Taylor, J. and Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge University Press, UK.
459. Shewchuk, J. (1994). An introduction to the conjugate gradient method without the agonizing pain. Technical report, chool of Computer Science, Carnegie Mellon University, Pittsburgh, PA.
460. Sierpiriski, W. (1952). General Topology. University of Toronto Press, Toronto.
461. SIGIR (Website). Sigir, special interest group on information retrieval, http://www.sigir.org/.
462. Simard, P., Le Cun, Y., and Denker, J. (1993). Efficient pattern recognition using a new transformation distance. In Advances in Neural Information Processing Systems, pages 50-58, Canada.
463. Simard, P., Le Cun, Y., Denker, J., and Victorri, B. (1998). Transforma-tion Invariance in Pattern Recognition-Tangent Distance and Tangent Propagation, volume 1524, pages 239-274. Springer, Heidelberg.
464. Skurichina, M. (2001). Stabilizing Weak Classifiers. Ph.D. thesis, Delft University of Technology, Delft, The Netherlands.
465. Skurichina, M. and Duin, R. (2003). Combining different normalizations in lesion diagnostics. In O. Kaynak, E. Alpaydin, E. Oja, and L. Xu, editors, Artificial Neural Networks and Information Processing, Supplementary Proceedings ICANN/ICONIP, pages 227-230, Istanbul, Turkey.
466. Sneath, P. and Sokal, R. (1973). Numerical Taxonomy. W.H. Freeman, San Francisko, California.
467. Stadler, B. and Stadler, P. (2001a). Basic properties of filter convergence spaces. Technical report, Institute for Theoretical Chemistry and Struc-tural Biology, University of Vienna, Austria.
468. Stadler, B. and Stadler, P. (2001b). Higher separation axioms in general-ized closure spaces. Annales Societatis Mathematicae Polonae. Series I. Commentationes Mathematicae, submitted.
469. Stadler, B. and Stadler, P. (2002). Basic properties of closure spaces. Tech-nical report, Institute for Theoretical Chemistry and Structural Biology, University of Vienna, Austria.
470. Stadler, B., Stadler, P., Wagner, G., and Fontana, W. (2001). The topol-ogy of the possible: Formal spaces underlying patterns of evolutionary change. Journal of Theoretical Biology, 213(2), 241-274.
471. Stadler, B., Stadler, P., Shpak, M., and Wagner, G. (2002). Recombination spaces, metrics, and pretopologies. Zeitschrift filr Physikalische Chemie, 216,217-234.
472. Stanfill, C. and Waltz, D. (1986). Toward memory-based reasoning. Com-munications of ACM, 29, 1213-1228.
473. Stephen, G. (1998). String Searching Algorithms. World Scientific Publish-ing Company, 2nd edition.
474. Strauss, R. (Website). http://www.biol.ttu.edu/Strauss/Matlab/matlab.htm.
475. Strehl, A. (2002). Relationship-based Clustering and Cluster Ensembles for High-dimensional Data Mining. Ph.D. thesis, University of Texas at Austin, USA.
476. Strehl, A. and Ghosh, J. (2002a). Cluster ensembles-a knowledge reuse framework for combining multiple partitions. Journal on Machine Learn-ing Research, 3, 583-617.
477. Strehl, A. and Ghosh, J. (2002b). Cluster ensembles-a knowledge reuse framework for combining partitionings. In Conference on Artificial In- telligence, pages 93-98, Edmonton.
478. Strehl, A., Ghosh, J., and Mooney, R. (2000). Impact of similarity measures on web-page clustering. In National Conference on Artificial Intelligence: Workshop of Artificial Intelligence for Web Search, pages 58-64, Austin, Texas, USA. AAAI.
479. Struik, D. (1988). Lectures on Classical Differential Geometry. Dover, New York.
480. Taneja, I. (1989). On generalized information measures and their applica-tions. In P. Hawkes, editor, Advances in Electronics and Electron Physics, volume 76, pages 327-413.
481. Taneja, I. (1995). New developments in generalized information measures. In P. Hawkes, editor, Advances in Imaging and Electron Physics, vol-ume 91, pages 37-135.
482. Taneja, I. (Website). Generalized information measures and their applica-tions-online book, http://mtm.ufsc.br/~taneja/book/book.html.
483. Tarassenko, L., Hayton, P., and Brady, M. (1995). Novelty detection for the identification of masses in mammograms. In International IEE Con-ference on Artificial Neural Networks, volume 409, pages 442-447.
484. Tax, D. (2001). One-class classification. Concept-learning in the absence of counter-examples. Ph.D. thesis, Delft University of Technology, The Netherlands.
485. Tax, D. (2003). DD-Tools, a Matlab toolbox for data description, outlier and novelty detection.
486. Tax, D. and Duin, R. (1999). Support vector domain description. Pattern Recognition Letters, 20(11-13), 1191-1199.
487. Tax, D. and Duin, R. (2001). Combining one-class classifiers. In J. Kittler and F. Roli, editors, Multiple Classifier Systems, LNCS, volume 2096, pages 299-308. Springer Verlag.
488. Tax, D. and Duin, R. (2002). Uniform object generation for optimizing one-class classifiers. Journal for Machine Learning Research, 2(2), 155-173.
489. Tax, D. and Duin, R. (2004). Support vector data description. Machine Learning, 54(1), 45-56.
490. Tax, D. and Muller, K.-R. (2004). A consistency-based model selection for one-class classification. In International Conference on Pattern Recogni-tion, volume 2, pages 363-366, Cambridge, UK.
491. Tch, Y. and Roweis, S. (2003). Automatic alignment of local representa-tions. Advances in Neural Information Processing Systems, 15.
492. Tenenbaum, J., de Silva, V., and Langford, J. (2000). A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500), 2319-2323.
493. Terra, E. and Clarke, C. (2003). Frequency estimates for statistical word similarity measures. In Human Language Technology and North Amer-ican Chapter of Association of Computational Linguistics Conference, pages 244-251.
494. Texture data (Website). ftp://whitechapel.media.mit.edu/pub/VisTex/.
495. Thayananthan, A., Stenger, B., Torr, P., and Cipolla, R. (2003). Shape context and chamfer matching in cluttered scenes. In IEEE Conference on Computer Vision and Pattern Recognition, pages 127-133, Wisconsin.
496. Tibshirani, R., Walther, G., and Hastie, T. (2001). Estimating the num-ber of clusters in a data set via the gap statistic. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 63(2), 411-423.
497. Tipping, M. (2000). The relevance vector machine. In Advances in Neural Information Processing Systems, San Mateo, CA.
498. Tipping, M. and Bishop, C. (1999). Mixtures of probabilistic principal component analysers. Neural Computation, 11(2), 443-482.
499. Topchy, A., Minaei, B., Jain, A., and Punch, W. (2004). Adaptive clustering ensembles. In R. Kasturi, D. Laurendeau, and C. Suen, editors, Interna-tional Conference on Pattern Recognition, Cambridge,United Kingdom.
500. Torgerson, W. (1967). Theory and Methods of Scaling. John Wiley & Sons.
501. Torsello, A. and Hancock, E. (2003). Computing approximate tree edit distance using relaxation labeling. Pattern Recognition Letters, 24(8), 1089 1097.
502. Trosset, M. and Mathar, R. (2000). Optimal dilations for metric multidi-mensional scaling. In Statistical Computing Section, American Statistical Association.
503. Tukey, J. (1960). A survey of sampling from contaminated distributions. In I. Olkin, S. Ghurye, W. Hoeffding, W. Madow, and H. Mann, editors, Contributions to Probability and Statistics. Essays in Honor of Harold Hotelling, pages 448-485. Stanford University Press, Stanford, CA.
504. Tversky, A. (1977). Features of similarity. Psychological Review, 84(4), 327-352.
505. van der Heiden, F., Duin, R., de Ridder, D., and Tax, D. (2004). Classifica-tion, Parameter Estimation, State Estimation: An Engineering Approach Using MatLab. Wiley, New York.
506. Vapnik, V. (1995). The Nature of Statistical Learning Theory. Springer Verlag.
507. Vapnik, V. (1998). Statistical Learning Theory. John Wiley & Sons, Inc.
508. Vasconcelos, N. and Kunt, M. (2000). Content-based retrieval from im-age databases: Current solutions and future directions. In International Conference on Image Processing, Thessaloniki, Greece.
509. Vasconcelos, N. and Lippman, A. (2000). A unifying view of image sim-ilarity. In International Conference on Pattern Recognition, Barcelona, Spain.
510. Veltkamp, R. (2001). Shape matching: Similarity measures and algorithms. Technical Report UU-CS-2001-03, Utrecht University, the Netherlands.
511. Veltkamp, R. and Hagedoorn, M. (1999). State-of-the-art in shape match-ing. Technical Report UU-CS-1999-27, Utrecht University, the Nether-lands.
512. Verma, R. (1991). A Metric Approach to Isolated Word Recognition. Mas-ter’s thesis, Department of Computer Science, University of Toronto.
513. Vidal, E., Marzal, A., and P., A. (1995). Fast computation of normalized edit distances. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(9), 899-902.
514. Vitanyi, P. (2005). Universal similarity. In IEEE ITSOC Information Theory Workshop on Coding and Complexity, Rotorua, New Zealand.
515. von Luxburg, U. and Bousquet, O. (2003). Distance-based classification with Lipschitz functions. In B. Scholkopf and M. Warmuth, editors, Annual Conference on Computational Learning Theory, pages 314-328, Berlin-Heidelberg, Germany. Springer Verlag.
516. von Luxburg, U. and Bousquet, O. (2004). Distance-based classification with Lipschitz functions. Journal of Machine Learning Research, 5, 669-695.
517. Wagner, R. and Fisher, M. (1974). The string-to-string correction problem. Journal of the Association for Computing Machinery, 21(1), 168-173.
518. Wahba, G. (1999). Support vector machines, reproducing kernel Hilbert spaces and the randomized GACV. In B. Scholkopf, C. Burges, and A. Smola, editors, Advances in Kernel Methods, Support Vector Learning, pages 69-88. MIT Press, Cambridge, MA.
519. Watanabe, S. (1974). Pattern Recognition, Human and Mechanical. Aca-demic Press, New York.
520. Webb, A. (1995). Multidimensional scaling by iterative majorization using radial basis functions. Pattern Recognition, 28(5), 753-759.
521. Webb, A. (1997). Radial basis functions for exploratory data analysis: An iterative majorisation approach for Minkowski distances based on multidimensional scaling. Journal of Classification, 14(2), 249-268.
522. Webster dictionary (Website), http://www.m-w.com.
523. Wells, J. and Williams, L. (1975). Embeddings and Extensions in Analysis. Springer-Verlag, Berlin.
524. Werman, M. and Weinshall, D. (1995). Similarity and affine invariant dis-tance between 2D point sets. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8).
525. Wharton, C., Holyoak, K., Downing, P.E., Lange, T., and Wickens, T. (1992). The story with reminding: Memory retrieval is influenced by analogical similarity. In Annual Conference of the Cognitive Science So-ciety, pages 588-593, Blomington.
526. Wilks, S. (1962). Mathematical Statistics. John Wiley & Sons, Inc., New York-London.
527. Willard, S. (1970). General Topology. Addison-Wesley Publishing Com-pany.
528. Wilson, C. and Garris, M. (1992). Handprinted character database 3. Tech-nical report, National Institute of Standards and Technology.
529. Wilson, D. and Martinez, T. (1997). Improved heterogeneous distance functions. Journal of Artificial Intelligence Research, 6, 1-34.
530. Wilson, R. and Martinez, T. (2000). Reduction techniques for instance-based learning algorithms. Machine Learning, 38(3), 257-286.
531. Wood, J. (1996). Invariant pattern-recognition: A review. Pattern Recog-nition, 29(1), 1-17.
532. Younes, L. (1998). Computable elastic distances between shapes. SIAM Journal on Applied Mathematics, 58(2), 565-586.
533. Younes, L. (1999). Optimal matching between shapes via elastic deforma-tions. Image and Vision Computing, 17(5-6), 381-389.
534. Young, G. and Householder, A. (1938). Discussion of a set of points in terms of their mutual distances. Psychometrika, 3, 19-22.
535. Ypma, A. and Duin, R. (1998). Support objects for domain approximation. In International Conference on Artificial Neural Networks, pages 719-724, Skovde, Sweden. Springer, Berlin.
536. Ypma, A., Ligteringen, R., Frietman, E., and Duin, R. (1997). Recognition of bearing failures using wavelets and neural networks. In British Sympo-sium on Applications of Time-Frequency and Time-Scale Methods, pages 69-72, University of Warwick, Coventry, UK.
537. Zahn, C. and Roskies, R. (1972). Fourier Descriptors for Plane Closed Curves. IEEE Transactions, C-21(3), 269-281.
538. Zavrel, J. (1997). An empirical re-examination of weighted voting for k-nn. In Belgian-Dutch Conference on Machine Learning, pages 139-148, Tilburg, The Netherlands. Springer, Berlin.
539. Zha, H. and Zhang, Z. (2003). Isometric embedding and continuum isomap. In International Conference on Machine Learning, Washington, DC.
540. Zhu, S. and Yuille, A. (1996). Forms: A flexible object recognition and modeling system. International Journal on Computer Vision, 20(3), 187-212.