Semi-supervised consensus clustering integrates supervised information into consensus clustering in order to improve the quality of clustering. In this paper, we study the novel Semi-MultiCons semi-supervised consensus clustering method extending the previous MultiCons approach. Semi-MultiCons aims to improve the clustering result by integrating pairwise constraints in the consensus creation process and infer the number of clusters K using frequent closed itemsets extracted from the ensemble members. Experimental results show that the proposed method outperforms other state-of-art semi-supervised consensus algorithms.

Registered as Defensive Paper of the Intellectual Property Invention "Clustering Techniques for Revenue Accounting Error-Handling Automation", Patent number ID2326WW00, Intellectual Property Board, Amadeus S.A.S., Sophia Antipolis, France. July, 2020.

Clustering is the process of partitioning a dataset into groups based on the similarity between the instances.Many clustering algorithms were proposed, but none of them proved to provide good quality partition in all situations.Consensus clustering aims to enhance the clustering process by combining different partitions obtained from different algorithms to yield a better quality consensus solution.In this work, we propose a new consensus method that uses a pattern mining technique in order to reduce the search space from instance-based into pattern-based space.Instead of finding one solution, our method generates multiple consensus candidates based on varying the number of base clusterings considered.The different solutions are then linked and presented as a tree that gives more insight about the similarities between the instances and the different partitions in the ensemble.

Clustering is the process of partitioning a dataset into groups based on the similarity between the instances. Many clustering algorithms were proposed, but none of them proved to provide good quality partition in all situations. Consensus clustering aims to enhance the clustering process by combining different partitions obtained from different algorithms to yield a better quality consensus solution. In this work, we propose a new consensus clustering method that uses a pattern mining technique in order to reduce the search space from instance-based into pattern-based space. Instead of finding one solution, our method generates multiple consensus candidates based on varying the number of base clusterings considered. The different solutions are then linked and presented as a tree that gives more insight about the similarities between the instances and the different partitions in the ensemble.

UNLABELLED: GenMiner is an implementation of association rule discovery dedicated to the analysis of genomic data. It allows the analysis of datasets integrating multiple sources of biological data represented as both discrete values, such as gene annotations, and continuous values, such as gene expression measures. GenMiner implements the new NorDi (normal discretization) algorithm for normalizing and discretizing continuous values and takes advantage of the Close algorithm to efficiently generate minimal non-redundant association rules. Experiments show that execution time and memory usage of GenMiner are significantly smaller than those of the standard Apriori-based approach, as well as the number of extracted association rules. AVAILABILITY: The GenMiner software and supplementary materials are available at http://bioinfo.unice.fr/publications/genminer_article/ and http://keia.i3s.unice.fr/?Implementations:GenMiner SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

GENMINER is a smart adaptation of closed itemsets based association rules extraction to genomic data. It takes advantage of the novel NORDI discretization method and of the CLOSE [27] algorithm to efficiently generate min- imal non-redundant association rules. GENMINER facili- tates the integration of numerous sources of biological in- formation such as gene expressions and annotations, and can tacitly integrate qualitative information on biological conditions (age, sex, etc.). We validated this approach ana- lyzing the microarray datasets used by Eisen et al. [10] with several sources of biological annotations. Extracted asso- ciations revealed significant co-annotated and co-expressed gene patterns, showing important biological relationships between genes and their features. Several of these relation- ships are supported by recent biological literature.

We address the problem of the usefulness and the relevance of the set of discovered association rules. Using the frequent closed itemset groundwork, we propose to generate bases for association rules, that are non-redundant generating sets for all association rules.