CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Efficient Updating of Discovered Patterns for Text Mining: A Survey

by Anisha Radhakrishnan, Mathew Kurian
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 1
Year of Publication: 2012
Authors: Anisha Radhakrishnan, Mathew Kurian
10.5120/9248-3412

Anisha Radhakrishnan, Mathew Kurian . Efficient Updating of Discovered Patterns for Text Mining: A Survey. International Journal of Computer Applications. 58, 1 ( November 2012), 29-33. DOI=10.5120/9248-3412

@article{ 10.5120/9248-3412,
author = { Anisha Radhakrishnan, Mathew Kurian },
title = { Efficient Updating of Discovered Patterns for Text Mining: A Survey },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 1 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 29-33 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number1/9248-3412/ },
doi = { 10.5120/9248-3412 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:01:26.243438+05:30
%A Anisha Radhakrishnan
%A Mathew Kurian
%T Efficient Updating of Discovered Patterns for Text Mining: A Survey
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 1
%P 29-33
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Text mining is the techniques of retrieving interesting information from the text document. Through the devising of patterns, we can retrieve high-quality information. There are many techniques for mining the useful patterns from the text document. Researchers are still going in efficient updating of discovered pattern. Polysemy and synonymy are the problem faced in term based approach. Phrase based approach also did not provide the efficient results. This paper presents an outline of effectiveness of using and updating patterns for finding interesting and relevant information from the text document by using two methods pattern evolving and deploying.

References
  1. R. Agrawal and R. Srikant. "Mining sequential patterns. " Research Report RJ 9910, IBM Almaden Research Center, San Jose, California, October 1994.
  2. Hye-Chung Kum, Joong Hyuk Chang, and Wei Wang: "Sequential Pattern Mining in Multi-Databases via Multiple Alignments. IEEE Trans on Data Mining Knowledge and Discovery. 12(2-3): 151-180 (2006).
  3. F. Sebastiani. "Machine learning in automated text categorization. " ACM Computing 34(1):1–47, 2002.
  4. Klinkenberg, Ralf and Renz, Ingrid. "Adaptive Information Filtering: Learning in the Presence of Concept Drifts. " learning for Text Categorization, Menlo Park, CA, USA, AAAI Press, pages 33--40 1998
  5. R. Agrawal and R. Srikant. "Fast algorithms mining association rules. " In Proc. of the VLDB Conference, Santiago, Chile, September 1994. Expanded version available as IBM Research Report RJ9839, June 1994.
  6. Han, J. and Kamber, M. "Data Mining Concepts and Techniques. " 3rd edition, University of Illinois at Urbana-Champaign, Morgan Kanufmann publishers 2006.
  7. C. Borgelt. Sam: "Simple Algorithms for Frequent Item Set Mining". IFSA/EUSFLAT 2009 conference- 2009.
  8. J. Han and J. Pei. "Mining frequent patterns by pattern-growth: methodology and implications. " SIGKDD Explore. Newsl. 2(2):14{20, 2000.
  9. R. Srikant and R. Agrawal. "Mining sequential patterns: Generalizations and performance improvements. " In P. M. G. Apers, M. Bouzeghoub, and G. Gardarin, editors,Proc. 5th Int. Conf. Extending Database Technology.
  10. M. J. Zaki. Spade: "An efficient algorithm for mining frequent sequences. " Machine Learning, 42(1-2):31{60, 2001.
  11. Han, J. , Pei, J. , Mortazavi-Asl, B. , Chen, Q. , Dayal, U. , and Hsu, M. -C. 2000. "Free span: frequent pattern-projected sequential pattern mining. " In Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining. ACM Press, 355{359.
  12. S. -T. Wu, Y. Li, and Y. Xu, "Deploying Approaches for Pattern Refinement in Text Mining," Proc. IEEE Sixth
  13. J. Wang and J. Han. BIDE, "Efficient Mining of Frequent Closed Sequences," Proceedings of the 2004 IEEE International Conference on Data Engineering (ICDE), pp. 79–90, 2004.
  14. S. -T. Wu, Y. Li, and Y. Xu. "An effective deploying algorithm for using pattern-taxonomy" In iiWAS'05, pages 1013–1022, 2005.
  15. Li, Yuefeng , Zhong, Ning "Capturing evolving patterns for ontology-based web mining. " In Zhong, N. Tirri, & Yao, Y. (Eds. ) IEEE /WIC/ACM International Joint Conference on Web Intelligence (WI) and Intelligent Agent Technology (IAT), 20-24 Beijing, China. Sept. 2004.
  16. Y. Li and N. Zhong. "Mining ontology for automatically acquiring web user information needs. " IEEE Trans. On Knowledge and Data Engineering, 18(4):554–568, 2006.
  17. S. -T. Wu, Y. Li, and Y. Xu. "An effective deploying algorithm for using pattern-taxonomy" In iiWAS'05, pages 1013–1022, 2005.
  18. X. Yan, J. Han, and R. Afshar. ColSpan: Mining closed sequential patterns in large datasets. In SDM'03, 2003.
Index Terms

Computer Science
Information Sciences

Keywords

Text mining text classification pattern mining pattern deploying pattern evolving

Powered by PhDFocusTM