Skip to main content
SpringerLink
Log in

An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases

  • Conference paper
  • First Online:
Discovey Science (DS 1998)

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

Included in the following conference series:

Abstract

In this poster, we present demonstration of a prototype system for efficient discovery of combinatorial patterns, called proximity word-association patterns, from a collection of texts. The algorithm computes the best k-proximity d-word patterns in almost linear expected time in the total input length n, which is drastically faster than a straightforward algorithm of O(n 2d+1) time complexity

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

References

  1. Arimura, H., Wataki, A., Fujino, R., Arikawa, S., A fast algorithm for discovering optimal string patterns in large text databases. In Proc. ALT’98, LNAI, Springer, 1998. (To appear.)

    Google Scholar 

  2. Arimura, H., Shimozono, S., Maximizing agreement between a classification and bounded or unbounded number of associated words. Proc. ISAAC’98, LNCS, Springer, 1998. (To appear.)

    Google Scholar 

  3. Fukuda, T., Morimoto, Y., Morishita, S. and Tokuyama, T., Data mining using two-dimensional optimized association rules. In Proc. SIGMOD’96, 13–23, 1996.

    Google Scholar 

  4. Kearns, M. J., Shapire, R. E., Sellie, L. M., Toward efficient agnostic learning. Machine Learning, 17(2–3), 115–141, 1994.

    MATH  Google Scholar 

  5. Manber, U. and Baeza-Yates, R., An algorithm for string matching with a sequence of don’t cares. IPL 37, 133–136 (1991).

    Article  MATH  MathSciNet  Google Scholar 

  6. Wang, J. T.-L., Chirn, G.-W., Marr, T. G., Shapiro, B., Shasha, D., Zhang. K., Combinatorial Pattern Discovery for Scientific Data: Some preliminary results. In Proc. SIGMOD’94, (1994) 115–125.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, Kyushu University, Hakozaki 6-10-1, Fukuoka, 812-8581, Japan

    Hiroki Arimura, Atsushi Wataki & Setsuo Arikawa

  2. Dept. of Arti.cial Intelligence, Kyushu Inst. of Tech., Iizuka, 820-8502, Japan

    Ryoichi Fujino

  3. Fujitsu LTD, Japan

    Shinichi Shimozono

Authors
  1. Hiroki Arimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Atsushi Wataki
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ryoichi Fujino
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shinichi Shimozono
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Setsuo Arikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, Kyushu University, Fukuoka, 812-8581, USA

    Setsuo Arikawa

  2. Institute of Scientific and Industrial Research Devision of Intelligent Systems Science, Osaka University, 8-1 Mihogaoka, Ibaraki, Osaka, 567-0047, Japan

    Hiroshi Motoda

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Arimura, H., Wataki, A., Fujino, R., Shimozono, S., Arikawa, S. (1998). An Efficient Tool for Discovering Simple Combinatorial Patterns from Large Text Databases. In: Arikawa, S., Motoda, H. (eds) Discovey Science. DS 1998. Lecture Notes in Computer Science(), vol 1532. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49292-5_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-49292-5_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65390-5

  • Online ISBN: 978-3-540-49292-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation