A connectionist approach to structural similarity determination as a basis of clustering, classification and feature detection

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

Volumn 1263, Issue , 1997, Pages 254-264

  Schädler, Kristina ^a   Wysotzki, Fritz ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATA MINING; MACHINE LEARNING; PATTERN RECOGNITION;

CONNECTIONIST APPROACH; FEATURE DETECTION; ORGANIC CHEMISTRY; PATTERN RECOGNITION AND CLASSIFICATION; STRUCTURAL COMPLEXITY; STRUCTURAL DATA; STRUCTURAL INFORMATION; STRUCTURAL SIMILARITY;

CLUSTERING ALGORITHMS;

EID: 21744447818     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63223-9_124     Document Type: Conference Paper

References (42)

1. D.W. Aha. Inductive Logic Programming, chapter Relating Relational Learning Algorithms. Academic Press, London, 1992.
2. Y. Akiyama, A. Yamashita, M. Kajiura, and H. Aiso. Combinatorial optimization with gaussian machines. In IEEE Int. Conf. on Neural Networks, volume 1, pages 533-540. 1989.
3. J.E. Ash, W.A. Warr, and P. Willett. Chemical Structure Systems. Computational Techniques for Representation, Searching and Processing of Structural Information. Ellis Horwood, 1991.
4. J.M. Barnard. Substructure Searching Methods: Old and new. J. Chem. Inf. Comp. Sci., 33:532-538, 1993.
5. D. Bawden. Chemical Information Systems. Beyond the Structure Diagram. Ellis Horwood, 1990.
6. K. Borner, K.P. Jantke, S. Schonherr, and E. Tammer. Lernszenarien im fall-basierten Schliefien. FABEL Report 14, GMD, Sankt Augustin, 1993.
7. L.I. Burke and J.P. Ignizio. Neural networks and operations research: An overview. Computers Ops.Res., 19(3/4):179-189, 1992.
8. L. Cinque, D. Yasuda, L.G. Shapiro, S. Tanimoto, and B. Allen. An improved algorithm for relational distance graph matching. Pattern Recognition, 29(2) :349-359, feb 1996.
9. D.J. Cook and L.B. Holder. Substructure Dcovery Using Minimum Description Length and Background Knowledge. Journal of Artificial Intelligence Research, 1:231-255, 1994.
10. W. Emde and D. Wettschereck. Relational instance-based learning. In L. Saitta, editor, Proc. of the 13th International Conference on Machine Learning, pages 122-130. Morgan Kaufmann, 1996.
11. J. A. Feldman and D. H. Ballard. Computing with Connections. TR 72, Computer Science Department, University of Rochester, April 1981.
12. J. A. Feldman, M. A. Fanty, N. Goddard, and K. Lynne. Computing with Structured Connectionist Networks. TR 213, Department of Computer Science, University of Rochester, April 1987.
13. D. H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2(2):139-172, 1987.
14. N. Funabiki, Y. Takefuji, and K.-C. Lee. A neural network model for finding a near-maximal clique. Journal of Parallel and Distributed Computing, 14(3):340-344, March 1992.
15. P. Geibel, K. Schadler, and F. Wysotzki. Begriffslernen fur strukturierte Objekte (Concept Learning for Relational Structures). In Proceedings of FGML-95, Dortmund, Germany, 1995.
16. P. Geibel and F. Wysotzki. Learning relational concepts with decision trees. In L. Saitta, editor, Machine Learning: Proceedings of the 13th International Conference, pages 166-174. Morgan Kaufmann Publishers, San Fransisco, CA, 1996.
17. P. Geibel and F. Wysotzki. Relational learning with decision trees. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence. John Wiley and Sons, Ltd., 1996. to appear.
18. J. H. Gennari, P. Langley, and D. Fisher. Models of Incremental Concept Formation. Artificial Intelligence, 40:11 - 61, 1989.
19. J. Hopfield and D. Tank. Neural computations of decisions in optimization problems. Biological Cybernetics, 52:141-152, 1986.
20. J.J. Hopfield. Neurons with graded response have collective computational properties like those of two-state neurons. In Proceedings of the National Academy of Sciences USA 81, pages 3088-3092. 1984.
21. A. Jagota. Efficiently approximating MAX-CLIQUE in a hopfield-style network. In Proceedings of International Joint Conference on Neural Networks '92 Volume 2, pages 248-253, 1992.
22. F. Kaden. Graphmetriken und Distanzgraphen. In Beitrage zur angewandten Graphentheorie, ZKI-Information. Berlin, Juni 1982.
23. J. Kietz. Induktive Analyse Relationaler Daten. PhD thesis, TU Berlin, FB 13, 1996.
24. R. D. King, M. J. E. Sternberg, A. Srinivasan, and S. H. Muggleton. Knowledge Discovery in a Database of Mutagenic Chemicals. In Proceedings of the Workshop "Statistics, Machine Learning and Discovery in Databases" at the EGML-95, 1995.
25. W. Knodel. Ein Verfahren zur FeststeUung der Isomorphic von endlichen, zusam-menhangenden Graphen. Computing, 8, 1971.
26. N. Lavrac and S. Dzeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York, 1994.
27. K.B. Lipkowitz and D.B. Boyd. Reviews in Computational Chemistry, volume 1-4. VCH, Weinheim, 1990-1993.
28. C. Looi. Neural network methods in combinatorial optimization. Computers and Operations Research, 19(3/4):191-208, 1992.
29. D. G. Lowe. Similarity metric learning for a variable-kernel classifier. Technical Report UBC-TR-93-43, Computer Science Dept., University of British Columbia, Vancouver, B.C., V6T 1Z4, Canada, November 1993.
30. H. Mannila. Aspects of data mining. In Proceedings of the Workshop "Statistics, Machine Learning and Discovery in Databases" at the ECML-9S, 1995.
31. M. Moulet and Y. Kondratoff. From machine learning towards knowledge discovery in databases. In Proceedings of the Workshop "Statistics, Machine Learning and Discovery in Databases" at the ECML-95, 1995.
32. K. Schadler, U. Schmid, B. Machenschalk, and H. Liibben. A neural net for determining structural similarity of recursive programs. In Proc. of the German Workshop of Case-Based Reasoning, Bad Honnef, March 1997.
33. K. Schadler and F. Wysotzki. Klassifizierungslernen mit Hilfe spezieller Hopfield-Netze. In Werner Dilger, Michael Schlosser, Jens Zeidler, and Andreas Ittner, editors, Beitrage zum 9.Fachgruppentreffen "Maschinelles Lernen" der GI-Fachgruppe 1.1.3., number CSR-96-06 in Chemnitzer Informatik-Berichte, pages 96-100. TU Chemnitz-Zwickau, August 1996.
34. K. Schadler and F. Wysotzki. Theoretical foundations of a special neural net approach for graphmatching. Technical Report 96-26, TU Berlin, CS Dept., 1996.
35. L.G. Shapiro and R.M. Haralick. A metric for computing relational description. IEEE Trans.Pattern Anal. Mach.Intell, 7(1):90-94, 1985.
36. E. Tammer, K. Steinhofel, S. Schonherr, and D. Matuschek. Anwendung des Konzepts der Strukturellen ahnlichkeit zum Fallvergleich mittels Term-und Graph-Reprasentationen. Technical Report FABEL-Report No.38, HTWK Leipzig, FB Informatik, Mathematik und Naturwissenschaften, August 1995.
37. A. Vofi. Similarity concepts and retrieval methods. FABEL Report 13, GMD, Sankt Augustin, 1994.
38. M. P. Wand and M. C. Jones. Kernel Smoothing. Chapman and Hall, London, 1995.
39. J. Wang. Progress in Neural Networks, volume 3, chapter 11: Deterministic Neural Networks for Combinatorial Optimization, pages 319-340. Ablex Publishing Corporation, Norwood, New Jersey, 1995.
40. Ch. Wisozki and F. Wysotzki. Prototype, nearest neighbor and hybrid algorithms for time series classification. In N. Lavrac and S.Wrobel, editors, Machine Learning: ECML-95, number 912 in LNAI, pages 364-367. Springer, 1995.
41. F. Wysotzki. Artificial Intelligence and Artificial Neural Nets. In Proc. 1st Workshop on AI, Shanghai, September 1990. TU Berlin / Jiao Tong University Shanghai.
42. B. Zelinka. On a certain distance between isomorphism classes of graphs, dasopis pro pgstovdni matematiky, 100:371-373, 1975.