This paper describes an experiment where classifiers are used to identify potential diagnoses on examining textual content of medical records. Three classifiers are applied separately (k-nearest neighborhood, multilayer perceptron and support vector machines) and also combined in two different approaches (parallel and cascading); results show that even accuracy point to a best alternative, ROC ...

The Self-Organizing Map (SOM) is a powerful tool in the exploratory phase of data mining. However, due to the dimensional conflict, the neighborhood preservation cannot always lead to perfect topology preservation. In this paper, we establish an Expanding SOM (ESOM) to detect and preserve better topology correspondence between the two spaces. Our experiment results demonstrate that the ESOM con...

The choice of a proximity measure between objects has a direct impact on the results of any operation of classification, comparison, evaluation or structuring a set of objects. In many application fields, for a given problem, the user is prompted to choose one among the many existing proximity measures. However, according to the notion of topological equivalence chosen, some are more or less eq...

We present a data mining approach for reducing the search space of local search algorithms in large-scale set partitioning problems (SPPs). We construct a k-nearest neighbor graph by extracting variable associations from the instance to be solved, in order to identify promising pairs of flipping variables in the large neighborhood search. We incorporate the search space reduction technique into...