A Scalable Constant-Memory Sampling Algorithm for Pattern Discovery in Large Databases

@inproceedings{Scheffer2002ASC,
  title={A Scalable Constant-Memory Sampling Algorithm for Pattern Discovery in Large Databases},
  author={Tobias Scheffer and Stefan Wrobel},
  booktitle={PKDD},
  year={2002}
}

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

In remental maximization of non-instan e-averaging utility fun tions with appli ations to knowledge dis overy problems

T. S he er, S. Wrobel
In Pro eedings of the International Conferen e on Ma hine Learning, • 2001

Computable shell de omposition bounds

J. Langford, D. M Allester
In Pro eedings of the International Conferen e on Computational Learning Theory, • 2000

PALO : A probabilisti hilllimbing algorithm

Russell Greiner.
1998

A method of sampling inspe tion

H. Romig.
The Bell SystemTe hni al Journal • 1996

osgen

W. Kl
Explora: A multipattern and multistrategy dis overy assistant. In Advan es in Knowledge Dis overy and Data Mining, pages 249{271. AAAI, • 1996

Hoe ding ra es: A elerating model sele tion sear h for lassi ation and fun tion approximating

O. Maron, A. Moore
In Advan es in Neural Information Pro essing Systems, pages 59{66, • 1994

Similar Papers

Loading similar papers…