Un algoritmo de clasificación incremental basado en los k vecinos más similares para datos mezclados.

This paper presents an incremental k-most similar neighbor classifier, for mixed data and similarity functions that are not necessarily distances. The algorithm presented is suitable for processing large data sets, because it only stores in main memory the k most similar neighbors processed until step t, traversing only once the training data set. Several experiments with synthetic and real data are presented. [ABSTRACT FROM AUTHOR]