BibTeX record conf/icdm/GeertsGB01

download as .bib file

@inproceedings{DBLP:conf/icdm/GeertsGB01,
  author       = {Floris Geerts and
                  Bart Goethals and
                  Jan Van den Bussche},
  editor       = {Nick Cercone and
                  Tsau Young Lin and
                  Xindong Wu},
  title        = {A Tight Upper Bound on the Number of Candidate Patterns},
  booktitle    = {Proceedings of the 2001 {IEEE} International Conference on Data Mining,
                  29 November - 2 December 2001, San Jose, California, {USA}},
  pages        = {155--162},
  publisher    = {{IEEE} Computer Society},
  year         = {2001},
  url          = {https://doi.org/10.1109/ICDM.2001.989513},
  doi          = {10.1109/ICDM.2001.989513},
  timestamp    = {Fri, 24 Mar 2023 00:01:13 +0100},
  biburl       = {https://dblp.org/rec/conf/icdm/GeertsGB01.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.