Please use this identifier to cite or link to this item: http://repository.iiitd.edu.in/xmlui/handle/123456789/663
Full metadata record
DC FieldValueLanguage
dc.contributor.authorThukral, Deepak
dc.contributor.authorGoyal, Vikram (Advisor)
dc.contributor.authorChakraborty, Tanmoy (Advisor)
dc.date.accessioned2018-09-24T10:39:06Z
dc.date.available2018-09-24T10:39:06Z
dc.date.issued2018-04-18
dc.identifier.urihttp://repository.iiitd.edu.in/xmlui/handle/123456789/663
dc.description.abstractAutomatic estimation of relative difficulty of a pair of questions is an important and challenging problem in community question answering (CQA) services. There are limited studies which addressed this problem. Past studies mostly leveraged expertise of users answering the questions and barely considered other properties of CQA services such as metadata of users and posts,temporal information and textual content. In this paper, we propose a system, a novel system that maps this problem to a network-aided edge directionality prediction problem. Given a question on a crowd sourced platform, we gauge the difficulty of the question. We used various graph models in order to model our intuition of how difficulty is associated with questions, the answerers, the asker and how over time the difficulty of one’s questions changeen_US
dc.language.isoen_USen_US
dc.publisherIIIT-Delhien_US
dc.subjectData Analysisen_US
dc.subjectStackoverflowen_US
dc.subjectGraph Miningen_US
dc.subjectTime-evolving networksen_US
dc.subjectNetwork Constructionen_US
dc.subjectEdge Directionality Predictionen_US
dc.titleRelative difficulty estimation in community answering servicesen_US
dc.typeOtheren_US
Appears in Collections:Year-2018

Files in This Item:
File Description SizeFormat 
Deepak Thukral_2014036.pdf
  Restricted Access
771.36 kBAdobe PDFView/Open Request a copy


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