Skip to main content

Incremental and Dynamic Text Mining

Graph Structure Discovery and Visualization

  • Conference paper
  • First Online:
Foundations of Intelligent Systems (ISMIS 2002)

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

Included in the following conference series:

  • 657 Accesses

Abstract

This paper tackles the problem of knowledge discovery in text collections and the dynamic display of the discovered knowledge. We claim that these two problems are deeply interleaved, and should be considered together. The contribution of this paper is fourfold: (1) description of the properties needed for a high level representation of concept relations in text (2) a stochastic measure for a fast evaluation of dependencies between concepts (3) a visualization algorithm to display dynamic structures and (4) a deep integration of discovery and knowledge visualization, i.e. the placement of nodes and edges automatically guides the discovery of knowledge to be displayed. The resulting program has been tested using two specific data sets based on the specific domains of molecular biology and WWW howtos.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Kohonen, T.: Self-Organizing Maps. Springer-Verlag (1994)

    Google Scholar 

  2. Meyer, B.: Self-organizing graphs-a neural network perspective of graph layout (1998)

    Google Scholar 

  3. Friedman, N., Nachman, I., Pe’er, D.: Learning bayesian network structure from massive datasets: The “sparse candidate” algorithm. In: Proceedings of the Fifteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-99), San Francisco, CA, Morgan Kaufmann Publishers (1999) 196–205

    Google Scholar 

  4. Dubois, V., Quafafou, M.: Discovering graph structures in high dimensional spaces. In: Data Mining II. (2000)

    Google Scholar 

  5. Williams, G.C.: Collocational networks: Interlocking patterns of lexis in a corpus of plant biology research articles. International Journal of Corpus Linguistic 3 (1998) 151–171

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubois, V., Quafafou, M. (2002). Incremental and Dynamic Text Mining. In: Hacid, MS., Raś, Z.W., Zighed, D.A., Kodratoff, Y. (eds) Foundations of Intelligent Systems. ISMIS 2002. Lecture Notes in Computer Science(), vol 2366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48050-1_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-48050-1_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43785-7

  • Online ISBN: 978-3-540-48050-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics