Skip to main content

Pattern Recognition of Relational Structures

  • Conference paper
Pattern Recognition Theory and Applications

Part of the book series: NATO Advanced Study Institutes Series ((ASIC,volume 81))

Abstract

A new representation which abstracts relational characteristics of a class of structured data is introduced in this paper. The representation, called primitive relational structure, naturally becomes an element of Boolean algebra, the operations of which reflect the structural similarity and dissimularity of any two objects. Then on the Boolean algebra, distance and probability measures are defined. Further, to render a feasible scheme for estimating structural probability distribution where sample size of data class is relatively small in real world application, a second order approximation scheme of higher order probability on discrete-valued data is adopted. In such a scheme the optimal subset of features for the representation of the probability distributions are extracted by optimising certain information measures defined on the set of relations. The objective function for optimisation can be formulated to yield either (a) distributions that best approximate the high order probability of an ensemble or (b) distributions that lead to optimal discrimination between classes. Thus with the distance and probability measures defined, both unsupervised and supervised classification on PRS can be achieved by algorithms adapted respectively from (a) a discrete-value data clustering algorithm and (b) an error-probability minimax classification scheme. The proposed method has been applied to the analysis of structural and measurable patterns of discrete-time systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Duda, R.O. and Hart, P.E. Pattern Classification and Scene Analysis, John Wiley, 1973.

    Google Scholar 

  2. Duran, B. and Odell, S. Cluster Analysis, John Wiley, 1974.

    Google Scholar 

  3. Diday, E. and Simon, J.C. Cluster Analysis, Digital Pattern Recognition, ed. K.S. Fu, Springer-Verlag, 1976.

    Google Scholar 

  4. Fu, K.S. Applications of Syntactic Pattern Recognition, Springer-Verlag, 1977.

    Google Scholar 

  5. Fu, K.S. and Ly, S.Y. A Cluster Procedure for Syntactic Patterns, IEEE Trans, on Systems, Man and Cybernetics, vol. SMC-7, 743 – 749, 1977.

    Google Scholar 

  6. Tsai, W.H. and Fu, K.S. Attributed Grammar — A Tool for Combining Syntactic and Statistical Approaches to Pattern Recognition, IEEE Trans, on Systems, Man and Cybernetics, vol. SMC-10, 873 – 885, 1980.

    Google Scholar 

  7. Tsai, W.H. and Fu, K.S. Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis, IEEE Trans, on Systems, Man and Cybernetics, vol. SMC-9, no. 12, 757 – 768, 1979.

    Article  Google Scholar 

  8. Ghahraman, D.E., Wong, A.K.C. and Au, T. Graph Monomorphism Algorithms, IEEE Trans, on Systems, Man and Cybernetics, vol. SMC-10, no. 4, 189 – 197, 1980.

    Google Scholar 

  9. Ghahraman, D.E., Wong, A.K.C. and Au, T. Graph Optimal Monomorphism Algorithms, IEEE Trans, on Systems, Man and Cybernetics, vol. SMC-10, no. 4, 181 – 188, 1980.

    Article  Google Scholar 

  10. Wong, A.K.C. and Chahraman, D.E. Random Graphs: Structural-Contextual Dichotomy, IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. PAMI-2, no. 4, 341 – 348, 1980.

    Article  Google Scholar 

  11. Wong, A.K.C. and Liu, T.S. A Decision-Directed Clustering Algorithm for Discrete Data, IEEE Trans. Computer, vol. C-26, 75 – 82, 1977.

    Google Scholar 

  12. Wong, A.K.C. and Wang, C.C. DECA – A Discrete-Valued Data Clustering Algorithm, IEEE Trans, on Pattern Analysis and Machine Intelligence, vol. PAMI-1, no. 4, 342 – 349, 1979.

    Article  Google Scholar 

  13. Wang, D.C.C. and Wong, A.K.C. Classification of Discrete Data with Feature Space Transformation, IEEE Transactions on Automatic Control, vol. AC-24, no. 3, 434-437, 1979.

    Google Scholar 

  14. Wang, C.C.C. and Wong, A.K.C. Classification of Discrete Biomedical Data with Error Probability Minimax, Proc. 7th Int. Conf. on Cybernetics and Society, 19 – 21, 1977.

    Google Scholar 

  15. Wang, C.C. and Wong, A.K.C. Classification of Discrete-Valued Data with Feature Space Transformation, IEEE Trans, on Automatic Control, 1979.

    Google Scholar 

  16. Wong, A.K.C. and Goldfarb, L. Modelling Systems as Multilevel Hierarchical Relational Structures, Large Engineering Systems 2, ed. G.J. Savage and P.H. Roe, Sandford Educational Press, Waterloo, 37-44, 1978.

    Google Scholar 

  17. Goldfarb, L. and Wong, A.K.C. Towards Analysis of Structuraland Measurable Patterns of Systems States, Proceedings of 17th IEEE Decision and Control Conference, 1086 – 1093, 1979.

    Google Scholar 

  18. Goldfarb, L. and Wong, A.K.C. Towards Analysis of Structural and Measurable Patterns of Discrete-Time Systems, IEEE Transactions on Systems, Man, and Cybernetics, SMC-80-4-1556, to be published.

    Google Scholar 

  19. Berge, C. Graphs and Hypergraphs, North-Holland Pub. Co., 1976.

    MATH  Google Scholar 

  20. Halmos, P.R. Lectures on Boolean Algebras, D. Van Nostr. 1963.

    Google Scholar 

  21. Lewis, P.M. Approximating Discrete Probability Distributions to Reduce Storage Requirement, Information and Control, vol. 2, 214 – 225.

    Google Scholar 

  22. Chow, C.K. and Liu, C.N. Approximating Discrete Probability Distributions with Dependence Trees, IEEE Trans. Inform. Theory, vol. IT-14, 462 – 467, 1968.

    Google Scholar 

  23. Ku, H.H. and Kullback, S. Approximating Discrete Probability Distributions, IEEE Trans. Inform. Theory, vol. IT-15, 444 – 447, 1969.

    Google Scholar 

  24. Hellman, M.E. and Davis, J. Probability of Error, Equivocation and the Chernoff Bound, IEEE Trans. Inform. Theory, vol. IT-16, 368 – 372, 1970.

    Google Scholar 

  25. Toussaint, G.T. Bibliography on Estimation of Mis-classification, IEEE Trans. Inform. Theory, vol. IT-20, 472 – 479, 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1982 D. Reidel Publishing Company

About this paper

Cite this paper

Wong, A.K.C., Goldfarb, L. (1982). Pattern Recognition of Relational Structures. In: Kittler, J., Fu, K.S., Pau, LF. (eds) Pattern Recognition Theory and Applications. NATO Advanced Study Institutes Series, vol 81. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7772-3_12

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7772-3_12

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7774-7

  • Online ISBN: 978-94-009-7772-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics