Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9958
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNegi, Shivam Singh-
dc.contributor.authorKanji, Rakesh [Guided by]-
dc.date.accessioned2023-09-12T15:41:51Z-
dc.date.available2023-09-12T15:41:51Z-
dc.date.issued2023-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/9958-
dc.descriptionEnrollment No. 191260en_US
dc.description.abstractBy using the complex, highly dimensional data analysis technique known as biclustering, rows and columns are simultaneously grouped. In the context of recommendation systems, biclustering may be used to identify subgroups of users and items that have strong linkages and are thus likely to make suitable recommendations for one another. This method has a number of advantages over traditional recommendation systems, including the ability to handle noisy and sparse data and the possibility to uncover previously unknown patterns of user-item interactions. The essential concepts behind biclustering-based recommendation systems are outlined in this abstract, along with some recent advancements. We also discuss some of this strategy's disadvantages and benefits and provide suggestions for more research. We believe that biclustering-based systems for recommendation might significantly improve the accuracy and significance of item suggestions in a range of diverse applications.en_US
dc.language.isoen_USen_US
dc.publisherJaypee University of Information Technology, Solan, H.P.en_US
dc.subjectItem recommendation systemsen_US
dc.subjectBi-clusteringen_US
dc.titleItem Recommendation using Bicluster Approachen_US
dc.typeProject Reporten_US
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Item Recommendation using Bicluster Approach.pdf2.3 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.