Skip to main content

A Data-Driven Approach for Finding the Threshold Relevant to the Temporal Data Context of an Alarm of Interest

  • Conference paper
PRICAI 2008: Trends in Artificial Intelligence (PRICAI 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5351))

Included in the following conference series:

  • 1002 Accesses

Abstract

A typical chemical alarm database is characterized by a large search space with skewed frequency distribution. Thus in practice, discovery of alarm patterns and interesting associations from such data can be exceptionally difficult and costly. To overcome this problem we propose a data-driven approach to optimally derive the pruning thresholds which are relevant to the temporal data context of the particular tag of interest.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. OSHA, OSHA Fines BP Products North America More Than $21 Million Following Texas City Explosion (accessed: 4 April, 2008), http://www.osha.gov/pls/oshaweb

  2. BP America Inc., BP America announces resolution of Texas City, Alaska, propane trading, law enforcement investigations (accessed: 12 April, 2008), http://www.bp.com

  3. U.S. Chemical Safety and Hazard Investigation Board, Investigation Report: Refinery Explosion and Fire, Report No. 2005-04-I-TX (March 2007)

    Google Scholar 

  4. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD Conference on Management of Data (SIGMPD 1993), pp. 207–216. ACM, New York (1993)

    Chapter  Google Scholar 

  5. Klementtinen, M., Mannila, M.: Finding Interesting rules from Large Sets of Discovered Association Rules. In: Third International Conf. on Information and Knowledge Management, pp. 401–407. ACM, New York (1994)

    Google Scholar 

  6. Lent, B., Swami, A., Widom, J.: Clustering association rules. In: 13th International Conference on Data Engineering (ICDE 1997), pp. 220–231. IEEE Press, Washington (1997)

    Google Scholar 

  7. Kryszkiewicz, M.: Closed Set Based Discovery of Representative Association Rules. In: 4th International Conference on Advances in Intelligent Data Analysis, pp. 350–359. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  8. Xiong, T., Ning, P., Vipin, K.: Hyperclique pattern discovery. Data Mining and Knowledge Discovery 13, 219–242 (2006)

    Article  MathSciNet  Google Scholar 

  9. Mannila, H., Toivonen, H., Verkamo, A.I.: Discovering frequent episodes in sequences. In: The First International Conference on Knowledge Discovery and Data Mining (KDD 1995), pp. 210–215. AAAI Press, Menlo Park (1995)

    Google Scholar 

  10. Chen, R., Dave, K., McAvoy, T.J., Luyben, M.: A Nonlinear Dynamic Model of a Vinyl Acetate Process. Ind. Eng. Chem. Res. 42, 4478–4487 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kordic, S., Lam, P., Xiao, J., Li, H. (2008). A Data-Driven Approach for Finding the Threshold Relevant to the Temporal Data Context of an Alarm of Interest. In: Ho, TB., Zhou, ZH. (eds) PRICAI 2008: Trends in Artificial Intelligence. PRICAI 2008. Lecture Notes in Computer Science(), vol 5351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89197-0_95

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89197-0_95

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89196-3

  • Online ISBN: 978-3-540-89197-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics