Classification and Clustering Methods
Participants : Marc Csernel, Yves Lechevallier [co-correspondant] , Brigitte Trousse [co-correspondant] .
We developed and maintained a collection of clustering and classification software, written in C++ and/or Java:
a Java library (Somlib) that provides efficient implementations of several SOM(Self-Organizing Map) variants  ,  ,  ,  ,  , especially those that can handle dissimilarity data (available on Inria's Gforge server (public access) https://gforge.inria.fr/projects/somlib/ , developed by AxIS Rocquencourt and Brieuc Conan-Guez from Université de Metz.
Unsupervised methods : partioning methods
two partitioning clustering methods on the dissimilarity tables issued from a collaboration between AxIS Rocquencourt team and Recife University, Brazil: CDis and CCClust  . Both are written in C++ and use the “Symbolic Object Language” (SOL) developed for SODAS. And one partioning method on interval data (Div).
two standalone versions improved from SODAS modules, SCluster and DIVCLUS-T  (AxIS Rocquencourt).
Unsupervised methods : agglomerative methods
a Java implementation of the 2-3 AHC (developed by AxIS Sophia Antipolis). The software is available as a Java applet which runs the hierarchies visualization toolbox called HCT for Hierarchical Clustering Toolbox (see  ).
A Web interface developed in C++ and running on our Apache internal Web server.is available for the following methods: SCluster, Div, yCdis, CCClust.
Previous versions of the above software have been integrated in the SODAS 2 Software  which was the result of the european project ASSO (ASSO: Analysis System of Symbolic Official data) (2001-2004). SODAS 2 softsodaslinkware supports the analysis Stof multidimensional complex data (numerical and non numerical) coming from databases mainly in statistical offices and administration using Symbolic Data Analysis  . This software is registrated at APP. The latest executive version of the SODAS 2 software, with its user manual can be downloaded at http://www.info.fundp.ac.be/asso/  ,  .
Extracting Sequential Patterns with Low Support
Participant : Brigitte Trousse [correspondant] .
Two methods for extracting sequential patterns with low support have been developed by D. Tanasa in his thesis (see Chapter 3 in  for more details) in collaboration with F. Masseglia and B. Trousse :
Mining Data Streams
Participants : Brigitte Trousse [correspondante] , Mohamed Gaieb.
In Marascu's thesis (2009)  , a collection of software have been developed for knowledge discovery and security in data streams. Three clustering methods for mining sequential patterns (Java) in data streams method have been developped in Java:
SMDS compares the sequences to each others with a complexity of .
SCDS is an improvement of SMDS, where the complexity is enhanced from to with the number of navigations and the number of clusters.
ICDS is a modification of SCDS. The principle is to keep the clusters' centroids from one batch to another.
Such methods take batches of data in the format "Client-Date-Item" and provide clusters of sequences and their centroids in the form of an approximate sequential pattern calculated with an alignment technique.
In 2010 the Java code of one method called SCDS has been integrated in the MIDAS demonstrator (cf. 8.2.1 ) and a C++ version has been implemented by F. Masseglia for the CRE contract with Orange Labs with the deliverability of a licence) with a visualisation module (in Java).
It has been tested on the following data:
Orange mobile portal logs (100 million records, 3 months) in the context of Midas project ( Java version) and the CRE (Orange C++ version)
Inria Sophia Antipolis Web logs (4 million records, 1 year, Java version)
Vehicle trajectories (Brinkhoff generator http://iapg.jade-hs.de/personen/brinkhoff/generator/ in the context of MIDAS project (Java version)
This year it has been integrated as a Web service (Java version) in the first version of FocusLab platform in the ELLIOT context (cf. 6.5.2 ): a demonstration was made on San Rafaelle Hospital media use case at the first ELLIOT review at Brussels (cf. 220.127.116.11 ).