返回
Markov Boundary Learning With Streaming Data for Supervised Classification
DOI:10.1109/ACCESS.2020.2998482.png)
摘要
En 中文
In this paper, we study the problem of Markov boundary (MB) learning with streaming data. A MB is a crucial concept in a Bayesian network (BN) and plays an important role in BN structure learning. In addition, in the supervised learning setting, the MB of a class attribute is optimal to feature selection for classification. Almost all existing MB learning algorithms focus on static data, but few efforts have been proposed to learning MBs with streaming data. In this paper, by linking dynamic AD-trees with streaming data, we proposed a new SDMB (streaming data-based MB) algorithm for learning MBs with streaming data. Specifically, given a target variable, SDMB employs a dynamic AD-tree to summarize the historical data, then the SDMB sequentially learns the MB of the target upon all available data by calculating independence tests using the dynamic AD-tree. In experiments, using the synthetic and real-world data sets, we evaluate the SDMB algorithm and compared it with the state-of-the-art online feature selection algorithms and data stream mining methods, and the experimental results validate the SDMB algorithm.
Keyword:
Heuristic algorithms
Bayes methods
Markov processes
Peer-to-peer computing
Feature extraction
Data mining
Lung
Markov boundary
Bayesian network
Streaming data
Supervised classification
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Adaptive random forests for evolving data stream classification (vol 106, pg 1469, 2017)
MACHINE LEARNING
IF2.9
Qualitatively different effect of repeated stress during adolescence on principal neuron morphology across lateral and basal nuclei of the rat amygdala
Neuroscience
IF0

