NobleBlocks

Research indexJournal article

Fast algorithm for entropy estimation

Тимофеев, Kaltchenko

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE29 May 2013

NobleIDark:/48914/w1/20260521/134008FCDOI10.1117/12.2016164

Paywalled

The full text is at the publisher

You can read the abstract here, or open it at the publisher.

Read at the publisher

Abstract

Proposed is a new fast algorithm for entropy estimation of a given input word. The algorithm utilizes k-nearest neighbor search of a given dictionary. The time complexity of the search is independent of the dictionary size.

Discussion

Citations

Topics

More

Suggest a correction or report