Discovering all most specific sentences by randomized algorithms extended abstract

@inproceedings{Gunopulos1997DiscoveringAM,
  title={Discovering all most specific sentences by randomized algorithms extended abstract},
  author={Dimitrios Gunopulos and Heikki Mannila and Sanjeev Saluja},
  booktitle={ICDT 1997},
  year={1997}
}
Data mining can in many instances be viewed as the task of computing a representation of a theory of a model or a database. In this paper we present a randomized algorithm that can be used to compute the representation of a theory in terms of the most specific sentences of that theory. In addition to randomization, the algorithm uses a generalization of the concept of hy— pergraph transversal. We apply the general algorithm in two ways, for the problem of discovering maximal frequent sets in 0… CONTINUE READING
Highly Cited
This paper has 35 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.

On an algorithm for finding all interesting sen— tences

H. Mannila, H. Toivonen
In Cybernetics and Systems Research ’96, • 1994

Similar Papers

Loading similar papers…