CFP last date
22 April 2024
Call for Paper
May Edition
IJCA solicits high quality original research papers for the upcoming May edition of the journal. The last date of research paper submission is 22 April 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

Article:Rule Generation from Textual Data by using Graph based Approach

by D.S Rajput, R.S. Thakur, G.S. Thakur
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 31 - Number 9
Year of Publication: 2011
Authors: D.S Rajput, R.S. Thakur, G.S. Thakur
10.5120/3855-5373

D.S Rajput, R.S. Thakur, G.S. Thakur . Article:Rule Generation from Textual Data by using Graph based Approach. International Journal of Computer Applications. 31, 9 ( October 2011), 36-43. DOI=10.5120/3855-5373

@article{ 10.5120/3855-5373,
author = { D.S Rajput, R.S. Thakur, G.S. Thakur },
title = { Article:Rule Generation from Textual Data by using Graph based Approach },
journal = { International Journal of Computer Applications },
issue_date = { October 2011 },
volume = { 31 },
number = { 9 },
month = { October },
year = { 2011 },
issn = { 0975-8887 },
pages = { 36-43 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume31/number9/3855-5373/ },
doi = { 10.5120/3855-5373 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:17:44.192166+05:30
%A D.S Rajput
%A R.S. Thakur
%A G.S. Thakur
%T Article:Rule Generation from Textual Data by using Graph based Approach
%J International Journal of Computer Applications
%@ 0975-8887
%V 31
%N 9
%P 36-43
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this study we investigate the significance of textual document which is now commonly recognized by researchers for better management, smart navigation, well-organized filtering, and finding the results. The challenging part is to extract the meaningfulness and to manage the purpose of the “best” Mining Rule .This research study is proposed to refine the Mining Rule from textual data set by performing Graph based approach.

References
  1. R. Agrawal, T. Imielinski, and A. Swami. Mining Association Rules between sets of items in large Databases. ACM SIGMOD Records, 1993 pp 207-216.
  2. L. Singh, B. Chen, R. Haight, and P. Scheuermann. An algorithm for constrained association rule: Mining in semistructured data. In Proceedings of the third Pacific-Asia Conference, PAKDD '99, Beijing, China, 1999.
  3. R. Agrawal and R. Skirant. “Fast algorithms for mining association rules”. In Proceedings of the 20th Int 'I Conference on Very Large Databases, June 1994 pp. 478-499.
  4. R.S. Thakur, R. C. Jain, K.R. Pardasani “Graph Theoretic Based Alogorihtm for mining frequent Pattern” International Joint Conference on Neural Networks (IJCNN 2008),pp 628-632.
  5. Ch. Cherif Latiri, S. BenYahia “Generating Implicit Association Rules from Textual Data” IEEE, 2001 pp 137- 143.
  6. S. Ghanshyam Thakur, Rekha Thakur and R.C. Jain, “Association Rule Generation from Textual Document” International Journal of Soft Computing, 2: 2007 pp. 346-348.
  7. B. Ganter and R. Wille. Formal Concept Analysis. Springer-Verlag, Heidelberg, 1999.
  8. Hany Mahgoub, Dietmar Rösner, Nabil Ismail and Fawzy Torkey, “Text Mining Technique Using Association Rules Extraction” International Journal of Information and Mathematical Sciences, 2008 pp. 21-28.
  9. J.Hen ,J. Pei, and Y. Yin,“ Mining Frequent patters without candidate generation,” Prod. SIGMOD 2002.
  10. J.Pei, J. Han, H. LU,S. Nishio, S. Tang and D. Yang,” H-Mine: Hyper-structure Mining of frequent Patterns in large database,” in Proc. The IEEE international conference on data mining, ,2001 pp. 441-448.
  11. J.Pei, J. Han and Lakshmanan “ Mining frequent itemsets with Convertible Constraints”, in ICDE 2001.
  12. Han I and Kamber M, “Data Mining concepts and Techniques,”Morgar Kaufmann Publishers,2000, pp.335–389.
  13. Zhang Yuhang,Wang Yue, Yang Wei, “Research on Data Cleaning in Text Clustering” International Forum on Information Technology and Applications 2010.
  14. N. Manerikar, T. Palpanas, Frequent items in streaming data: an experimental evaluation of the state-of-the-art, Data and Knowledge Engineering 68 (4), 2009 pp. 415–430.
  15. Vijender Singh, Deepak Garg, “Survey of Finding Frequent Patterns in Graph Mining: Algorithms and Techniques” International Journal of Soft Computing and Engineering (IJSCE) ISSN: 2231-2307, Volume-1, Issue-3, July 2011.
  16. J. Huan, W. Wang, J. Prins and J. Yang,”Spin: mining maximal frequent subgraphs from graph Databases”, KDD04 Seattle,Washington, USA, 2004.
  17. Yang, Parthasarthy and Sadayappan, “Fast Mining Algorithms of Graph data on GPUs.” ACM, KDD-LDMTA’10, 2010.
  18. Tao Li, “A General Model for Clustering Binary Data” KDD’05, August 21–24, 2005, Chicago, Illinois, USA pp. 188-197.
  19. Mickey, M. R., Mundle, P., & Engelman, L. (1988). Boolean factor analysis. In Bmdp statistical software manual, vol. 2, University of California Press , pp. 789–800..
  20. Tin Kam Ho, “Stop word location and identification for adoptive text reorganization.”Brisbane, Australia, Augest17-20,1998, pp. 605-609.
  21. R. Feldman and H. Hirsh, “Mining Associations in Text in the Presence of Background Knowledge,” Knowledge Discovery and Data Mining, 1996 pp. 343-346, http://citeseer.ist.psu.edu/feldman96mining.html.
  22. J.D. Holt and S.M. Chung, “Multipass Algorithms for Mining Association Rules in Text Databases,” Knowledge Information System, vol. 3, no. 2, 2001 pp. 168-183.
  23. C. Manning and H Schütze, Foundations of statistical natural language processing (MIT Press, Cambridge, MA, 1999).
  24. J. Paralic and P. Bednar, “Text mining for documents annotation and ontology support (A book chapter in: "intelligent systems at service of Mankind,” ISBN 3-935798-25-3, Ubooks, Germany, 2003).
  25. M. Rajman and R. Besancon, “Text mining: natural language techniques and text mining applications”, in Proc. 7th working conf. on database semantics (DS-7), Chapan &Hall IFIP Proc. Series. Leysin, Switzerland Oct. 1997, 7-10.
  26. K. Wang, C. Xu, B. Liu, Clustering transactions using large items, in: Proceedings of the 8th International Conference on Information and Knowledge Management, 1999, pp. 483–490.
  27. B.C.M. Fung, K. Wang, M. Ester, Hierarchical document clustering using frequent itemsets, in: Proceedings of SIAM International Conference on Data Mining, 2003.
  28. E. Ukkonen, On-line construction of suffix trees, Algorithmica 14 (1994), pp. 249–260.
  29. W.-L. Liu and X.-S. Zheng, "Documents Clustering based on Frequent Term Sets", Intelligent Systems and Control, 2005.
  30. Zhitong Su ,Wei Song ,Manshan Lin ,Jinhong Li, "Web Text Clustering for Personalized Elearning Based on Maximal Frequent Itemsets", Proceedings of the 2008 International Conference on Computer Science and Software Engineering ,2008, Vol: 06, Pages: 452-455.
  31. A.M. Fahim, G. Saake, A.M. Salem, F. A. Torkey, M.A. Ramadan,“ K-mens for spherical clusters with large variance in sizes.” World Academy of science, Engineering & Tech., 45, 2008, pp.177-182.
  32. Winnie W.M. Lam, Keith C. C. Chan, “Analyzing Web Layout Structures using Graph Mining”, Granular Computing, 2008. GrC 2008. IEEE International Conference 2008 pp.361-366.
Index Terms

Computer Science
Information Sciences

Keywords

Association Rule pre-processing Technique Adjacency Matrix Textual Data

Powered by PhDFocusTM