Abstract. We present a clustering method for continuous data. It defines local clusters into the (primary) data space but derives its similarity measure from the posterior distribu...
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
We investigate the symmetric Kullback-Leibler (KL2) distance in speaker clustering and its unreported effects for differently-sized feature matrices. Speaker data is represented a...
Web mining - data mining for web data - is a key factor of web technologies. Especially, web behavior mining has attracted a great deal of attention recently. Behavior mining invo...
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...