A Fast Clustering Algorithm for Data with a Few Labeled Instances
The diameter of a cluster is the maximum intracluster distance between pairs of instances within the same cluster, and the split of a cluster is the minimum distance between instances within the cluster and instances outside the cluster. Given a few labeled instances, this paper includes two aspects...
Main Authors: | Jinfeng Yang, Yong Xiao, Jiabing Wang, Qianli Ma, Yanhua Shen |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Computational Intelligence and Neuroscience |
Online Access: | http://dx.doi.org/10.1155/2015/196098 |
Similar Items
-
Fast Data Reduction With Granulation-Based Instances Importance Labeling
by: Xiaoyan Sun, et al.
Published: (2019-01-01) -
Instance-Level Embedding Adaptation for Few-Shot Learning
by: Fusheng Hao, et al.
Published: (2019-01-01) -
Classification of Few Labeled Images Based on Integrated GMM Clustering
Published: (2019-06-01) -
Explainable Fraud Detection for Few Labeled Time Series Data
by: Zhiwen Xiao, et al.
Published: (2021-01-01) -
Musical Meaning for the Few: Instances of Private Reception in the Music of Brahms
by: Dillon R. Parmer
Published: (2007-04-01)