Discovering all most specific sentences

@article{Gunopulos2003DiscoveringAM,
  title={Discovering all most specific sentences},
  author={Dimitrios Gunopulos and Roni Khardon and Heikki Mannila and Sanjeev Saluja and Hannu Toivonen and Ram Sewak Sharm},
  journal={ACM Trans. Database Syst.},
  year={2003},
  volume={28},
  pages={140-174}
}
Data mining can be viewed, in many instances, as the task of computing a representation of a theory of a model or a database, in particular by finding a set of maximally specific sentences satisfying some property. We prove some hardness results that rule out simple approaches to solving the problem.The a priori algorithm is an algorithm that has been successfully applied to many instances of the problem. We analyze this algorithm, and prove that is optimal when the maximally specific sentences… CONTINUE READING
Highly Influential
This paper has highly influenced 23 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
162 Citations
9 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 162 extracted citations

References

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

Ora les andqueries that are suÆ ient for exa t learning

  • N. H. Bshouty, R. Cleve, R. Gavalda, S. Kannan, C. Tamon
  • Journal of Computer and System S ien es
  • 1996
Highly Influential
1 Excerpt

Similar Papers

Loading similar papers…