Пожалуйста, войдите в систему, чтобы принять участие в дискуссии (добавить собственные рецензию, или комментарий)
Цитировать эту публикацию
%0 Conference Paper
%1 grosskreutz2008tight
%A Grosskreutz, Henrik
%A Rüping, Stefan
%A Wrobel, Stefan
%B European Conference on Machine Learning and Knowledge Discovery in Databases
%D 2008
%K algorithm citedby:scholar:count:70 citedby:scholar:timestamp:2017-4-19 discovery diss fp fp-growth growth inthesis subgroup
%P 440--456
%T Tight optimistic estimates for fast subgroup discovery
@inproceedings{grosskreutz2008tight,
added-at = {2017-04-19T10:54:53.000+0200},
author = {Grosskreutz, Henrik and R{\"u}ping, Stefan and Wrobel, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/2c4e1e927e2218e4c26e85c3a6e1827b4/becker},
booktitle = {European Conference on Machine Learning and Knowledge Discovery in Databases},
interhash = {156147d83b878d5611d0dfbcee969ebb},
intrahash = {c4e1e927e2218e4c26e85c3a6e1827b4},
keywords = {algorithm citedby:scholar:count:70 citedby:scholar:timestamp:2017-4-19 discovery diss fp fp-growth growth inthesis subgroup},
organization = {Springer},
pages = {440--456},
timestamp = {2017-12-20T18:45:04.000+0100},
title = {Tight optimistic estimates for fast subgroup discovery},
year = 2008
}