Sampling the Top-K representative data for classification
Ping Wang · Summit (Simon Fraser University) · 2005
Building classification models based on databases is an exciting area in data mining research.In many classification tasks, only a small set of labelled training data are given.These data are not sufficient for a good classification.We need to sample and label more data as training data for better performance.However, labelling data is timeconsuming and costly.The challenge is to effectively select the most representative data for labelling.While most active leaming methods for this problem follow the incremental query learning paradigm in which the classifier is retained upon each newly labelled query, we present a distance-based method which samples the top-k representative data simultaneously and can be applied to any distance-based classifiers.Redundancy reduction makes classifier retraining unnecessary and makes it find more balanced examples with regard to class distribution in database.Experiment results from two data sets and two classifiers demonstrate the advantages of our method.inp~lt are very helpful.Thank Dr. Jian Pei for being my examiner of this thesis.My appreciation also goes to Kersti, Val for the administration procedure.My deepest gratitude and appreciation is reserved for my parents, my husband and other family members.To My beloved husband Hongyin Cui, thank you for your love and unlimited