A Link Analysis Extension of Correspondence Analysis for Mining Relational Databases

—This work 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 we 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 [41]. This reduced chain is then analyzed by projecting jointly the elements of interest in the diffusion-map subspace [42] and visualizing the results. This two-step procedure reduces to simple correspondence analysis when only two tables are defined and to multiple correspondence analysis when the database takes th...

• Type: Journal
• Year: 2011
• Where: TKDE
• Authors: Luh Yen, Marco Saerens, François Fouss
• Keywords: Correspondence Analysis, Databases, Relational Databases, TKDE 2011