Advertisement

Trend graphs: Visualizing the evolution of concept relationships in large document collections

  • Ronen Feldman
  • Yonatan Aumann
  • Amir Zilberstein
  • Yaron Ben-Yehuda
Communications Session 2. Visualization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1510)

Abstract

The proliferation of digitally available textual data necessitates automatic tools for analyzing large textual collections. Thus, in analogy to data mining for structured databases, text mining is defined for textual collections. A central tool in text mining is the analysis of concept relationship, which discovers connections between different concepts, as reflected in the corpus. Most previous work on text mining in general, and concept relationship in particular, viewed the entire corpus as one monolithic entity. However, large corpuses are often composed of documents with different characteristics. Most importantly, documents are often tagged with timestamps (e.g. news articles), and thus represent the state of the domain in different time periods. In this paper we introduce a new technique for analyzing and visualizing differences and similarities in the concept relationships, as they are reflected in different segments of the corpus. Focusing on the case of timestamped documents, we introduce Trend Graphs, which provide a graphical tool for analyzing and visualizing the dynamic changes in concept relationships over time. Trend Graphs thus provide a tool for tracking the evaluation of the corpus over time, highlighting trends and discontinuities.

References

  1. 1.
    Agrawal, R.; Lin, K. I.; Sawhney, H. S.; and Shim, K.: Fast Similarity Search in the Presence of Noise, Scalling and Translation in Time-Series Databases. In: Proceeding of the Annual Symposium on Very Large DataBases (VLDB), (1995) 490–501.Google Scholar
  2. 2.
    Bettini, C.; Wang, X. S.; and Jajodia, S.: Testing Complex temporal relationships Involving Multiple Granularities and its Application to Data Mining. In: Proceedings of the 15th ACM Symposium on Principles of Database Systems (PODS), (1996) 68–78.Google Scholar
  3. 3.
    Dousson, C.; Gaborit, P.; and Ghallab, M.: Situation Recognition: Representation and Algorithms. In: Proceedings of the 13th International Joint Conference of Artificial Inteligence (IJCAI), (1993) 166–172.Google Scholar
  4. 4.
    Fayyad, U.; Piatetsky-Shapiro, G.; and Smyth P.: Knowledge Discovery and Data Mining: Towards a Unifying Framework. In: Proceedings of the 2nd International Conference of Knowledge Discovery and Data Mining (KDD), (1996) 82–88.Google Scholar
  5. 5.
    Feldman, R.; and Dagan, I.: KDT—Knowledge Discovery in Texts. In: Proceedings of the 1sr International Conference of Knowledge Discovery and Data Mining (KDD), (1995).Google Scholar
  6. 6.
    Feldman, R.; and Hirsh, H.: Mining Association Rules in Text in the Presence of Background Knowledge. In: Proceedings of the 2nd International Conference of Knowledge Discovery and Data Mining (KDD), (1996).Google Scholar
  7. 7.
    Feldman, R.; Klosgen, W.; and Zilberstein, A.: Visualization Techniques to Explore Data Mining Results for Document Collections. In: Proceedings of the 3rd International Conference of Knowledge Discovery and Data Mining (KDD), (1997), 16–23.Google Scholar
  8. 8.
    Hahn, U.; and Schnattinger, K.: Deep Knowledge Discovery from Natural Language Texts. In: Proceedings of the 3rd International Conference of Knowledge Discovery and Data Mining (KDD), (1997) 175–178.Google Scholar
  9. 9.
    Hotanen, k.; Klemettinen, M.; Mannila, H.; Ronkainon, P.; and Toivonen, H.: TASA: Telecommunication Alarm Sequence Analyzer, or “How to Enjoy Faults in Your Network”. In: Proceedings of the 1996 IEEE Network Operations and Management Symposium (NOMS), (1996) 520–529.Google Scholar
  10. 10.
    Keogh, E.; and Smyth, P.: A Probabilistic Approach to Fast Pattern Matching in Time-Series Databases. In: Proceedings of the 3rd International Conference of Knowledge Discovery and Data Mining (KDD), (1997) 24–130.Google Scholar
  11. 11.
    Lent, B.; Agrawal, R.; and Srikant, R.: Discovering Trends in Text Databases. In: Proceedings of the 3rd International Conference of Knowledge Discovery and Data Mining (KDD), (1997) 227–230.Google Scholar
  12. 12.
    Mannila, H.; Toivonen, H.; and Verkamo, A.I.: Discovering Frequent Episodes in Sequences. In: Proceedings of the 1st International Conference of Knowledge Discovery and Data Mining (KDD), (1995) 210–215.Google Scholar
  13. 13.
    Mannila, H.; and Toivenen, H.: Discovering Generalized Episodes Using Minimal Occurances. In: Proceedings of the 2nd International Conference of Knowledge Discovery and Data Mining (KDD), (1996) 146–151.Google Scholar
  14. 14.
    Srikant, R.; and Agrawal, R.: Mining Sequential Patterns: Generalizations and Performance Improvements. In: Proceedings of the 5th International Conference on Extending Database Technology (EDBT), (1996).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Ronen Feldman
    • 1
  • Yonatan Aumann
    • 1
  • Amir Zilberstein
    • 1
  • Yaron Ben-Yehuda
    • 1
  1. 1.Department of Mathematics and Computer ScienceBar Ilan UniversityRamat-GanIsrael

Personalised recommendations