Sciweavers

1180 search results - page 131 / 236
» An Instance Selection Approach to Multiple Instance Learning
Sort
View
AI
2008
Springer
14 years 10 months ago
Label ranking by learning pairwise preferences
Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
FROCOS
2011
Springer
13 years 9 months ago
Stochastic Local Search for SMT: Combining Theory Solvers with WalkSAT
A dominant approach to Satisfiability Modulo Theories (SMT) relies on the integration of a Conflict-Driven-Clause-Learning (CDCL) SAT solver and of a decision procedure able to h...
Alberto Griggio, Quoc-Sang Phan, Roberto Sebastian...
DATE
2008
IEEE
122views Hardware» more  DATE 2008»
15 years 4 months ago
Simulation-Directed Invariant Mining for Software Verification
With the advance of SAT solvers, transforming a software program to a propositional formula has generated much interest for bounded model checking of software in recent years. How...
Xueqi Cheng, Michael S. Hsiao
KAIS
2010
144views more  KAIS 2010»
14 years 8 months ago
Boosting support vector machines for imbalanced data sets
Real world data mining applications must address the issue of learning from imbalanced data sets. The problem occurs when the number of instances in one class greatly outnumbers t...
Benjamin X. Wang, Nathalie Japkowicz
IS
2011
14 years 4 months ago
Time prediction based on process mining
Abstract. Process mining allows for the automated discovery of process models from event logs. These models provide insights and enable various types of model-based analysis. This ...
Wil M. P. van der Aalst, M. H. Schonenberg, Minseo...