The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stéphane Lallich: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
    Outlier Handling in the Neighbourhood-Based Learning of a Continuous Class. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:314-321 [Conf]
  2. Benoît Vaillant, Philippe Lenca, Stéphane Lallich
    A Clustering of Interestingness Measures. [Citation Graph (0, 0)][DBLP]
    Discovery Science, 2004, pp:290-297 [Conf]
  3. Benoît Vaillant, Stéphane Lallich, Philippe Lenca
    Modeling of the counter-examples and association rules interestingness measures behavior. [Citation Graph (0, 0)][DBLP]
    DMIN, 2006, pp:132-137 [Conf]
  4. Amandine Duffoux, Omar Boussaid, Stéphane Lallich, Fadila Bentayeb
    Fouille dans la structure de documents XML. [Citation Graph (0, 0)][DBLP]
    EGC, 2004, pp:519-524 [Conf]
  5. Stéphane Lallich, Fabrice Muhlenbach, Djamel A. Zighed
    Traitement des exemples atypiques en apprentissage par la régression. [Citation Graph (0, 0)][DBLP]
    EGC, 2003, pp:399-410 [Conf]
  6. Stéphane Lallich, Elie Prudhomme, Olivier Teytaud
    Contrôle du risque multiple pour la sélection de règles d'association significatives. [Citation Graph (0, 0)][DBLP]
    EGC, 2004, pp:305-316 [Conf]
  7. Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
    Amélioration d'une classification par filtrage des exemples mal étiquetés. [Citation Graph (0, 0)][DBLP]
    EGC, 2002, pp:155-166 [Conf]
  8. Benoît Vaillant, Philippe Lenca, Stéphane Lallich
    Etude expérimentale de mesures de qualité de règles d'associations. [Citation Graph (0, 0)][DBLP]
    EGC, 2004, pp:341-352 [Conf]
  9. Elie Prudhomme, Stéphane Lallich
    Validation statistique des cartes de Kohonen en apprentissage supervisé. [Citation Graph (0, 0)][DBLP]
    EGC, 2005, pp:79-90 [Conf]
  10. Elie Prudhomme, Stéphane Lallich
    Ensemble prédicteur fondé sur les cartes auto-organisatrices adapté aux données volumineuses. [Citation Graph (0, 0)][DBLP]
    EGC, 2007, pp:473-484 [Conf]
  11. Marc Sebban, Richard Nock, Stéphane Lallich
    Boosting Neighborhood-Based Classifiers. [Citation Graph (0, 0)][DBLP]
    ICML, 2001, pp:505-512 [Conf]
  12. Stéphane Lallich, Fabrice Muhlenbach, Djamel A. Zighed
    Improving Classification by Removing or Relabeling Mislabeled Instances. [Citation Graph (0, 0)][DBLP]
    ISMIS, 2002, pp:5-15 [Conf]
  13. Stéphane Lallich
    ZigZag, a New Clustering Algorithm to Analyze Categorical Variable Cross-Classification Tables. [Citation Graph (0, 0)][DBLP]
    PKDD, 1999, pp:398-405 [Conf]
  14. Stéphane Lallich, Ricco Rakotomalala
    Fast Feature Selection Using Partial Correlation for Multi-vaslued Attributes. [Citation Graph (0, 0)][DBLP]
    PKDD, 2000, pp:221-231 [Conf]
  15. Ricco Rakotomalala, Stéphane Lallich, S. Di Palma
    Studying the Behavior of Generalized Entropy in Induction Trees Using a M-of-N Concept. [Citation Graph (0, 0)][DBLP]
    PKDD, 1999, pp:510-517 [Conf]
  16. Djamel A. Zighed, Stéphane Lallich, Fabrice Muhlenbach
    Separability Index in Supervised Learning. [Citation Graph (0, 0)][DBLP]
    PKDD, 2002, pp:475-487 [Conf]
  17. Fabrice Muhlenbach, Stéphane Lallich, Djamel A. Zighed
    Identifying and Handling Mislabelled Instances. [Citation Graph (0, 0)][DBLP]
    J. Intell. Inf. Syst., 2004, v:22, n:1, pp:89-109 [Journal]
  18. Marc Sebban, Richard Nock, Stéphane Lallich
    Stopping Criterion for Boosting-Based Data Reduction Techniques: from Binary to Multiclass Problem. [Citation Graph (0, 0)][DBLP]
    Journal of Machine Learning Research, 2002, v:3, n:, pp:863-885 [Journal]
  19. Stéphane Lallich, Fabrice Muhlenbach, Jean-Michel Jolion
    A test to control a region growing process within a hierarchical graph. [Citation Graph (0, 0)][DBLP]
    Pattern Recognition, 2003, v:36, n:10, pp:2201-2211 [Journal]

  20. A Study of the Robustness of Association Rules. [Citation Graph (, )][DBLP]


  21. Optimization of Self-Organizing Maps Ensemble in Prediction. [Citation Graph (, )][DBLP]


  22. Using Local Node Information in Decision Trees: Coupling a Local Labeling Rule with an Off-centered Entropy. [Citation Graph (, )][DBLP]


  23. Pruning for Extracting Class Association Rules Without Candidate Generation. [Citation Graph (, )][DBLP]


  24. Classifying Very-High-Dimensional Data with Random Forests of Oblique Decision Trees. [Citation Graph (, )][DBLP]


  25. Une approche ensembliste inspirée du boosting en classification non supervisée. [Citation Graph (, )][DBLP]


  26. FCP-Growth, une adaptation de FP-Growth pour générer des règles d'association de classe. [Citation Graph (, )][DBLP]


  27. Un nouvel algorithme de forêts aléatoires d'arbres obliques particulièrement adapté à la classification de données en grandes dimensions. [Citation Graph (, )][DBLP]


  28. Classification associative basée sur le Boosting. [Citation Graph (, )][DBLP]


  29. FCP-Growth: Class Itemsets for Class Association Rules. [Citation Graph (, )][DBLP]


  30. A New Clustering Algorithm Based on Regions of Influence with Self-Detection of the Best Number of Clusters. [Citation Graph (, )][DBLP]


  31. Improving Prediction by Weighting Class Association Rules. [Citation Graph (, )][DBLP]


  32. All-Monotony: A Generalization of the All-Confidence Antimonotony. [Citation Graph (, )][DBLP]


  33. Maps Ensemble for Semi-Supervised Learning of Large High Dimensional Datasets. [Citation Graph (, )][DBLP]


  34. A Comparison of Different Off-Centered Entropies to Deal with Class Imbalance for Decision Trees. [Citation Graph (, )][DBLP]


  35. On Optimal Rule Mining: A Framework and a Necessary and Sufficient Condition of Antimonotonicity. [Citation Graph (, )][DBLP]


  36. A Robustness Measure of Association Rules. [Citation Graph (, )][DBLP]


Search in 0.011secs, Finished in 0.012secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002