Identifying and understanding dynamic concepts in co-evolving sequences is crucial for analyzing complex systems such as IoT applications, financial markets, and online activity logs. These concepts provide valuable insights into the underlying structures and behaviors of sequential data, enabling better decision-making and forecasting. This paper introduces Wormhole, a novel deep representation learning framework that is concept-aware and designed for co-evolving time sequences. Our model presents a self-representation layer and a temporal smoothness constraint to ensure robust identification of dynamic concepts and their transitions. Additionally, concept transitions are detected by identifying abrupt changes in the latent space, signifying a shift to new behavior - akin to passing through a wormhole. This novel mechanism accurately discerns concepts within co-evolving sequences and pinpoints the exact locations of these wormholes, enhancing the interpretability of the learned representations. Experiments demonstrate that this method can effectively segment time series data into meaningful concepts, providing a valuable tool for analyzing complex temporal patterns and advancing the detection of concept drifts.
Generalized Incremental Learning under Concept Drift across Evolving Data Streams
Australian Artificial Intelligence Institute (AAII), \ of Technology Sydney Sydney NSW Australia;Australian Artificial Intelligence Institute (AAII), \ of Technology Sydney
CMKL: Modality-Aware Continual Learning for Evolving Biomedical Knowledge Graphs
Technology, Innovation, Entrepreneurship Department(技术、创新与创业部门);King Abdullah University of Science and Technology(卡塔尔科技大学);School of Computing and Information Systems(计算与信息系统学院);The University of Melbourne(墨尔本大学);College of Computer Science and Technology(计算机科学与技术学院);Jilin University(吉林大学);School of Computing Technologies(计算技术学院);RMIT University(皇家墨尔本理工大学);College of Computing and Data Science(计算与数据科学学院);Nanyang Technological University(南洋理工大学)
PA-Cache: Evolving Learning-Based Popularity-Aware Content Caching in Edge Networks
Chongqing University(重庆大学);Binghamton University, State University of New York(纽约州立大学宾汉姆顿大学);Swinburne University of Technology(斯威本科技大学);Harbin Institute of Technology(哈尔滨工业大学)
随着无处不在和个性化服务的蓬勃发展,大量移动设备在网络上产生了越来越多的流量。因此,内容缓存逐渐延伸到网络边缘,以提供低延迟服务,提高服务质量,并减少冗余数据流量。与传统的内容分发网络相比,边缘网络中具有较小尺寸的高速缓存通常必须容纳更多突发请求。在本文中,我们提出了一个不断发展的学习为基础的内容缓存策略,命名为PA缓存在边缘网络。它自适应地学习随时间变化的内容流行度,并确定当缓存已满时应该替换哪些内容。与传统的深度神经网络(DNN)不同,DNN使用具有高计算复杂性的整个训练数据集来学习微调但可能过时或有偏见的预测模型,PA-Cache对大量内容特征集进行加权,并在随着时间的推移有更多请求到达时从浅到深地训练多层递归神经网络。我们广泛评估我们提出的PA缓存的性能从一个大型的在线视频点播服务提供商在现实世界中的痕迹。\rb{The results show that PA-Cache outperforms existing popular caching algorithms and approximates the optimal algorithm with only a 3.8\% performance gap when the cache percentage is 1.0\%}。与传统的基于DNN的方法相比,PA-Cache还显着降低了计算成本。
Resource-aware Elastic Swap Random Forest for Evolving Data Streams
Barcelona Supercomputing Center(巴塞罗那超级计算中心);Universitat Politècnica de Catalunya(加泰罗尼亚理工大学);Télécom ParisTech(巴黎高等电信学院);Université Paris-Saclay(巴黎萨克雷大学)
Evolving Graph Learning for Out-of-Distribution Generalization in Non-stationary Environments
Beijing Advanced Innovation Center for Big Data and Brain Computing, School of Computer Science and Engineering, Beihang University(北京大数据与脑计算先进创新中心,计算机科学与工程学院,北京航空航天大学);Key Lab of Education Blockchain and Intelligent Technology, Ministry of Education, Guangxi Normal University(教育区块链与智能技术重点实验室,教育部,广西师范大学);Department of Computer Science, University of Illinois at Chicago(计算机科学系,伊利诺伊大学芝加哥分校)