Please use this identifier to cite or link to this item: http://172.22.28.37:8080/xmlui/handle/1/416
Full metadata record
DC FieldValueLanguage
dc.contributor.authorPatil, Ganesh Bhagwanrao-
dc.date.accessioned2018-10-30T07:22:50Z-
dc.date.available2018-10-30T07:22:50Z-
dc.date.issued2013-
dc.identifier.urihttp://localhost:8080/xmlui/handle/1/416-
dc.descriptionUnder The Guidance Of Prof. S. S. Patilen_US
dc.description.abstractAs the exponential explosion of various contents generated on the Web, Recommendation techniques have become increasingly indispensable. Innumerable different kinds of recommendations are made on the Web every day, including music, images, books recommendations, query suggestions, etc. No matter what types of data sources are used for the recommendations, essentially these data sources can be modeled in the form of graphs. In this paper, aiming at providing a general framework on mining Web graphs for recommendations, • We first propose a novel diffusion method which propagates similarities between different recommendations ; • Then we illustrate how to generalize different recommendation problems into our graph diffusion framework. The proposed framework can be utilized in many recommendation tasks on the World Wide Web, including query suggestions, image recommendations, etc. The experimental analysis on large datasets shows the promising future of our work.en_US
dc.language.isoenen_US
dc.publisherRajarambapu Institute of Technology, Rajaramnagaren_US
dc.subjectRecommendationen_US
dc.subjectheat diffusionen_US
dc.subjectquery suggestionen_US
dc.titleFramework for recommendation on large scale web graphs using Heat Diffusionen_US
dc.typeThesisen_US
Appears in Collections:M.Tech Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
Framework for recommendation on large scale web graphs using Heat Diffusion.pdf
  Restricted Access
3.55 MBAdobe PDFView/Open Request a copy


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