The week's pick
Reseach Article
Survey of Object Oriented Mining for XML Data
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 16 - Number 4 |
| Year of Publication: 2011 |
| Authors: T.Sangeetha, G.Sophia Reena, T.Priya |
10.5120/2002-2699
|
T.Sangeetha, G.Sophia Reena, T.Priya . Survey of Object Oriented Mining for XML Data. International Journal of Computer Applications. 16, 4 ( February 2011), 13-19. DOI=10.5120/2002-2699
Abstract
According to the Petr Kuba, to adapt OR-FP for mining in XML data we preserve basic principles of the algorithm and modify only the input interface. To map XML data to our system we can use the following mapping: XML elements can be processed similarly to the objects in object-oriented data. The name of element corresponds to the class and the attributes of element correspond to the attributes of object. The content of the element (text nodes and elements) can be stored in a special attribute of the object. The type of this attribute should be a set or list – depending on whether we want to deal with an order of nodes. Some specifications (XPointer, XLink) add one more interesting feature to XML data – they allow us to use references to another documents or elements. We can represent this relation as simply as object references. Our proposal is to mining frequent pattern in collection of XML documents.
References
- Fayyad, U. M., Piatetsky-Shapiro, G., and Smyth, P. From Data Mining to Knowledge Discovery in Databases. AI Magazine 17, 3 (1996), 37–54.
- Famili, A., Shen, W.-M., Weber, R., and Simoudis, E. Data preprocessing and intelligent data analysis. Intelligent Data Analysis Journal 1, 1 (1997).
- Kramer, S., Lavraˇc, N., and Flach, P. Propositionalization approaches to relational data mining. In Relational Data Mining, S. Dˇzeroski and N. Lavraˇc, Eds. Springer-Verlag, September 2001, pp. 262–291.
- Domingos, P. Unifying instance-based and rule-based induction. Machine Learning 24, 2 (1996), 141–168.
- Agrawal, R., Imielinski, T., and Swami, A. N. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26–28, 1993 (1993), P. Buneman and S. Jajodia, Eds., ACM Press, pp. 207–216.
- Agrawal, R., and Srikant, R. Fast algorithms for mining association rules in large databases. In VLDB’94, Proceedings of 20th International Conference on Very Large Data Bases, September 12–15, 1994, Santiago de Chile, Chile (1994), J. B. Bocca, M. Jarke, and C. Zaniolo, Eds., Morgan Kaufmann, pp. 487–499.
- Muggleton, S. Inductive Logic Programming. New Generation Computing 8, 4 (1991), 295–318.
- Muggleton, S., and Raedt, L. D. Inductive logic programming: Theory and methods. Journal of Logic Programming 19/20 (1994), 629–679.
- Dehaspe, L., and Toivonen, H. Frequent query discovery: a unifying ILP approach to association rule mining. Tech. Rep. CW 258, Katholieke Univesiteit Leuven, Departmen of Computer Science, Celestijnenlaan 200A – B-3001 Heverlee (Belgium), March 1998.
- Fayyad, U. M., Piatetsky-Shapiro, G., and Smyth, P. Knowledge Discovery and Data Mining: Towards a Unifying Framework. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96) (1996), p. 82.
- Mannila, H., and Toivonen, H. An algorithm for finding all interesting sentences. In Proceedings of the 6th Internation Conference on Database Theory (1996), pp. 215–229.
- Dehaspe, L., and Raedt, L. D. Mining association rules in multiple relations. In ILP (1997), N. Lavrac and S. Dzeroski, Eds., vol. 1297 of Lecture Notes in Computer Science, Springer, pp. 125–132.
Index Terms
Keywords