Welcome to the InfoSci Platform
Reference Hub8
Petri Net Recommender System for Generating of Perfect Binary Tree

Petri Net Recommender System for Generating of Perfect Binary Tree

Gajendra Pratap Singh, Sujit Kumar Singh
Copyright: © 2019 |Volume: 10 |Issue: 2 |Pages: 12
ISSN: 1947-8208|EISSN: 1947-8216|EISBN13: 9781522566953|DOI: 10.4018/IJKSS.2019040101
Cite Article Cite Article

MLA

Singh, Gajendra Pratap, and Sujit Kumar Singh. "Petri Net Recommender System for Generating of Perfect Binary Tree." IJKSS vol.10, no.2 2019: pp.1-12. http://doi.org/10.4018/IJKSS.2019040101

APA

Singh, G. P. & Singh, S. K. (2019). Petri Net Recommender System for Generating of Perfect Binary Tree. International Journal of Knowledge and Systems Science (IJKSS), 10(2), 1-12. http://doi.org/10.4018/IJKSS.2019040101

Chicago

Singh, Gajendra Pratap, and Sujit Kumar Singh. "Petri Net Recommender System for Generating of Perfect Binary Tree," International Journal of Knowledge and Systems Science (IJKSS) 10, no.2: 1-12. http://doi.org/10.4018/IJKSS.2019040101

Export Reference

Mendeley
Favorite Full-Issue Download

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).

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.