An Efficient Hash-Based Method for Discovering the Maximal Frequent Set. Yang, D., Pan, C., & Chung, Y. In COMPSAC, pages 511-516, 2001. IEEE Computer Society.
An Efficient Hash-Based Method for Discovering the Maximal Frequent Set. [link]Link  An Efficient Hash-Based Method for Discovering the Maximal Frequent Set. [link]Paper  bibtex   
@inproceedings{conf/compsac/YangPC01,
  added-at = {2014-10-10T00:00:00.000+0200},
  author = {Yang, Don-Lin and Pan, Ching-Ting and Chung, Yeh-Ching},
  biburl = {https://www.bibsonomy.org/bibtex/25fdd5db0aaa7b24103009560cb59797d/dblp},
  booktitle = {COMPSAC},
  crossref = {conf/compsac/2001},
  ee = {http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2001.960661},
  interhash = {b0a5ddf550a4a78404c6c12a6380b62c},
  intrahash = {5fdd5db0aaa7b24103009560cb59797d},
  isbn = {0-7695-1372-7},
  keywords = {dblp},
  pages = {511-516},
  publisher = {IEEE Computer Society},
  timestamp = {2015-06-19T06:28:27.000+0200},
  title = {An Efficient Hash-Based Method for Discovering the Maximal Frequent Set.},
  url = {http://dblp.uni-trier.de/db/conf/compsac/compsac2001.html#YangPC01},
  year = 2001
}

Downloads: 0