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. 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
{"_id":"KbaAs4jAm7Tt4sEDg","bibbaseid":"yang-pan-chung-anefficienthashbasedmethodfordiscoveringthemaximalfrequentset-2001","authorIDs":[],"author_short":["Yang, D.","Pan, C.","Chung, Y."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","added-at":"2014-10-10T00:00:00.000+0200","author":[{"propositions":[],"lastnames":["Yang"],"firstnames":["Don-Lin"],"suffixes":[]},{"propositions":[],"lastnames":["Pan"],"firstnames":["Ching-Ting"],"suffixes":[]},{"propositions":[],"lastnames":["Chung"],"firstnames":["Yeh-Ching"],"suffixes":[]}],"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","bibtex":"@inproceedings{conf/compsac/YangPC01,\n added-at = {2014-10-10T00:00:00.000+0200},\n author = {Yang, Don-Lin and Pan, Ching-Ting and Chung, Yeh-Ching},\n biburl = {https://www.bibsonomy.org/bibtex/25fdd5db0aaa7b24103009560cb59797d/dblp},\n booktitle = {COMPSAC},\n crossref = {conf/compsac/2001},\n ee = {http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2001.960661},\n interhash = {b0a5ddf550a4a78404c6c12a6380b62c},\n intrahash = {5fdd5db0aaa7b24103009560cb59797d},\n isbn = {0-7695-1372-7},\n keywords = {dblp},\n pages = {511-516},\n publisher = {IEEE Computer Society},\n timestamp = {2015-06-19T06:28:27.000+0200},\n title = {An Efficient Hash-Based Method for Discovering the Maximal Frequent Set.},\n url = {http://dblp.uni-trier.de/db/conf/compsac/compsac2001.html#YangPC01},\n year = 2001\n}\n\n","author_short":["Yang, D.","Pan, C.","Chung, Y."],"key":"conf/compsac/YangPC01","id":"conf/compsac/YangPC01","bibbaseid":"yang-pan-chung-anefficienthashbasedmethodfordiscoveringthemaximalfrequentset-2001","role":"author","urls":{"Link":"http://doi.ieeecomputersociety.org/10.1109/CMPSAC.2001.960661","Paper":"http://dblp.uni-trier.de/db/conf/compsac/compsac2001.html#YangPC01"},"keyword":["dblp"],"downloads":0},"bibtype":"inproceedings","biburl":"http://www.bibsonomy.org/bib/author/yang lin?items=1000","creationDate":"2019-08-22T03:53:54.279Z","downloads":0,"keywords":["dblp"],"search_terms":["efficient","hash","based","method","discovering","maximal","frequent","set","yang","pan","chung"],"title":"An Efficient Hash-Based Method for Discovering the Maximal Frequent Set.","year":2001,"dataSources":["a57oXwvfTysj8WtNo"]}