Title: An effective approach to mine relational patterns and its extensive analysis on multi-relational databases
Authors: D. Vimal Kumar; A. Tamilarasi
Addresses: Department of MCA, SAN International Info. School, ACC Pirivu, Navakkarai (PO), Mavuthampathy Village, (Walayar), Coimbatore – 641105, Tamil Nadu, India ' Department of MCA, Kongu Engineering College, Erode, Tamil Nadu, India
Abstract: The real world applications of data mining necessitate more complicated solutions when the data includes large quantity of records in several tables of relational database. One of the possible solutions is multi-relational pattern mining, which is a form of data mining applicable to data in multiple tables. In this paper, we have developed an effective approach to mine relational patterns from multi-relational database. Initially, the multi-relational database is represented using a tree-based data structure without changing their relations. A tree pattern mining algorithm is devised and applied on the constructed tree-based data structure for extracting the frequent relational patterns. Experimentation is carried out on two different databases and the results are compared with the previous approach using number of similar relational patterns generated and the computation time. The comparative analysis shows that the proposed approach is more effective in mining performance and computation time compared to the previous approach.
Keywords: multi-relational data mining; MRDM; relational patterns; tree pattern mining; multi-relational databases; customer order database.
International Journal of Data Mining, Modelling and Management, 2013 Vol.5 No.3, pp.277 - 297
Published online: 29 Jul 2014 *Full-text access for editors Access for subscribers Purchase this article Comment on this article