%0 Conference Paper %1 conf/icassp/NadasNPP91 %A Nádas, Arthur %A Nahamoo, David %A Picheny, Michael %A Powell, J. %B ICASSP %D 1991 %I IEEE Computer Society %K dblp %P 565-568 %T An iterative 'flip-flop' approximation of the most informative split in the construction of decision trees. %U http://dblp.uni-trier.de/db/conf/icassp/icassp1991.html#NadasNPP91 %@ 0-7803-0003-3

@inproceedings{conf/icassp/NadasNPP91, added-at = {2020-07-10T00:00:00.000+0200}, author = {Nádas, Arthur and Nahamoo, David and Picheny, Michael and Powell, J.}, biburl = {https://www.bibsonomy.org/bibtex/2d7b1d68c82dc101cf58c219bd40d607b/dblp}, booktitle = {ICASSP}, crossref = {conf/icassp/1991}, ee = {https://doi.org/10.1109/ICASSP.1991.150402}, interhash = {54cec9b1b1cbb700ed3de60288f8d29c}, intrahash = {d7b1d68c82dc101cf58c219bd40d607b}, isbn = {0-7803-0003-3}, keywords = {dblp}, pages = {565-568}, publisher = {IEEE Computer Society}, timestamp = {2024-04-09T13:56:08.000+0200}, title = {An iterative 'flip-flop' approximation of the most informative split in the construction of decision trees.}, url = {http://dblp.uni-trier.de/db/conf/icassp/icassp1991.html#NadasNPP91}, year = 1991 }