Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections

@inproceedings{Feldman1997MaximalAR,
  title={Maximal Association Rules: A New Tool for Mining for Keyword Co-Occurrences in Document Collections},
  author={Ronen Feldman and Yonatan Aumann and Amihood Amir and Amir Zilberstein and Willi Kl{\"o}sgen},
  booktitle={KDD},
  year={1997}
}
Knowledge Discovery in Databases (KDD) focuses on the computerized exploration of large amounts of data and on the discovery of interesting patterns within them. While most work on KDD has been concerned with structured databases, there has been little work on handling the huge amount of information that is available only in unstructured document collections. This paper describes a new method A:.. c---..---I--4 AL..-2-..for cotiiptirmg CO-OCCUtTetiCe rreyuencm 01 tnr. various keywords labeling… CONTINUE READING

From This Paper

Topics from this paper.
40 Citations
7 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-7 of 7 references

Incremental Algorithms for Association Generation

  • R. Feldman, A. Amir, Y. Aumann, A. Zilberstein, H. Hirsh
  • Proceedings of the 1” Pacific Asia Conference on…
  • 1997

The Reuters-21578, Distribution 1.0

  • D. Lewis
  • ht$rllWWw,research.att,
  • 1997

Efficient Algorithms for Mining and Manipulating Associations in Texts

  • R. Feldman, I. Dagan, W. Kloesgen
  • Proceedings of EMCSR96, Vienna, Austria, April…
  • 1996

Similar Papers

Loading similar papers…