skip to main content
10.1145/3340531.3418506acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

Approximate Event Pattern Matching over Heterogeneous and Dirty Sources

Published:19 October 2020Publication History

ABSTRACT

Pattern matching is an important task in the field of Complex Event Processing (CEP). However, exact event pattern matching methods could suffer from low hit rate and loss for meaningful events identification due to the heterogeneous and dirty sources in the big data era. Since both events and patterns could be imprecise, the actual event trace may have different event names as well as structures from the pre-defined pattern. The low-quality data even intensifies the difficulty of matching. In this work, we propose to learn embedding representations for patterns and event traces separately and calculate their similarity as the scores for approximate matching.

References

  1. Luping Ding, Songting Chen, Elke A. Rundensteiner, Jun'ichi Tatemura, Wang-Pin Hsiung, and K. Selcc uk Candan. 2008. Runtime Semantic Query Optimization for Event Stream Processing. In Proceedings of the ICDE 2008. 676--685. https://doi.org/10.1109/ICDE.2008.4497476Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ruihong Huang, Shaoxu Song, Yunsu Lee, Jungho Park, Soo-Hyung Kim, and Sungmin Yi. 2020. Effective and Efficient Retrieval of Structured Entities. PVLDB, Vol. 13, 6 (2020), 826--839. http://www.vldb.org/pvldb/vol13/p826-huang.pdfGoogle ScholarGoogle ScholarDigital LibraryDigital Library
  3. Jaewoo Kang and Jeffrey F. Naughton. 2003. On Schema Matching with Opaque Column Names and Data Values. In Proceedings of the 2003 ACM SIGMOD. 205--216. https://doi.org/10.1145/872757.872783Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Xian Li, Xin Luna Dong, Kenneth Lyons, Weiyi Meng, and Divesh Srivastava. 2012. Truth Finding on the Deep Web: Is the Problem Solved? PVLDB, Vol. 6, 2 (2012), 97--108. https://doi.org/10.14778/2535568.2448943Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Alessandro Margara, Gianpaolo Cugola, and Giordano Tamburrelli. 2014. Learning from the past: automated rule generation for complex event processing. In The 8th ACM DEBS 2014. 47--58. https://doi.org/10.1145/2611286.2611289Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jeffrey Pennington, Richard Socher, and Christopher D. Manning. 2014. Glove: Global Vectors for Word Representation. In Proceedings of the EMNLP 2014. 1532--1543. https://doi.org/10.3115/v1/d14--1162Google ScholarGoogle Scholar
  7. Shaoxu Song, Yue Cao, and Jianmin Wang. 2016. Cleaning Timestamps with Temporal Constraints. PVLDB, Vol. 9, 10 (2016), 708--719. https://doi.org/10.14778/2977797.2977798Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Jianmin Wang, Shaoxu Song, Xiaochen Zhu, Xuemin Lin, and Jiaguang Sun. 2016. Efficient Recovery of Missing Events. IEEE TKDE., Vol. 28, 11 (2016), 2943--2957. https://doi.org/10.1109/TKDE.2016.2594785Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Haopeng Zhang, Yanlei Diao, and Neil Immerman. 2010. Recognizing Patterns in Streams with Imprecise Timestamps. PVLDB, Vol. 3, 1 (2010), 244--255. https://doi.org/10.14778/1920841.1920875Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Xiaochen Zhu, Shaoxu Song, Xiang Lian, Jianmin Wang, and Lei Zou. 2014. Matching heterogeneous event data. In SIGMOD 2014. 1211--1222. https://doi.org/10.1145/2588555.2588570Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Approximate Event Pattern Matching over Heterogeneous and Dirty Sources

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              CIKM '20: Proceedings of the 29th ACM International Conference on Information & Knowledge Management
              October 2020
              3619 pages
              ISBN:9781450368599
              DOI:10.1145/3340531

              Copyright © 2020 ACM

              Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 19 October 2020

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • short-paper

              Acceptance Rates

              Overall Acceptance Rate1,861of8,427submissions,22%

              Upcoming Conference

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader