Show simple item record

dc.contributor.advisorJat, P.M.
dc.contributor.advisorDasgupta, Sourish
dc.contributor.authorAnjana, Rita
dc.date.accessioned2019-03-19T09:30:54Z
dc.date.available2019-03-19T09:30:54Z
dc.date.issued2018
dc.identifier.citationAnjana, Rita (2018). Cluster recommendation of scientific literature for research area analytics. Dhirubhai Ambani Institute of Information and Communication Technology, vii, 38 p. (Acc. No: T00716)
dc.identifier.urihttp://drsr.daiict.ac.in//handle/123456789/750
dc.description.abstractDue to a fast-paced increase of the number of research articles published, it ishard for a researcher to find relevant articles. Research paper RecommendationSystems help in finding the relevant research article. Most Article RecommendationSystems are realized through clusteringIn this thesis, we mainly focus on clustering of documents which helps laterfor the recommendation of scholarly articles. When a user is searching for anypaper, he/she has a different kind of search purpose like "search for the paperwhich solves the same problem that a user wants to solve" or "the papers whichsolve the same problem with different approaches" etc. Here our aim is to groupall those papers that solve the same problem. Further in attempt to extract researchproblems from the article and attempt "problem-based" clustering. In thiswork, we explored various state-of-art clustering techniques for the said objective.We propose a hierarchical approach to cluster scientific papers which addressthe same problems. First we cluster research articles based on their abstracts.Within a topic, we further cluster them based on "problem" extracted from abstract.For first level clustering, we use topic modeling technique Latent Dirichletallocation.For second level clustering, we use Linguistic clues for extracting "problem" ofarticles. We try K-means algorithms with the different features. Also, merge twoclustering techniques K-means and K-nearest neighbors.We conducted experimental studies on DBLP. We show how the result of Kmeansalgorithm depends on features which are used to train algorithms. Comparethe results of different approaches.
dc.publisherDhirubhai Ambani Institute of Information and Communication Technology
dc.subjectClustering
dc.subjectLatent dirichlet allocation
dc.subjectCoherence model
dc.subjectK-mean
dc.classification.ddc006.31 ANJ
dc.titleCluster recommendation of scientific literature for research area analytics
dc.typeDissertation
dc.degreeM. Tech
dc.student.id201611028
dc.accession.numberT00716


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record