Please use this identifier to cite or link to this item: http://dspace.dtu.ac.in:8080/jspui/handle/repository/19218
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDAS, ABHIRUP-
dc.date.accessioned2022-06-30T07:33:32Z-
dc.date.available2022-06-30T07:33:32Z-
dc.date.issued2022-05-
dc.identifier.urihttp://dspace.dtu.ac.in:8080/jspui/handle/repository/19218-
dc.description.abstractIn the customer relationship management business, currently there is a desire for programmed techniques for anticipating future users utilising recommendation engines. There are currently functions for locating "twins," or potential consumers who are similar to current customers, as well as searching the record of clients divided into class. Machine-learning techniques are commonly used in today's recommendation engines. As a result, it's important to figure out which ML algorithms are optimal for building a recommendation engine that can forecast client behaviour. The conditions for determining appropriateness are investigated in this thesis, as well as an evaluation of various off-the-shelf ML techniques. As a result of this, technique of discovering new potential clients, supervised learner models have showed promise. This study is oriented towards learning the behaviour of our customers, so that we can predict out future customer and also can show them their sets of desired products.en_US
dc.language.isoenen_US
dc.relation.ispartofseriesTD-5784;-
dc.subjectCUSTOMER RELATIONSHIP MANAGEMENTen_US
dc.subjectRECOMMENDATION ENGINEen_US
dc.subjectCUSTOMER PREDICTIONen_US
dc.subjectK-NEAREST NEIGHBORSen_US
dc.subjectDECISION TREEen_US
dc.subjectK-MEANS CLUSTERINGen_US
dc.subjectAPRIORIen_US
dc.titleCUSTOMER RECOMMENDATION USING MACHINE LEARNIGN TECHNIQUESen_US
dc.typeThesisen_US
Appears in Collections:M.E./M.Tech. Computer Engineering

Files in This Item:
File Description SizeFormat 
1 Abhirup Das M.Tech Major Project Thesis.pdf3.55 MBAdobe PDFView/Open


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