Intelligent XML Query-Answering Support with Efficiently Updating XML Data in Data Mining
Main Article Content
Abstract
Data is present in various unstructured format. Extracting information from non structured documents is a very difficult task and it is become more and more critical when the amount of digital information available over the internet increases. This paper is based on design of Branch Organization Rule (BOR) results in approximate answer of queries for mining. XML is popular portable language best suitable for many web technologies hence we prefer XML. While implementing XML Query Answering we are going to implement Naïve Bayes as Machine learning algorithm which we will use specially for Query Classification. We are also implementing same concept for rules classifications by using which the trees are generated after applying queries. Due to creating classification of queries our accuracy of results will increase.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
IJCERT Policy:
The published work presented in this paper is licensed under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. This means that the content of this paper can be shared, copied, and redistributed in any medium or format, as long as the original author is properly attributed. Additionally, any derivative works based on this paper must also be licensed under the same terms. This licensing agreement allows for broad dissemination and use of the work while maintaining the author's rights and recognition.
By submitting this paper to IJCERT, the author(s) agree to these licensing terms and confirm that the work is original and does not infringe on any third-party copyright or intellectual property rights.
References
Mirjana Mazuran, Elisa Quintarelli, and Letizia Tanca “Data Mining for XML Query-Answering Support”, IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 24, NO. 8, AUGUST 2012
A. Evfimievski, R. Srikant, R. Agrawal, and J. Gehrke, “Privacy Preserving Mining of Association Rules,” Proc. Eighth ACM Int‟l Conf. Knowledge Discovery and Data Mining, pp. 217-228, 2002.
C. Combi, B. Oliboni, and R. Rossato, “Querying XML Documents by Using Association Rules,” Proc. 16th Int‟l Conf. Database and Expert Systems Applications, pp. 1020-1024, 2005
D. Braga, A. Campi, S. Ceri, M. Klemettinen, and P. Lanzi, “Discovering Interesting Information in XML Data with Association Rules,” Proc. ACM Symp. Applied Computing, pp. 450- 454, 2003.
D. Barbosa, L. Mignet, and P. Veltri, “Studying the XML Web: Gathering Statistics from an XML Sample,” World Wide Web, vol. 8, no. 4, pp. 413-438, 2005.
E. Baralis, P. Garza, E. Quintarelli, and L. Tanca, “AnsweringXMLQueries by Means of Data Summaries,” ACM Trans.InformationSystems, vol. 25, no. 3, p. 10, 2007.
L. Feng, T.S. Dillon, H. Weigand, and E. Chang, “An XMLEnabled Association Rule Framework,” Proc. 14th Int‟l Conf. Database and Expert Systems Applications, pp. 88-97, 2003.
World Wide Web Consortium, XML Schema, http:// www.w3C.org/TR/xmlschema-1/, 2001.
Chai, K.; H. T. Hn, H. L. Chieu; “Bayesian Online Classifiers for Text Classification and Filtering”, Proceedings of the 25th annual international ACM SIGIR conference on Research and Development in Information Retrieval, August 2002.
DATA MINING Concepts and Techniques, Jiawei Han, Micheline Kamber Morgan Kaufman Publishers, 2003