Dept. of Electr. Eng., National Taiwan Univ.Chen, Hung-LengHung-LengChenChuang, Kun-TaKun-TaChuangMING-SYAN CHEN2018-09-102018-09-10200515504786http://www.scopus.com/inward/record.url?eid=2-s2.0-34548573371&partnerID=MN8TOARShttp://scholars.lib.ntu.edu.tw/handle/123456789/316166Sampling has been recognized as an important technique to improve the efficiency of clustering. However, with sampling applied, those points which are not sampled will not have their labels. Although there is a straightforward approach in the numerical domain, the problem of how to allocate those unlabeled data points into proper clusters remains as a challenging issue in the categorical domain. In this paper, a mechanism named MAximal Resemblance Data Labeling (abbreviated as MARDL) is proposed to allocate each unlabeled data point into the corresponding appropriate cluster based on the novel categorical clustering representative, namely, Node Importance Representative(abbreviated as NIR), which represents clusters by the importance of attribute values. MARDL has two advantages: (1) MARDL exhibits high execution efficiency; (2) after each unlabeled data is allocated into the proper cluster, MARDL preserves clustering characteristics, i.e., high intra-cluster similarity and low inter-cluster similarity. MARDL is empirically validated via real and synthetic data sets, and is shown to be not only more efficient than prior methods but also attaining results of better quality. © 2005 IEEE.application/pdf195385 bytesapplication/pdfCategorical clustering; Data labeling; Data miningData mining; Data structures; Numerical methods; Sampling; Categorical clustering; Clustering characteristics; Data labeling; Execution efficiency; Cluster analysisconference paper10.1109/ICDM.2005.852-s2.0-34548573371