Abstract
Set Expansion is a method for finding similar sets of items from a seed set. It is useful on examining a large set of items to find hidden relationships among the items. In this paper, we propose a method that can reduce the number of calculations needed on executing Bayesian Sets, which is one of the most popular set expansion algorithms. The key point of our method lies in the use of Zero-suppressed Binary Decision Diagrams (ZDD) to express a binary value sparse matrix in a compressed form and executing needed calculations directly on constructed ZDD. We show a method for expressing a binary value matrix with ZDD, and also show some techniques for reducing the size of ZDD. We confirm the effectiveness of our method with experiments on both synthesis and real data.
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 callMore From: Transactions of the Japanese Society for Artificial Intelligence
Disclaimer: 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.
