India
In an increasingly competitive world, automated screening of resumes of candidates is the need of the hour given the large numbers of such resumes in career portals on the World Wide Web. Resume classification is a subset of the document classification problem in which the keywords extracted from the resume play a significant role in determining the job profile. In this paper, we explore the novel combination of uniqueness in terms of the number of occurrences of a keyword in a resume class as compared to the other resume classes, and the concept of semantics by representing the filtered keywords using word embeddings that can be used to find semantic similarities between resume documents. The principle of maximum entropy partitioning is used to find the keywords unique to a particular class. The aim is to use semantic representations of only those keywords that occur more frequently in one class more than in any other class; these are then passed as input to a Bidirectional long short-term memory (LSTM) for classification. Our experiments on a benchmark dataset proves that the proposed approach outperforms the state of the art in text classification by a significant margin proving the efficacy of our approach.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados