Abstract

In this 21 st century is completely called as the information science where the large organizations need useful knowledge. The data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. The database consists of a collection of tables (a relational database). Records in each table represent parts, and individuals can be reconstructed by joining over the foreign key relations between the tables. To reduce the I/O cost, the data accessed together during extraction phase are to be clustered in the same disk block. This paper represents the index structure ,what we generally called as the Imine index structure .This structure can efficiently exploited by different item set extraction as well as this novel index structure is implemented by using FPGrowth and LCM V.2 algorithms. Again in this paper we have focused that how the MRDM techniques are used in different approaches like classification, clustering ILP (Inductive Logic Program) etc.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call