文章基本信息

标题：Mining Text using Levenshtein Distance in Hierarchical Clusteing
本地全文：下载
作者：Simranjit Kaur, Prof. Kiranjyoti
期刊名称：International Journal of Computer Techniques
电子版ISSN：2394-2231
出版年度：2015
期号：3753
页码：92-97
出版社：International Research Group - IRG
摘要：Intelligent text mining is subject that has caught up the attention of most Business house and Data researchers. In 2013, 5 Exabyte of data is produced on daily basis this data without further analysis and summarization is wasted. Hence researchers has developed many algorithm and systems to record, analyze, filter and summarize the produced data so that important business can be taken effectively, efficiently and in within no time. But small spelling or grammar error found in a textual data can register them as noise and thus losing important piece of information. Hence correcting those mistakes before realization is of paramount significance. But since the number of textual information is humongous, there is a lack of time critical algorithms. Hence this paper presents an algorithm for time effective corrective measure. Keyword: - Levenshtein Distance, Hierarchical Clustering, Edit Distance and Text Mining