Han Zhou , Hongpeng Yin , Bin Wang , Chenglin Liao
{"title":"One-pass online learning under evolving feature data streams: A non-parametric model","authors":"Han Zhou , Hongpeng Yin , Bin Wang , Chenglin Liao","doi":"10.1016/j.patcog.2025.111719","DOIUrl":null,"url":null,"abstract":"<div><div>In real-world applications, data streams naturally evolves and thus may exhibit a dynamic feature space, wherein new features appear and old ones disappear. Online learning under such circumstances necessitates simultaneous learning from increasing data volume and adaptation to the dynamic feature space in real time. While several methodologies have been proposed to tackle this challenge, many of them rely on strong assumptions regarding evolving interaction manners. Instead, this study adopts a broader perspective aimed at facilitating learning from arbitrarily evolving features without any strict assumptions in the previous work. Then, we present an online learning method based on a non-parametric kernel model. This model accommodates data streams with both continuous instances and evolving features through simple deduction and addition operations. Theoretical analysis shows the sublinear regret <span><math><mrow><mi>O</mi><mrow><mo>(</mo><msqrt><mrow><mi>T</mi></mrow></msqrt><mo>)</mo></mrow></mrow></math></span> of the proposed method. Empirical studies show the capability to adapt not only to the previously constrained evolving features but also to the more arbitrarily evolving features.</div></div>","PeriodicalId":49713,"journal":{"name":"Pattern Recognition","volume":"168 ","pages":"Article 111719"},"PeriodicalIF":7.5000,"publicationDate":"2025-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Pattern Recognition","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0031320325003796","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
In real-world applications, data streams naturally evolves and thus may exhibit a dynamic feature space, wherein new features appear and old ones disappear. Online learning under such circumstances necessitates simultaneous learning from increasing data volume and adaptation to the dynamic feature space in real time. While several methodologies have been proposed to tackle this challenge, many of them rely on strong assumptions regarding evolving interaction manners. Instead, this study adopts a broader perspective aimed at facilitating learning from arbitrarily evolving features without any strict assumptions in the previous work. Then, we present an online learning method based on a non-parametric kernel model. This model accommodates data streams with both continuous instances and evolving features through simple deduction and addition operations. Theoretical analysis shows the sublinear regret of the proposed method. Empirical studies show the capability to adapt not only to the previously constrained evolving features but also to the more arbitrarily evolving features.
期刊介绍:
The field of Pattern Recognition is both mature and rapidly evolving, playing a crucial role in various related fields such as computer vision, image processing, text analysis, and neural networks. It closely intersects with machine learning and is being applied in emerging areas like biometrics, bioinformatics, multimedia data analysis, and data science. The journal Pattern Recognition, established half a century ago during the early days of computer science, has since grown significantly in scope and influence.