A k-winner-takes-all classifier for structured data

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2821, Issue , 2003, Pages 342-354

  Jain, Brijnesh J ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA RECORDING; HEURISTIC METHODS; MATHEMATICAL MODELS; NEURAL NETWORKS; PATTERN RECOGNITION; PROBLEM SOLVING; ARTIFICIAL INTELLIGENCE; COMPARATORS (OPTICAL); MEMBERSHIP FUNCTIONS; MODEL STRUCTURES; MOTION COMPENSATION; TEXT PROCESSING;

EXACT ALGORITHMS; GRAPH MATCHING PROBLEMS; K-NEAREST NEIGHBOR (KNN) CLASSIFIERS; K-WINNER-TAKES-ALL (KWTA) CLASSIFIERS; HANDWRITTEN DIGIT; K NEAREST NEIGHBOR (KNN); K-NEAREST NEIGHBORS; K-NN CLASSIFIER; STRUCTURAL SIMILARITY; STRUCTURED DATA;

GRAPH THEORY; NEAREST NEIGHBOR SEARCH;

EID: 9444228166     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39451-8_25     Document Type: Conference Paper

References (29)

1. A.P. Ambler, H.G. Barrow, C.M. Brown, R.M. Burstall, and R. J. Popplestone. A versatile computer-controlled assembly system. In International Joint Conference on Artificial Intelligence, pages 298-307. Stanford University, California, 1973.
2. H. Barrow and R. Burstall. Subgraph isomorphism, matching relational structures and maximal cliques. Information Processing Letters, 4:83-84, 1976.
3. I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo. The maximum clique problem. In D.-Z. Du and P.M. Pardalos, editors, Handbook of Combinatorial Optimization, volume 4, pages 1-74. Kluwer Academic Publishers, Boston, MA, 1999.
4. W.J. Christmas, J. Kittler, and M. Petrou. Structural matching in computer vision using probabilistic relaxation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 17(8):749-764, 1995.
5. M.A. Eshera and K.S Fu. An image understanding system using attributed symbolic representation and inexact graph-matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 8(5):604-618, 1986.
6. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979.
7. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(4):377-388, 1996.
8. S. Günter and H. Bunke. Adaptive self-organizing map in the graph domain. In H. Bunke and A. Kandel, editors, Hybrid Methods in Pattern Recognition, pages 61-74. World Scientific, 2002.
9. S. Günter and H. Bunke. Self-organizing map for clustering in the graph domain. Pattern Recognition Letters, 23:401-417, 2002.
10. J.J. Hopfield and D.W. Tank. Neural computation of decisions in optimization problems. Biological Cybernetics, 52:141-152, 1985.
11. A. Jagota. Approximating maximum clique with a Hopfield network. IEEE Trans. Neural Networks, 6:724-735, 1995.
12. B.J. Jain and F. Wysotzki. Fast winner-takes-all networks for the maximum clique problem. In 25th German Conference on Artificial Intelligence, pages 163-173. Springer, 2002.
13. B.J. Jain and F. Wysotzki. A novel neural network approach to solve exact and inexact graph isomorphism problems. In Proc. of the International Conference on Artificial Neural Networks (ICANN 2003). Springer-Verlag, 2003.
14. K. Koutroumbas and N. Kalouptsidis. Qualitative analysis of the parallel and asynchronous modes of the hamming network. IEEE Transactions on Neural Networks, 15(3):380-391, 1994.
15. Y. LeCun. The MNIST Database of Handwritten Digits. NEC Research Institute, Princeton, NJ. URL = http://yann.lecun.com/exdb/mnist/, 2003.
16. G. Levi. A note on the derivation of maximal common subgraphs of two directed or undirected graphs. Calcolo, 9:341-352, 1972.
17. R.P. Lippman. An introduction to computing with neural nets. IEEE ASSP Magazine, pages 4-22, April 1987.
18. A. Lumini, D. Maio, and D. Maltoni. Inexact graph matching for fingerprint classification. Machine GRAPHICS and VISION, Special issue on Graph Transformations in Pattern Generation and CAD, 8(2):231-248, 1999.
19. E. Majani, R. Erlanson, and Y. Abu-Mostafa. On the k-winner-take-all network. Advances in Neural Information Processing Systems, 1:634-642, 1989.
20. M. Pelillo, K. Siddiqi, and S.W. Zucker. Matching hierarchical structures using association graphs. IEEE Transactions on Pattern Analysis and Machine Intelligence, 21(11): 1105-1120, 1999.
21. A. Rangarajan, S. Gold, and E. Mjolsness. A novel optimizing network architecture with applications. Neural Computation, 8(5): 1041-1060, 1996.
22. J.W. Raymond, E. J. Gardiner, and P. Willett. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm. Journal of Chemical Information and Computer Sciences, 42(2):305-316, 2002.
23. K. Schädler and F. Wysotzki. Comparing structures using a Hopfield-style neural network. Applied Intelligence, 11:15-30, 1999.
24. L.G. Shapiro and R.M. Haralick. Structural descriptions and inexact matching. IEEE Transaction on Pattern Analysis and Machine Intelligence, 3:514-519, 1981.
25. K. Siddiqi, A. Shokoufandeh, S. Dickinson, and S. Zucker. Shock graphs and shape matching. International Journal of Computer Vision, 35:13-32, 1999.
26. A. Sperduti and A. Starita. Supervised neural networks for the classification of structures. IEEE Transactions on Neural Networks, 8(3):714-735, 1997.
27. P. Suganthan, E. Teoh, and D. Mital. Pattern recognition by graph matching using potts mft networks. Pattern Recognition, 28:997-1009, 1995.
28. A. Wong and M. You. Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence, 7(5):599-609, 1985.
29. S.-S. Yu and W.-H. Tsai. Relaxation by the hopfield neural network. Pattern Recognition, 25(2): 197-209, 1992.