Stéphane Lallich

70 papers A* 2B 7C 4Misc 2Journal 22Unranked 27

Year	Rank	Type	Title / Venue / Authors
2022	J	`jnl`	What to expect from a set of itemsets? Inf. Sci. Thomas Delacroix, Philippe Lenca, Stéphane Lallich
2018	Misc	`conf`	A Visual Quality Index for Fuzzy C-Means. AIAI Aybüke Öztürk, Stéphane Lallich, Jérôme Darmont
2018	J	`jnl`	A Visual Quality Index for Fuzzy C-Means. CoRR Aybüke Öztürk, Stéphane Lallich, Jérôme Darmont
2018	—	`conf`	MaxMin Linear Initialization for Fuzzy C-Means. MLDM (1) Aybüke Öztürk, Stéphane Lallich, Jérôme Darmont, Sylvie Yona Waksman
2018	J	`jnl`	MaxMin Linear Initialization for Fuzzy C-Means. CoRR Aybüke Öztürk, Stéphane Lallich, Jérôme Darmont, Sylvie Yona Waksman
2016	J	`jnl`	ClusPath: a temporal-driven clustering to infer typical evolution paths. Data Min. Knowl. Discov. Marian-Andrei Rizoiu, Julien Velcin, Stéphane Bonnevay, Stéphane Lallich
2016	J	`jnl`	How to Use Temporal-Driven Constrained Clustering to Detect Typical Evolutions. CoRR Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2016	J	`jnl`	Warehousing Complex Archaeological Objects. CoRR Aybüke Öztürk, Louis Eyango, Sylvie Yona Waksman, Stéphane Lallich, Jérôme Darmont
2015	J	`jnl`	Classifying many-class high-dimensional fingerprint datasets using random forest of oblique decision trees. Vietnam. J. Comput. Sci. Thanh-Nghi Do, Philippe Lenca, Stéphane Lallich
2015	J	`jnl`	ClusPath: A Temporal-driven Clustering to Infer Typical Evolution Paths. CoRR Marian-Andrei Rizoiu, Julien Velcin, Stéphane Bonnevay, Stéphane Lallich
2015	J	`jnl`	Comparison of two topological approaches for dealing with noisy labeling. Neurocomputing Fabien Rico, Fabrice Muhlenbach, Djamel A. Zighed, Stéphane Lallich
2015	B	`conf`	Constrained independence for detecting interesting patterns. DSAA Thomas Delacroix, Ahcene Boubekki, Philippe Lenca, Stéphane Lallich
2015	J	`jnl`	Guest editor's introduction: special issue on quality issues, measures of interestingness and evaluation of data mining models. J. Intell. Inf. Syst. Philippe Lenca, Stéphane Lallich
2015	J	`jnl`	Semantic-enriched Visual Vocabulary Construction in a Weakly Supervised Context. CoRR Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2015	J	`jnl`	Semantic-enriched visual vocabulary construction in a weakly supervised context. Intell. Data Anal. Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2015	J	`jnl`	Unsupervised Feature Construction for Improving Data Representation and Semantics. CoRR Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2015	—	`conf`	Warehousing Complex Archaeological Objects. CONTEXT Aybüke Öztürk, Louis Eyango, Sylvie Yona Waksman, Stéphane Lallich, Jérôme Darmont
2014	J	`jnl`	How to Use Temporal-Driven Constrained Clustering to Detect Typical Evolutions. Int. J. Artif. Intell. Tools Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2013	J	`jnl`	Unsupervised feature construction for improving data representation and semantics. J. Intell. Inf. Syst. Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2012	—	`ch.`	Mesure formelle de la robustesse des règles d'association. Mesurer et évaluer la Qualité des Données et des Connaissances Yannick Le Bras, Patrick Meyer, Philippe Lenca, Stéphane Lallich
2012	J	`jnl`	Optimonotone Measures for Optimal Rule Discovery. Comput. Intell. Yannick Le Bras, Philippe Lenca, Stéphane Lallich
2012	B	`conf`	Structuring Typical Evolutions Using Temporal-Driven Constrained Clustering. ICTAI Marian-Andrei Rizoiu, Julien Velcin, Stéphane Lallich
2012	J	`jnl`	The use of regional platforms for managing electronic health records for the production of regional public health indicators in France. BMC Medical Informatics Decis. Mak. Marie Hélène Metzger, Thierry Durand, Stéphane Lallich, Roger Salamon, Philippe Castets
2011	B	`conf`	Mining Classification Rules without Support: an Anti-monotone Property of Jaccard Measure. Discovery Science Yannick Le Bras, Philippe Lenca, Stéphane Lallich
2010	—	`conf`	A Robustness Measure of Association Rules. ECML/PKDD (2) Yannick Le Bras, Patrick Meyer, Philippe Lenca, Stéphane Lallich
2010	—	`conf`	Classification associative basée sur le Boosting. EGC Emna Bahri, Stéphane Lallich
2010	—	`conf`	Discovering Research Communities by Clustering Bibliographical Data. Web Intelligence Fabrice Muhlenbach, Stéphane Lallich
2010	—	`ch.`	Mining Interesting Rules Without Support Requirement: A General Universal Existential Upward Closure Property. Data Mining Yannick Le Bras, Philippe Lenca, Stéphane Lallich
2009	—	`ch.`	A Hybrid Approach of Boosting Against Noisy Data. Mining Complex Data Emna Bahri, Stéphane Lallich, Nicolas Nicoloyannis, Mondher Maddouri
2009	A*	`conf`	A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters. ICDM Fabrice Muhlenbach, Stéphane Lallich
2009	C	`conf`	All-Monotony: A Generalization of the All-Confidence Antimonotony. ICMLA Yannick Le Bras, Philippe Lenca, Sorin Moga, Stéphane Lallich
2009	—	`conf`	Classifying Very-High-Dimensional Data with Random Forests of Oblique Decision Trees. EGC (best of volume) Thanh-Nghi Do, Philippe Lenca, Stéphane Lallich, Nguyen-Khang Pham
2009	—	`conf`	FCP-Growth, une adaptation de FP-Growth pour générer des règles d'association de classe. EGC Emna Bahri, Stéphane Lallich
2009	Misc	`conf`	FCP-Growth: Class Itemsets for Class Association Rules. FLAIRS Emna Bahri, Stéphane Lallich
2009	C	`conf`	Improving Prediction by Weighting Class Association Rules. ICMLA Emna Bahri, Stéphane Lallich
2009	B	`conf`	On Optimal Rule Mining: A Framework and a Necessary and Sufficient Condition of Antimonotonicity. PAKDD Yannick Le Bras, Philippe Lenca, Stéphane Lallich
2009	—	`conf`	Pruning for Extracting Class Association Rules Without Candidate Generation. DMIN Emna Bahri, Stéphane Lallich
2009	—	`conf`	Un nouvel algorithme de forêts aléatoires d'arbres obliques particulièrement adapté à la classification de données en grandes dimensions. EGC Thanh-Nghi Do, Stéphane Lallich, Nguyen-Khang Pham, Philippe Lenca
2008	B	`conf`	A Comparison of Different Off-Centered Entropies to Deal with Class Imbalance for Decision Trees. PAKDD Philippe Lenca, Stéphane Lallich, Thanh-Nghi Do, Nguyen-Khang Pham
2008	C	`conf`	Maps Ensemble for Semi-Supervised Learning of Large High Dimensional Datasets. ISMIS Elie Prudhomme, Stéphane Lallich
2008	J	`jnl`	On selecting interestingness measures for association rules: User oriented description and multiple criteria decision aid. Eur. J. Oper. Res. Philippe Lenca, Patrick Meyer, Benoît Vaillant, Stéphane Lallich
2008	—	`ch.`	On the behavior of the generalizations of the intensity of implication: A data-driven comparative study. Statistical Implicative Analysis Benoît Vaillant, Stéphane Lallich, Philippe Lenca
2008	—	`conf`	Optimization of Self-Organizing Maps Ensemble in Prediction. DMIN Elie Prudhomme, Stéphane Lallich
2008	—	`conf`	Représentation des données par un comité de cartes auto-organisatrices : une application aux données bruitées. AAFD Elie Prudhomme, Stéphane Lallich
2008	—	`conf`	Une approche ensembliste inspirée du boosting en classification non supervisée. EGC Romain Billot, Henri-Maxime Suchier, Stéphane Lallich
2008	—	`conf`	Using Local Node Information in Decision Trees: Coupling a Local Labeling Rule with an Off-centered Entropy. DMIN Nguyen-Khang Pham, Thanh-Nghi Do, Philippe Lenca, Stéphane Lallich
2007	—	`conf`	A Study of the Robustness of Association Rules. DMIN Jérôme Azé, Philippe Lenca, Stéphane Lallich, Benoît Vaillant
2007	—	`ch.`	Association Rule Interestingness Measures: Experimental and Theoretical Studies. Quality Measures in Data Mining Philippe Lenca, Benoît Vaillant, Patrick Meyer, Stéphane Lallich
2007	—	`ch.`	Association Rule Interestingness: Measure and Statistical Validation. Quality Measures in Data Mining Stéphane Lallich, Olivier Teytaud, Elie Prudhomme
2007	—	`conf`	Ensemble prédicteur fondé sur les cartes auto-organisatrices adapté aux données volumineuses. EGC Elie Prudhomme, Stéphane Lallich
2006	—	`conf`	Modeling of the counter-examples and association rules interestingness measures behavior. DMIN Benoît Vaillant, Stéphane Lallich, Philippe Lenca
2005	—	`conf`	Mesurer l'intérêt des règles d'association. EGC (Ateliers) Benoît Vaillant, Patrick Meyer, Elie Prudhomme, Stéphane Lallich, Philippe Lenca, Sébastien Bigaret
2005	—	`conf`	Validation statistique des cartes de Kohonen en apprentissage supervisé. EGC Elie Prudhomme, Stéphane Lallich
2004	B	`conf`	A Clustering of Interestingness Measures. Discovery Science Benoît Vaillant, Philippe Lenca, Stéphane Lallich
2004	—	`conf`	Contrôle du risque multiple pour la sélection de règles d'association significatives. EGC Stéphane Lallich, Elie Prudhomme, Olivier Teytaud
2004	—	`conf`	Etude expérimentale de mesures de qualité de règles d'associations. EGC Benoît Vaillant, Philippe Lenca, Stéphane Lallich
2004	—	`conf`	Fouille dans la structure de documents XML. EGC Amandine Duffoux, Omar Boussaid, Stéphane Lallich, Fadila Bentayeb
2004	J	`jnl`	Identifying and Handling Mislabelled Instances. J. Intell. Inf. Syst. Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
2004	B	`conf`	Outlier Handling in the Neighbourhood-Based Learning of a Continuous Class. Discovery Science Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
2003	J	`jnl`	A test to control a region growing process within a hierarchical graph. Pattern Recognit. Stéphane Lallich, Fabrice Muhlenbach, Jean-Michel Jolion
2003	—	`conf`	Traitement des exemples atypiques en apprentissage par la régression. EGC Stéphane Lallich, Fabrice Muhlenbach, Djamel A. Zighed
2002	—	`conf`	Amélioration d'une classification par filtrage des exemples mal étiquetés. EGC Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
2002	J	`jnl`	Construction d'arbres de décision par optimisation. Rev. d'Intelligence Artif. Ricco Rakotomalala, Stéphane Lallich
2002	C	`conf`	Improving Classification by Removing or Relabeling Mislabeled Instances. ISMIS Stéphane Lallich, Fabrice Muhlenbach, Djamel A. Zighed
2002	—	`conf`	Separability Index in Supervised Learning. PKDD Djamel A. Zighed, Stéphane Lallich, Fabrice Muhlenbach
2002	J	`jnl`	Stopping Criterion for Boosting-Based Data Reduction Techniques: from Binary to Multiclass Problem. J. Mach. Learn. Res. Marc Sebban, Richard Nock, Stéphane Lallich
2001	A*	`conf`	Boosting Neighborhood-Based Classifiers. ICML Marc Sebban, Richard Nock, Stéphane Lallich
2000	—	`conf`	Fast Feature Selection Using Partial Correlation for Multi-vaslued Attributes. PKDD Stéphane Lallich, Ricco Rakotomalala
1999	—	`conf`	Studying the Behavior of Generalized Entropy in Induction Trees Using a M-of-N Concept. PKDD Ricco Rakotomalala, Stéphane Lallich, S. Di Palma
1999	—	`conf`	ZigZag, a New Clustering Algorithm to Analyze Categorical Variable Cross-Classification Tables. PKDD Stéphane Lallich