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},
  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}},
  year      = {2001},
  pages     = {155--162},
  crossref  = {DBLP:conf/icdm/2001},
  url       = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2001.989513},
  doi       = {10.1109/ICDM.2001.989513},
  timestamp = {Tue, 02 Sep 2014 23:32:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icdm/GeertsGB01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icdm/2001,
  editor    = {Nick Cercone and
               Tsau Young Lin and
               Xindong Wu},
  title     = {Proceedings of the 2001 {IEEE} International Conference on Data Mining,
               29 November - 2 December 2001, San Jose, California, {USA}},
  year      = {2001},
  publisher = {{IEEE} Computer Society},
  isbn      = {0-7695-1119-8},
  timestamp = {Tue, 02 Sep 2014 23:32:15 +0200},
  biburl    = {http://dblp.uni-trier.de/rec/bib/conf/icdm/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}