In this paper, we concentrated on creating productive mining calculation for finding designs from expansive information accumulation. What’s more, scan for helpful and intriguing examples. In the field of text mining, design mining systems can be utilized to discover different text designs, for example, visit itemsets, shut successive itemsets, co-happening terms. This paper shows an imaginative and successful example revelation strategy which incorporates the procedures of example sending an example advancing, to enhance the viability of utilizing and refreshing found examples for finding significant and intriguing data. In proposed framework we can take adequate .txt record as data sources and we apply different calculations and produce expected outcomes. Text-mining alludes by and large to the way toward removing fascinating and non-trifling data and information from unstructured text. A critical contrast with seek is that hunt requires a client to realize what he or she is searching for while text mining endeavors to find data in an example that isn`t known in advance.

Text mining, text classification, pattern mining, pattern evolving, information filtering

[1] W. Lam, M.E. Ruiz, and P. Srinivasan, “Automatic Text Categorization and Its Application to Text Retrieval,” IEEE Trans. Knowledge and Data Eng., vol. 11, no. 6, pp. 865-879, Nov./Dec. 1999.
[2] D.D. Lewis, “An Evaluation of Phrasal and Clustered Representations on a Text Categorization Task,” Proc. 15th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’92), pp. 37-50, 1992.
[3] D.D. Lewis, “Feature Selection and Feature Extraction for Text Categorization,” Proc. Workshop Speech and Natural Language, pp. 212-217, 1992.
[4] D.D. Lewis, “Evaluating and Optimizing Automous Text Classification Systems,” Proc. 18th Ann. Int’l ACM SIGIR Conf. Research and Development in Information Retrieval (SIGIR ’95), pp. 246-254, 1995.
[5] X. Li and B. Liu, “Learning to Classify Texts Using Positive and Unlabeled Data,” Proc. Int’l Joint Conf. Artificial Intelligence (IJCAI ’03), pp. 587-594, 2003.
[6] [22] Y. Li, W. Yang, and Y. Xu, “Multi-Tier Granule Mining for Representations of Multidimensional Association Rules,” Proc. IEEESixth Int’l Conf. Data Mining (ICDM ’06), pp. 953-958, 2006.
[7] [23] Y. Li, C. Zhang, and J.R. Swan, “An Information Filtering Model on the Web and Its Application in Jobagent,” Knowledge-Based Systems, vol. 13, no. 5, pp. 285-296, 2000.
[8] Y. Li and N. Zhong, “Interpretations of Association Rules by Granular Computing,” Proc. IEEE Third Int’l Conf. Data Mining (ICDM ’03), pp. 593-596, 2003.
[9] Y. Li and N. Zhong, “Mining Ontology for Automatically Acquiring Web User Information Needs,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 4, pp. 554-568, Apr. 2006.
[10] Y. Li, X. Zhou, P. Bruza, Y. Xu, and R.Y. Lau, “A Two-Stage Text Mining Model for Information Filtering,” Proc. ACM 17th Conf. Information and Knowledge Management (CIKM ’08), pp. 1023-1032, 2008.
[11] H. Lodhi, C. Saunders, J. Shawe-Taylor, N. Cristianini, and C. Watkins, “Text Classification Using String Kernels,” J. Machine Learning Research, vol. 2, pp. 419-444, 2002.
[12] Maedche, “Ontology Learning for the Semantic Web”. Kluwer Academic, 2003.