Abstract
In modeling a discrete event driven system, Petri net recommender systems can play a very important role in describing the structural and behavioral properties of complex and tricky networks. The finite and infinite perfect binary tree forms a predictive model which can map the input information to output information based on the inputs' attributes. A perfect binary tree can be used for three types of recommender systems such as: collaborative filtering, a content-based approach, and a hybrid approach. In this article, the authors show the existence of a Petri net whose reachability tree is a Perfect Infinite Binary Tree (PIBT).
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: International Journal of Knowledge and Systems Science
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.
