Petri Net Recommender System for Generating of Perfect Binary Tree

Gajendra Pratap Singh and Sujit Kumar Singh
Additional contact information
Gajendra Pratap Singh: School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi, India
Sujit Kumar Singh: School of Computational and Integrative Sciences, Jawaharlal Nehru University, New Delhi, India

International Journal of Knowledge and Systems Science (IJKSS), 2019, vol. 10, issue 2, 1-12

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

Date: 2019
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 018/IJKSS.2019040101 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jkss00:v:10:y:2019:i:2:p:1-12

Access Statistics for this article

International Journal of Knowledge and Systems Science (IJKSS) is currently edited by Van Nam Huynh

More articles in International Journal of Knowledge and Systems Science (IJKSS) from IGI Global
Bibliographic data for series maintained by Journal Editor ().