The Community for Technology Leaders
Green Image
Issue No. 10 - Oct. (2012 vol. 24)
ISSN: 1041-4347
pp: 1789-1802
Brian Quanz , University of Kansas, Lawrence
Jun (Luke) Huan , University of Kansas, Lawrence
Meenakshi Mishra , University of Kansas, Lawrence
Effectively utilizing readily available auxiliary data to improve predictive performance on new modeling tasks is a key problem in data mining. In this research, the goal is to transfer knowledge between sources of data, particularly when ground-truth information for the new modeling task is scarce or is expensive to collect where leveraging any auxiliary sources of data becomes a necessity. Toward seamless knowledge transfer among tasks, effective representation of the data is a critical but yet not fully explored research area for the data engineer and data miner. Here, we present a technique based on the idea of sparse coding, which essentially attempts to find an embedding for the data by assigning feature values based on subspace cluster membership. We modify the idea of sparse coding by focusing the identification of shared clusters between data when source and target data may have different distributions. In our paper, we point out cases where a direct application of sparse coding will lead to a failure of knowledge transfer. We then present the details of our extension to sparse coding, by incorporating distribution distance estimates for the embedded data, and show that the proposed algorithm can overcome the shortcomings of the sparse coding algorithm on synthetic data and achieve improved predictive performance on a real world chemical toxicity transfer learning task.
Encoding, Vectors, Knowledge transfer, Kernel, Feature extraction, Estimation, Equations, low-quality data., Knowledge transfer, transfer learning, feature extraction, sparse coding

J. (. Huan, B. Quanz and M. Mishra, "Knowledge Transfer with Low-Quality Data: A Feature Extraction Issue," in IEEE Transactions on Knowledge & Data Engineering, vol. 24, no. , pp. 1789-1802, 2012.
99 ms
(Ver 3.3 (11022016))