2014 IEEE International Conference on Data Mining (ICDM) (2014)
Dec. 14, 2014 to Dec. 17, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICDM.2014.42
Multiple types of heterogeneity, such as label heterogeneity and feature heterogeneity, often co-exist in many real-world data mining applications, such as news article categorization, gene functionality prediction. To effectively leverage such heterogeneity, in this paper, we propose a novel graph-based framework for Learning with both Label and Feature heterogeneities, namely L2F. It models the label correlation by requiring that any two label-specific classifiers behave similarly on the same views if the associated labels are similar, and imposes the view consistency by requiring that view-based classifiers generate similar predictions on the same examples. To solve the resulting optimization problem, we propose an iterative algorithm, which is guaranteed to converge to the global optimum. Furthermore, we analyze its generalization performance based on Rademacher complexity, which sheds light on the benefits of jointly modeling the label and feature heterogeneity. Experimental results on various data sets show the effectiveness of the proposed approach.
Correlation, Complexity theory, Optimization, Vectors, Loss measurement, Linear programming, Diabetes
P. Yang, J. He, H. Yang and H. Fu, "Learning from Label and Feature Heterogeneity," 2014 IEEE International Conference on Data Mining (ICDM), Shenzhen, China, 2014, pp. 1079-1084.