Abstract
The tree-augmented naive Bayesian network (TAN) based on the Bayes theorem is a restricted Bayesian network. Its classification performance is superior to naive Bayes, and its time complexity is much lower than general Bayesian networks. So TAN embodies a good trade-off between the quality of approximation correlation among attributes and the computational complexity in the learning stage. However, its memory requirement is quadratic in the number of attributes, which restricts its application in high dimensional data. This paper proposes a new algorithm for constructing TAN, and proves the correctness of this algorithm. The space complexity of this new algorithm is linear in the number of attributes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
