Data mining, Hypergraph Transversals, and Machine Learning

@inproceedings{Gunopulos1997DataMH,
  title={Data mining, Hypergraph Transversals, and Machine Learning},
  author={Dimitrios Gunopulos and Roni Khardon and Heikki Mannila and Hannu Toivonen},
  booktitle={PODS},
  year={1997}
}
Several data mining problems can be formulated as problems of finding maximally specific sentences that are interesting in a database. We first show that this problem has a close relationship with the hypergraph transversal problem. We then analyze two algorithms that have been previously used in data mining, proving upper bounds on their complexity. The first algorithm is useful when the maximally specific interesting sentences are “small”. We show that this algorithm can also be used to… CONTINUE READING