%0 Conference Paper %1 conf/dawak/DurandQ14 %A Durand, Nicolas %A Quafafou, Mohamed %B DaWaK %D 2014 %E Bellatreche, Ladjel %E Mohania, Mukesh K. %I Springer %K dblp %P 357-368 %T Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals. %U http://dblp.uni-trier.de/db/conf/dawak/dawak2014.html#DurandQ14 %V 8646 %@ 978-3-319-10159-0

@inproceedings{conf/dawak/DurandQ14, added-at = {2023-09-30T00:00:00.000+0200}, author = {Durand, Nicolas and Quafafou, Mohamed}, biburl = {https://www.bibsonomy.org/bibtex/2e76ed2ee64a9c98cbd53802b90d162ee/dblp}, booktitle = {DaWaK}, crossref = {conf/dawak/2014}, editor = {Bellatreche, Ladjel and Mohania, Mukesh K.}, ee = {https://doi.org/10.1007/978-3-319-10160-6_32}, interhash = {e488a4e63d0a66ee723aeb58400b2e54}, intrahash = {e76ed2ee64a9c98cbd53802b90d162ee}, isbn = {978-3-319-10159-0}, keywords = {dblp}, pages = {357-368}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T11:26:34.000+0200}, title = {Approximation of Frequent Itemset Border by Computing Approximate Minimal Hypergraph Transversals.}, url = {http://dblp.uni-trier.de/db/conf/dawak/dawak2014.html#DurandQ14}, volume = 8646, year = 2014 }