References of "Wehenkel, Louis"      in Complete repository Arts & humanities   Archaeology   Art & art history   Classical & oriental studies   History   Languages & linguistics   Literature   Performing arts   Philosophy & ethics   Religion & theology   Multidisciplinary, general & others Business & economic sciences   Accounting & auditing   Production, distribution & supply chain management   Finance   General management & organizational theory   Human resources management   Management information systems   Marketing   Strategy & innovation   Quantitative methods in economics & management   General economics & history of economic thought   International economics   Macroeconomics & monetary economics   Microeconomics   Economic systems & public economics   Social economics   Special economic topics (health, labor, transportation…)   Multidisciplinary, general & others Engineering, computing & technology   Aerospace & aeronautics engineering   Architecture   Chemical engineering   Civil engineering   Computer science   Electrical & electronics engineering   Energy   Geological, petroleum & mining engineering   Materials science & engineering   Mechanical engineering   Multidisciplinary, general & others Human health sciences   Alternative medicine   Anesthesia & intensive care   Cardiovascular & respiratory systems   Dentistry & oral medicine   Dermatology   Endocrinology, metabolism & nutrition   Forensic medicine   Gastroenterology & hepatology   General & internal medicine   Geriatrics   Hematology   Immunology & infectious disease   Laboratory medicine & medical technology   Neurology   Oncology   Ophthalmology   Orthopedics, rehabilitation & sports medicine   Otolaryngology   Pediatrics   Pharmacy, pharmacology & toxicology   Psychiatry   Public health, health care sciences & services   Radiology, nuclear medicine & imaging   Reproductive medicine (gynecology, andrology, obstetrics)   Rheumatology   Surgery   Urology & nephrology   Multidisciplinary, general & others Law, criminology & political science   Civil law   Criminal law & procedure   Criminology   Economic & commercial law   European & international law   Judicial law   Metalaw, Roman law, history of law & comparative law   Political science, public administration & international relations   Public law   Social law   Tax law   Multidisciplinary, general & others Life sciences   Agriculture & agronomy   Anatomy (cytology, histology, embryology...) & physiology   Animal production & animal husbandry   Aquatic sciences & oceanology   Biochemistry, biophysics & molecular biology   Biotechnology   Entomology & pest control   Environmental sciences & ecology   Food science   Genetics & genetic processes   Microbiology   Phytobiology (plant sciences, forestry, mycology...)   Veterinary medicine & animal health   Zoology   Multidisciplinary, general & others Physical, chemical, mathematical & earth Sciences   Chemistry   Earth sciences & physical geography   Mathematics   Physics   Space science, astronomy & astrophysics   Multidisciplinary, general & others Social & behavioral sciences, psychology   Animal psychology, ethology & psychobiology   Anthropology   Communication & mass media   Education & instruction   Human geography & demography   Library & information sciences   Neurosciences & behavior   Regional & inter-regional studies   Social work & social policy   Sociology & social sciences   Social, industrial & organizational psychology   Theoretical & cognitive psychology   Treatment & clinical psychology   Multidisciplinary, general & others     Showing results 61 to 80 of 306     1 2 3 4 5 6 7 8 9     Comparator selection for RPC with many labelsHiard, Samuel ; Geurts, Pierre ; Wehenkel, Louis in ECAI 2012 : 20th European Conference on Artificial Intelligence : 27-31 August 2012, Montpellier, France (2012, August)The Ranking by Pairwise Comparison algorithm (RPC) is a well established label ranking method. However, its complexity is of O(N²) in the number N of labels. We present algorithms for selection, before ... [more ▼]The Ranking by Pairwise Comparison algorithm (RPC) is a well established label ranking method. However, its complexity is of O(N²) in the number N of labels. We present algorithms for selection, before model construction, a subset of comparators of size O(N), to reduce the computational complexity without loss in accuracy. [less ▲]Detailed reference viewed: 134 (23 ULiège) Wisdom of crowds for robust gene network inferenceMarbach, Daniel; Costello, James C.; Küffner, Robert et alin Nature Methods (2012), 9Reconstructing gene regulatory networks from high-throughput data is a long-standing challenge. Through the Dialogue on Reverse Engineering Assessment and Methods (DREAM) project, we performed a ... [more ▼]Reconstructing gene regulatory networks from high-throughput data is a long-standing challenge. Through the Dialogue on Reverse Engineering Assessment and Methods (DREAM) project, we performed a comprehensive blind assessment of over 30 network inference methods on Escherichia coli, Staphylococcus aureus, Saccharomyces cerevisiae and in silico microarray data. We characterize the performance, data requirements and inherent biases of different inference approaches, and we provide guidelines for algorithm application and development. We observed that no single inference method performs optimally across all data sets. In contrast, integration of predictions from multiple inference methods shows robust and high performance across diverse data sets. We thereby constructed high-confidence networks for E. coli and S. aureus, each comprising ~ 1,700 transcriptional interactions at a precision of ~50%. We experimentally tested 53 previously unobserved regulatory interactions in E. coli, of which 23 (43%) were supported. Our results establish community-based methods as a powerful and robust tool for the inference of transcriptional gene regulatory networks. [less ▲]Detailed reference viewed: 271 (41 ULiège) Decoding spontaneous brain activity from fMRI using Gaussian Processes: tracking brain reactivationSchrouff, Jessica ; Kussé, Caroline ; Wehenkel, Louis et alin 2012 Second International Workshop on Pattern Recognition in NeuroImaging (PRNI 2012): proceedings (2012, July 03)While Multi-Variate Pattern Analysis techniques based on machine learning have now been regularly applied to neuroimaging data, decoding brain activity is usually performed in highly controlled ... [more ▼]While Multi-Variate Pattern Analysis techniques based on machine learning have now been regularly applied to neuroimaging data, decoding brain activity is usually performed in highly controlled experimental paradigms. In more realistic conditions, the number, sequence and duration of mental states are unpredictably generated by the individual, resulting in complex and imbalanced fMRI data sets. Moreover, in the case of spontaneous brain activity, the mental states can not be linked to any external or internal stimulation, which makes it a highly difficult condition to decode. This study tests the classification of brain activity, acquired on 14 volunteers using fMRI, during mental imagery, a condition in which the number and duration of mental events were not externally imposed but self-generated. Application of the obtained model on rest sessions allowed classifying spontaneous brain activity linked to the task which, overall, correlated with their behavioural performance to the task. [less ▲]Detailed reference viewed: 49 (18 ULiège) Inferring gene regulatory networks from genetical genomics dataHuynh-Thu, Vân Anh ; Vandel, Jimmy; Irrthum, Alexandre et alConference (2012, June 01)Detailed reference viewed: 8 (1 ULiège) L1-based compression of random forest modelsJoly, Arnaud ; Schnitzler, François ; Geurts, Pierre et alin Proceeding of the 21st Belgian-Dutch Conference on Machine Learning (2012, May 24)Random forests are effective supervised learning methods applicable to large-scale datasets. However, the space complexity of tree ensembles, in terms of their total number of nodes, is often prohibitive ... [more ▼]Random forests are effective supervised learning methods applicable to large-scale datasets. However, the space complexity of tree ensembles, in terms of their total number of nodes, is often prohibitive, specially in the context of problems with very high-dimensional input spaces. We propose to study their compressibility by applying a L1-based regularization to the set of indicator functions defined by all their nodes. We show experimentally that preserving or even improving the model accuracy while significantly reducing its space complexity is indeed possible. [less ▲]Detailed reference viewed: 280 (57 ULiège) Approximation efficace de mélanges bootstrap d’arbres de Markov pour l’estimation de densitéSchnitzler, François ; Ammar, Sourour; Leray, Philippe et alin Bougrain, Laurent (Ed.) Actes de la 14e Conférence Francophone sur l'Apprentissage Automatique (CAp 2012) (2012, May 23)Nous considérons des algorithmes pour apprendre des Mélanges bootstrap d'Arbres de Markov pour l'estimation de densité. Pour les problèmes comportant un grand nombre de variables et peu d'observations ... [more ▼]Nous considérons des algorithmes pour apprendre des Mélanges bootstrap d'Arbres de Markov pour l'estimation de densité. Pour les problèmes comportant un grand nombre de variables et peu d'observations, ces mélanges estiment généralement mieux la densité qu'un seul arbre appris au maximum de vraisemblance, mais sont plus coûteux à apprendre. C'est pourquoi nous étudions ici un algorithme pour apprendre ces modèles de manière approchée, afin d'accélérer l'apprentissage sans sacrifier la précision. Plus spécifiquement, nous récupérons lors du calcul d'un premier arbre de Markov les arcs qui constituent de bons candidats pour la structure, et ne considérons que ceux-ci lors de l'apprentissage des arbres suivants. Nous comparons cet algorithme à l'algorithme original de mélange, à un arbre appris au maximum de vraisemblance, à un arbre régularisé et à une autre méthode approchée. [less ▲]Detailed reference viewed: 42 (4 ULiège) Statistical interpretation of machine learning-based feature importance scores for biomarker discoveryHuynh-Thu, Vân Anh ; Saeys, Yvan; Wehenkel, Louis et alin Bioinformatics (2012), 28(13), 1766-1774Motivation: Univariate statistical tests are widely used for biomarker discovery in bioinformatics. These procedures are simple, fast and their output is easily interpretable by biologists but they can ... [more ▼]Motivation: Univariate statistical tests are widely used for biomarker discovery in bioinformatics. These procedures are simple, fast and their output is easily interpretable by biologists but they can only identify variables that provide a significant amount of information in isolation from the other variables. As biological processes are expected to involve complex interactions between variables, univariate methods thus potentially miss some informative biomarkers. Variable relevance scores provided by machine learning techniques, however, are potentially able to highlight multivariate interacting effects, but unlike the p-values returned by univariate tests, these relevance scores are usually not statistically interpretable. This lack of interpretability hampers the determination of a relevance threshold for extracting a feature subset from the rankings and also prevents the wide adoption of these methods by practicians. Results: We evaluated several, existing and novel, procedures that extract relevant features from rankings derived from machine learning approaches. These procedures replace the relevance scores with measures that can be interpreted in a statistical way, such as p-values, false discovery rates, or family wise error rates, for which it is easier to determine a significance level. Experiments were performed on several artificial problems as well as on real microarray datasets. Although the methods differ in terms of computing times and the tradeoff, they achieve in terms of false positives and false negatives, some of them greatly help in the extraction of truly relevant biomarkers and should thus be of great practical interest for biologists and physicians. As a side conclusion, our experiments also clearly highlight that using model performance as a criterion for feature selection is often counter-productive. [less ▲]Detailed reference viewed: 284 (56 ULiège) Supervised learning to tune simulated annealing for in silico protein structure predictionMarcos Alvarez, Alejandro ; Maes, Francis ; Wehenkel, Louis in Verleysen, Michel (Ed.) ESANN 2012 proceedings, 20th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (2012, April 25)Simulated annealing is a widely used stochastic optimization algorithm whose efficiency essentially depends on the proposal distribu- tion used to generate the next search state at each step. We propose ... [more ▼]Simulated annealing is a widely used stochastic optimization algorithm whose efficiency essentially depends on the proposal distribu- tion used to generate the next search state at each step. We propose to adapt this distribution to a family of parametric optimization problems by using supervised machine learning on a sample of search states derived from a set of typical runs of the algorithm over this family. We apply this idea in the context of in silico protein structure prediction. [less ▲]Detailed reference viewed: 155 (35 ULiège) L1-based compression of random forest modelsJoly, Arnaud ; Schnitzler, François ; Geurts, Pierre et alin 20th European Symposium on Artificial Neural Networks (2012, April)Random forests are effective supervised learning methods applicable to large-scale datasets. However, the space complexity of tree ensembles, in terms of their total number of nodes, is often prohibitive ... [more ▼]Random forests are effective supervised learning methods applicable to large-scale datasets. However, the space complexity of tree ensembles, in terms of their total number of nodes, is often prohibitive, specially in the context of problems with very high-dimensional input spaces. We propose to study their compressibility by applying a L1-based regularization to the set of indicator functions defined by all their nodes. We show experimentally that preserving or even improving the model accuracy while significantly reducing its space complexity is indeed possible. [less ▲]Detailed reference viewed: 466 (80 ULiège) Learning to play K-armed bandit problemsMaes, Francis ; Wehenkel, Louis ; Ernst, Damien in Proceedings of the 4th International Conference on Agents and Artificial Intelligence (ICAART 2012) (2012, February)We propose a learning approach to pre-compute K-armed bandit playing policies by exploiting prior information describing the class of problems targeted by the player. Our algorithm ﬁrst samples a set of K ... [more ▼]We propose a learning approach to pre-compute K-armed bandit playing policies by exploiting prior information describing the class of problems targeted by the player. Our algorithm ﬁrst samples a set of K-armed bandit problems from the given prior, and then chooses in a space of candidate policies one that gives the best average performances over these problems. The candidate policies use an index for ranking the arms and pick at each play the arm with the highest index; the index for each arm is computed in the form of a linear combination of features describing the history of plays (e.g., number of draws, average reward, variance of rewards and higher order moments), and an estimation of distribution algorithm is used to determine its optimal parameters in the form of feature weights. We carry out simulations in the case where the prior assumes a ﬁxed number of Bernoulli arms, a ﬁxed horizon, and uniformly distributed parameters of the Bernoulli arms. These simulations show that learned strategies perform very well with respect to several other strategies previously proposed in the literature (UCB1, UCB2, UCB-V, KL-UCB and $\epsilon_n$-GREEDY); they also highlight the robustness of these strategies with respect to wrong prior information. [less ▲]Detailed reference viewed: 183 (19 ULiège) Decoding Semi-Constrained Brain Activity from fMRI Using Support Vector Machines and Gaussian ProcessesSchrouff, Jessica ; Kussé, Caroline ; Wehenkel, Louis et alin PLoS ONE (2012), 7(4), Predicting a particular cognitive state from a specific pattern of fMRI voxel values is still a methodological challenge. Decoding brain activity is usually performed in highly controlled experimental ... [more ▼]Predicting a particular cognitive state from a specific pattern of fMRI voxel values is still a methodological challenge. Decoding brain activity is usually performed in highly controlled experimental paradigms characterized by a series of distinct states induced by a temporally constrained experimental design. In more realistic conditions, the number, sequence and duration of mental states are unpredictably generated by the individual, resulting in complex and imbalanced fMRI data sets. This study tests the classification of brain activity, acquired on 16 volunteers using fMRI, during mental imagery, a condition in which the number and duration of mental events were not externally imposed but self-generated. To deal with these issues, two classification techniques were considered (Support Vector Machines, SVM, and Gaussian Processes, GP), as well as different feature extraction methods (General Linear Model, GLM and SVM). These techniques were combined in order to identify the procedures leading to the highest accuracy measures. Our results showed that 12 data sets out of 16 could be significantly modeled by either SVM or GP. Model accuracies tended to be related to the degree of imbalance between classes and to task performance of the volunteers. We also conclude that the GP technique tends to be more robust than SVM to model unbalanced data sets. [less ▲]Detailed reference viewed: 94 (25 ULiège) An Efficient Algorithm to Perform Multiple Testing in Epistasis ScreeningVan Lishout, François ; Cattaert, Tom ; Mahachie John, Jestinah et alConference (2011, December 13)Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown exponentially over the last few years. It has been marked by promising methodological developments ... [more ▼]Background: Research in epistasis or gene-gene interaction detection for human complex traits has grown exponentially over the last few years. It has been marked by promising methodological developments, improved translation efforts of statistical epistasis to biological epistasis and attempts to integrate different omics information sources into the epistasis screening to enhance power. The quest for gene-gene interactions poses severe multiple-testing problems. In this context, the maxT algorithm is one technique to control the false-positive rate. However, the memory needed by this algorithm rises linearly with the amount of hypothesis tests. In main-effects detection, this is not a problem since the memory required is thus proportional to the number of SNPs. In contrast, gene-gene interaction studies will require a memory proportional to the squared amount of SNPs. A genome wide epistasis would therefore require terabytes of memory. Hence, cache problems are likely to occur, increasing the computation time. Methods: In this work we present a new version of maxT, requiring an amount of memory independent from the number of genetic effects to be investigated. This algorithm was implemented in C++ in our epistasis screening software MB-MDR-2.6.2 and compared to MB-MDR's first implementation as an R-package (Calle et al., Bioinformatics 2010). We evaluate the new implementation in terms of memory efficiency and speed using simulated data. The software is illustrated on real-life data for Crohn's disease. Results: The sequential version of MBMDR-2.6.2 is approximately 5,500 times faster than its R counterparts. The parallel version (tested on a cluster composed of 14 blades, containing each 4 quad-cores Intel Xeon CPU E5520@2.27 GHz) is approximately 900,000 times faster than the latter, for results of the same quality on the simulated data. It analyses all gene-gene interactions of a dataset of 100,000 SNPs typed on 1000 individuals within 4 days. Our program found 14 SNP-SNP interactions with a p-value less than 0.05 on the real-life Crohn’s disease data. Conclusions: Our software is able to solve large-scale SNP-SNP interactions problems within a few days, without using much memory. A new implementation to reach genome wide epistasis screening is under construction. In the context of Crohn's disease, MBMDR-2.6.2 found signal in regions well known in the field and our results could be explained from a biological point of view. This demonstrates the power of our software to find relevant phenotype-genotype associations. [less ▲]Detailed reference viewed: 73 (26 ULiège) Phenotype Classification of Zebrafish Embryos by Supervised LearningJeanray, Nathalie ; Marée, Raphaël ; Pruvot, Benoist et alPoster (2011, December 08)Detailed reference viewed: 62 (22 ULiège) Pruning randomized trees with L1-norm regularizationJoly, Arnaud ; Schnitzler, François ; Geurts, Pierre et alPoster (2011, November 29)Growing amount of high dimensional data requires robust analysis techniques. Tree-based ensemble methods provide such accurate supervised learning models. However, the model complexity can become utterly ... [more ▼]Growing amount of high dimensional data requires robust analysis techniques. Tree-based ensemble methods provide such accurate supervised learning models. However, the model complexity can become utterly huge depending on the dimension of the dataset. Here we propose a method to compress such ensemble using random tree induced space and L1-norm regularisation. This leads to a drastic pruning, preserving or improving the model accuracy. Moreover, our approach increases robustness with respect to the selection of complexity parameters. [less ▲]Detailed reference viewed: 93 (27 ULiège) Decoding semi-constrained brain activity from fMRI using SVM and GPSchrouff, Jessica ; Kussé, Caroline ; Wehenkel, Louis et alScientific conference (2011, November 22)Predicting a particular cognitive state from a specific pattern of fMRI voxel values is still a methodological challenge. Decoding brain activity is usually performed in highly controlled experimental ... [more ▼]Predicting a particular cognitive state from a specific pattern of fMRI voxel values is still a methodological challenge. Decoding brain activity is usually performed in highly controlled experimental paradigms characterized by a series of distinct states induced by a temporally constrained experimental design. In more realistic conditions, the number, sequence and duration of mental states are unpredictably generated by the individual, resulting in complex and imbalanced fMRI data sets. This study tests the classification of brain activity, acquired on 16 volunteers using fMRI, during mental imagery, a condition in which the number and duration of mental events were not externally imposed but self-generated. To deal with these issues, two classification techniques were considered (Support Vector Machines, SVM, and Gaussian Processes, GP), as well as different feature extraction methods (General Linear Model, GLM and SVM). These techniques were combined in order to identify the procedures leading to the highest accuracy measures. Our results showed that 12 data sets out of 16 could be significantly modeled by either SVM or GP. Model accuracies tended to be related to the degree of imbalance between classes and to task performance of the volunteers. We also conclude that the GP technique tends to be more robust than SVM to model unbalanced data sets. [less ▲]Detailed reference viewed: 82 (7 ULiège) A web-based framework for visualization, annotation, and automatic exploitation of high-resolution bioimages using tree-based machine learning methodsStevens, Benjamin ; Rollus, Loïc ; Wehenkel, Louis et alPoster (2011, November 02)Detailed reference viewed: 154 (20 ULiège) Phenotype Classification of Zebrafish Embryos by Supervised LearningJeanray, Nathalie ; Marée, Raphaël ; Pruvot, Benoist et alConference (2011, September 02)Detailed reference viewed: 46 (13 ULiège) Distributed MPC of wide-area electromechanical oscillations of large-scale power systemsWang, Da ; Glavic, Mevludin; Wehenkel, Louis in Proceedings of ISAP 2011 (2011, September)We investigate distributed Model Predictive Control (MPC) to damp wide-area electromechanical oscillations. Our distributed MPC schemes are derived from and compared with a fully centralized MPC scheme ... [more ▼]We investigate distributed Model Predictive Control (MPC) to damp wide-area electromechanical oscillations. Our distributed MPC schemes are derived from and compared with a fully centralized MPC scheme proposed in a previous publication. Based on simulations carried out using a 16-generator, 70-bus, two-area test power system, we show that simple coordination schemes based on additional local measurements’ feedback yield already a significant improvement with respect to a scheme with only implicit coordination, improve significantly with respect to purely local controls, and in this respect reach about 75% of the improvements obtained by an ideal centralized MPC scheme. [less ▲]Detailed reference viewed: 36 (7 ULiège) Efficiently approximating Markov tree bagging for high-dimensional density estimationSchnitzler, François ; ammar, sourour; leray, philippe et alin Gunopulos, Dimitrios; Hofmann, Thomas; Malerba, Donato (Eds.) et al Machine Learning and Knowledge Discovery in Databases, Part III (2011, September)We consider algorithms for generating Mixtures of Bagged Markov Trees, for density estimation. In problems deﬁned over many variables and when few observations are available, those mixtures generally ... [more ▼]We consider algorithms for generating Mixtures of Bagged Markov Trees, for density estimation. In problems deﬁned over many variables and when few observations are available, those mixtures generally outperform a single Markov tree maximizing the data likelihood, but are far more expensive to compute. In this paper, we describe new algorithms for approximating such models, with the aim of speeding up learning without sacriﬁcing accuracy. More speciﬁcally, we propose to use a ﬁltering step obtained as a by-product from computing a ﬁrst Markov tree, so as to avoid considering poor candidate edges in the subsequently generated trees. We compare these algorithms (on synthetic data sets) to Mixtures of Bagged Markov Trees, as well as to a single Markov tree derived by the classical Chow-Liu algorithm and to a recently proposed randomized scheme used for building tree mixtures. [less ▲]Detailed reference viewed: 86 (23 ULiège) Day-ahead Security Assessment under Uncertainty Relying on the Combination of Preventive and Corrective Controls to Face Worst-Case ScenariosCapitanescu, Florin ; Fliscounakis, Stéphane; Panciatici, Patrick et alin PSCC proceedings Stockholm (Sweden) 2011 (2011, August 22)This paper deals with day-ahead static security assessment with respect to a postulated set of contingencies while taking into account uncertainties about the next day system conditions. We propose a ... [more ▼]This paper deals with day-ahead static security assessment with respect to a postulated set of contingencies while taking into account uncertainties about the next day system conditions. We propose a heuristic approach to check whether, given some assumptions regarding these uncertainties, the worst case with respect to each contingency is still controllable by appropriate combinations of preventive and corrective actions. This approach relies on the solution of successive optimal power flow (OPF) and security-constrained optimal power flow (SCOPF) problems of a special type. The interest of the approach is shown by illustrative examples on the Nordic32 system. [less ▲]Detailed reference viewed: 204 (8 ULiège)