Highly Influenced

# Discovering All Most Specific Sentences by Randomized Algorithms

@inproceedings{Gunopulos1997DiscoveringAM, title={Discovering All Most Specific Sentences by Randomized Algorithms}, author={Dimitrios Gunopulos and Heikki Mannila and Sanjeev Saluja}, booktitle={ICDT}, year={1997} }

- Published 1997 in ICDT
DOI:10.1007/3-540-62222-5_47

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 124 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

81 Citations

1 References

Similar Papers

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 125 Citations

Citations per Year

Semantic Scholar estimates that this publication has

**125**citations based on the available data.See our **FAQ** for additional information.