Skip to main content

A Novel Event Network Matching Algorithm

  • Conference paper
  • 4813 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7473))

Abstract

Event network is a new semantic-based and event-oriented text representation model, the operation on event network is a good form of semantic computation, which can provide support for text semantic information processing. The paper proposes a new three-step matching algorithm for event network: event matching based on maximum similarity priority, relation matching based on isotropic-relational-distance matrix, and event network matching by integrating event matching and relation matching. The paper’s experimental results show that the method is feasible and reasonable.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bengoetxea, E.: The graph matching problem, PhD Thesis, ch. 2 (2002)

    Google Scholar 

  2. Yang, G.C., Choi, Y.B., Oh, J.C.: CGMA: A Novel Conceptual Graph Matching Algorithm. In: Pfeiffer, H.D., Nagle, T.E. (eds.) Conceptual Structures: Theory and Implementation. LNCS (LNAI), vol. 754, pp. 252–261. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  3. Montes-y-Gómez, M., Gelbukh, A., López-López, A., Baeza-Yates, R.: Flexible Comparison of Conceptual Graphs. In: Mayr, H.C., Lazanský, J., Quirchmayr, G., Vogel, P. (eds.) DEXA 2001. LNCS, vol. 2113, pp. 102–111. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  4. Poole, J., Campbell, J.A.: A Novel Algorithm for Matching Conceptual and Related Graph. In: Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. LNCS (LNAI), vol. 954, pp. 293–307. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Zhu, H.P.: Semantic Ssearch By Matching Conceptual Graph, Doctoral Dissertation, Shanghai Jiao Tong University (2006)

    Google Scholar 

  6. Chen, X.: Why did John Herschel fail to understand polarization? The differences between object and event concepts. Studies in History and Philosophy of Science 34, 491–513 (2003)

    Article  Google Scholar 

  7. Zacks, J.M., Tversky, B.: Event structure in perception and conception. Psychological Bulletin 127, 3–21 (2001)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jianfang, S., Zongtian, L. (2012). A Novel Event Network Matching Algorithm. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-34062-8_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-34061-1

  • Online ISBN: 978-3-642-34062-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics