A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases

This paper introduces a link analysis procedure for discovering relationships in a relational database or a graph, generalizing both simple and multiple correspondence analysis. It is based on a random walk model through the database defining a Markov chain having as many states as elements in the database. Suppose the authors are interested in analyzing the relationships between some elements (or records) contained in two different tables of the relational database. To this end, in a first step, a reduced, much smaller, Markov chain containing only the elements of interest and preserving the main characteristics of the initial chain, is extracted by stochastic complementation. This reduced chain is then analyzed by projecting jointly the elements of interest in the diffusion map subspace and visualizing the results.

Provided by: Institute of Electrical and Electronics Engineers Topic: Data Management Date Added: Apr 2011 Format: PDF

Find By Topic