## Section: Scientific Foundations

### Data Mining Methods

Data Mining (DM) is the core of knowledge discovery in databases whatever the contents of the databases are. Here, we focus on some aspects of DM we use to describe documents and to retrieve information. There are two major goals to DM: description and prediction. The descriptive part includes unsupervised and visualization aspects while prediction is often referred to as supervised mining.

The description step very often includes feature extraction and dimensional reduction. As we deal mainly with contingency tables crossing "documents and words", we intensively use factorial correspondence analysis. "Documents" in this context can be a text as well as an image.

Correspondence analysis is a descriptive/exploratory technique designed to analyze simple two-way and multi-way tables containing some measure of correspondence between the rows and columns. The results provide information which is similar in nature to those produced by factor analysis techniques, and they allow one to explore the structure of categorical variables included in the table. The most common kind of table of this type is the two-way frequency cross-tabulation table. There are several parallels in interpretation between correspondence analysis and factor analysis: suppose one could find a lower-dimensional space, in which to position the row points in a manner that retains all, or almost all, of the information about the differences between the rows. One could then present all information about the similarities between the rows in a simple 1, 2, or 3-dimensional graph. The presentation and interpretation of very large tables could greatly benefit from the simplification that can be achieved via correspondence analysis (CA).

One of the most important concept in CA is inertia, *i.e.* , the
dispersion of either row points or column points around their gravity
center. The inertia is linked to the total
Pearson ^{2} for the two-way table. Some rows and/or some columns will be
more important due to their quality in a reduced dimensional space and their
relative inertia.
The quality of a point represents the proportion of the
contribution of that point to the overall inertia that
can be accounted for by the chosen number of dimensions. However, it
does not indicate whether or not, and to what extent, the respective
point does in fact contribute to the overall inertia (^{2}
value). The relative inertia represents the proportion of the total
inertia accounted for by the respective point, and it is independent
of the number of dimensions chosen by the user. We use the relative inertia
and quality of points to characterize clusters of documents.
The outputs of CA are generally very large. At this step, we use different
visualization methods to focus on the most important results of the analysis.

In the supervised classification task, a lot of algorithms can be used, the most popular ones are the decision trees and more recently the Support Vector Machines (SVM). SVMs provide very good results in supervised classification but they are used as "black boxes" (their results are difficult to explain). We use graphical methods to help the user understanding the SVM results, based on the data distribution according to the distance to the separating boundary computed by the SVM and another visualization method (like scatter matrices or parallel coordinates) to try to explain this boundary. Other drawbacks of SVM algorithms are their computational cost and large memory requirement to deal with very large datasets. We have developed a set of incremental and parallel SVM algorithms to classify very large datasets on standard computers.