Non-IID Learning for Recommendation, Time Series and Hashing

Publication Type:
Thesis
Issue Date:
2023
Full metadata record
For several decades, the independent and identically distributed (short for IID) assumption has laid the foundation of data learning, simplifying real-world data's intricate nature for effectively achieving approximate, traceability, and asymptotic problem-solving. Unfortunately, real-world scenarios generally go beyond the IID assumption and count on specific knowledge and capability to address practical problems and challenges, where IID may show significant limitations and gaps. A broad-reaching non-IID thinking is to explore and exploit the intrinsic heterogeneities and couplings of real-world data, which has been increasingly attractive and prevalent in data learning research and applications. However, non-IIDness shows diversified properties with different data scenarios, for example, heterogeneities in data types, attributes, sources, and couplings within and between structures, distributions, and variables. It is far from reaching a unified non-IID learning paradigm for addressing various real-world heterogeneities and couplings. More importantly, it is also extremely challenging to exhaustively tailor non-IID data learning methodologies for specified scenarios and applications. In this thesis, I explore non-IID learning in terms of different applications, specifically recommender systems, multivariate time series (MTS) analysis, and learning to hash, to enlighten non-IID methodologies and techniques. The elaborately chosen applications and scenarios penetrate our daily living, studying, working, and entertaining activities, and cover various tasks of classification, ranking, representation, and retrieval. Accordingly, the main research objectives include modeling and learning the non-IIDness in recommender systems, multivariate time series (MTS) analysis, and learning to hash, respectively, and delivering non-IID models to effectively handle the scenarios with both IID and non-IID data.
Please use this identifier to cite or link to this item: