Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/5924
Title: Effective Pattern Discovery for Text Data Mining
Authors: Jhingrun, Kunal
Verma, Ruchi [Guided by]
Keywords: Data mining
Information retrieval
Inner pattern evolution
Algorithms
Pattern taxonomy
Issue Date: 2015
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: Due to the rapid growth of digital data made available in recent years, knowledge discovery and data mining have attracted a great deal of attention with an imminent need for turning such data into useful information and knowledge. Many applications, such as market analysis and business management, can benefit by the use of the information and knowledge extracted from a large amount of data. Many data mining techniques have been proposed for mining useful patterns in text documents. However, how to effectively use and update discovered patterns is still an open research issue, especially in the domain of text mining. Since most existing text mining methods adopted term-based approaches, they all suffer from the problems of polysemy and synonymy. Over the years, people have often held the hypothesis that pattern (or phrase) based approaches should perform better than the term-based ones, but many experiments do not support this hypothesis. This paper presents an innovative and effective pattern discovery technique which includes the processes of pattern deploying and pattern evolving, to improve the effectiveness of using and updating discovered patterns for finding relevant and interesting information. Substantial experiments on RCV1 data collection and TREC topics demonstrate that the proposed solution achieves encouraging performance.
URI: http://ir.juit.ac.in:8080/jspui//xmlui/handle/123456789/5924
Appears in Collections:B.Tech. Project Reports

Files in This Item:
File Description SizeFormat 
Effective Pattern Discovery for Text Data Mining.pdf1.33 MBAdobe PDFView/Open


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