Indicator-Based Evolutionary Level Set Approximation: Mixed Mutation Strategy and Extended Analysis. | 0 | 0.34 | 2017 |
Multi-Objective Inventory Routing With Uncertain Demand Using Population-Based Metaheuristics | 6 | 0.40 | 2016 |
Detecting Dispersed Duplications in High-Throughput Sequencing Data using a Database-Free Approach. | 1 | 0.37 | 2016 |
Multicriteria Inventory Routing by Cooperative Swarms and Evolutionary Algorithms | 1 | 0.35 | 2015 |
Track Introduction: Scientific Workflows. | 0 | 0.34 | 2014 |
Meta-analysis of Disjoint Sets of Attributes in Large Cohort Studies. | 0 | 0.34 | 2014 |
Template-based treemaps to preserve spatial constraints | 1 | 0.36 | 2014 |
ApiNATOMY: Towards Multiscale Views of Human Anatomy. | 1 | 0.39 | 2014 |
Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows. | 5 | 0.43 | 2013 |
Integrating Protein-Protein Interaction Networks With Gene-Gene Co-Expression Networks Improves Gene Signatures For Classifying Breast Cancer Metastasis | 7 | 0.62 | 2011 |
Combining subgroup discovery and permutation testing to reduce reduncancy | 0 | 0.34 | 2010 |
InfraWatch: data management of large systems for monitoring infrastructural performance | 8 | 0.67 | 2010 |
Proceedings of the ACM SIGKDD Workshop on Statistical and Relational Learning in Bioinformatics, Paris, France, June 28, 2009 | 9 | 1.38 | 2009 |
A Scenario Implementation in Rfor SubtypeDiscoveryExamplified on Chemoinformatics Data | 0 | 0.34 | 2008 |
Gaining Insights into Laser Pulse Shaping by Evolution Strategies | 2 | 0.41 | 2007 |
Clustering Improves the Exploration of Graph Mining Results | 2 | 0.41 | 2007 |
Knowledge Discovery in Databases: PKDD 2007, 11th European Conference on Principles and Practice of Knowledge Discovery in Databases, Warsaw, Poland, September 17-21, 2007, Proceedings | 63 | 7.08 | 2007 |
DNA computing of solutions to knapsack problems | 12 | 0.84 | 2007 |
Clustering with Lattices in the Analysis of Graph Patterns | 0 | 0.34 | 2007 |
Does SVM really scale up to large bag of words feature spaces? | 6 | 0.62 | 2007 |
Graphs, Hypergraphs, and Inductive Logic Programming | 2 | 0.38 | 2007 |
Clustering Co-occurrence of Maximal Frequent Patterns in Streams | 0 | 0.34 | 2007 |
The Molecule Evoluator. An Interactive Evolutionary Algorithm for the Design of Drug-Like Molecules. | 16 | 1.00 | 2006 |
Mining a chemical database for fragment co-occurrence: discovery of "chemical clichés". | 6 | 0.60 | 2006 |
TreeSOM: cluster analysis in the self-organizing map | 7 | 0.58 | 2006 |
Data Mining Approaches to Criminal Career Analysis | 14 | 0.89 | 2006 |
Towards a Framework for Knowledge Discovery | 0 | 0.34 | 2006 |
Compositional Construction and Reasoning Techniques for Software | 0 | 0.34 | 2005 |
The Gaston Tool for Frequent Subgraph Mining | 75 | 2.03 | 2005 |
Towards evolutionary DNA computing | 1 | 0.48 | 2005 |
Advances in Mining Graphs, Trees and Sequences | 1 | 0.35 | 2005 |
Multi-class correlated pattern mining | 11 | 0.63 | 2005 |
Evolutionary Algorithms in Drug Design | 7 | 0.69 | 2005 |
Frequent Subtree Mining - An Overview | 140 | 4.49 | 2005 |
Reliable hierarchical clustering with the self-organizing map | 3 | 0.51 | 2005 |
Advances in Intelligent Data Analysis VI, 6th International Symposium on Intelligent Data Analysis, IDA 2005, Madrid, Spain, September 8-10, 2005, Proceedings | 43 | 4.33 | 2005 |
Using Data Mining To Improve Mutation In A Tool For Molecular Evolution | 0 | 0.34 | 2005 |
Frequent Graph Mining And Its Application To Molecular Databases | 19 | 0.97 | 2004 |
Ideal Refinement of Datalog Clauses Using Primary Keys | 1 | 0.37 | 2004 |
Detecting and Pruning Introns for Faster Decision Tree Evolution | 7 | 0.68 | 2004 |
A quickstart in frequent structure mining can make a difference | 236 | 7.85 | 2004 |
Genetic Programming for data classification: partitioning the search space | 54 | 2.46 | 2004 |
Combining and Comparing Cluster Methods in a Receptor Database | 2 | 0.40 | 2003 |
Efficient Frequent Query Discovery in FARMER | 30 | 1.39 | 2003 |
Why the Information Explosion Can Be Bad for Data Mining, and How Data Fusion Provides a Way Out | 3 | 0.43 | 2002 |
Modeling efficient conjunction detection with spiking neural networks | 0 | 0.34 | 2002 |
Natural data mining techniques | 1 | 0.38 | 2001 |
Infinite Intersection and Union Types for the Lazy Lambda Calculus | 0 | 0.34 | 2001 |
Nonmetric Multidimensional Scaling with Neural Networks | 1 | 0.47 | 2001 |
Coordination-Based Design of Distributed Systems | 0 | 0.34 | 2000 |