Sciweavers

1684 search results - page 132 / 337
» The lexicographic decision function
Sort
View
IDA
2005
Springer
16 years 14 days ago
Learning from Ambiguously Labeled Examples
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...
Eyke Hüllermeier, Jürgen Beringer
190
Voted
ASPDAC
2004
ACM
118views Hardware» more  ASPDAC 2004»
16 years 11 days ago
Minimization of memory size for heterogeneous MDDs
Abstract— In this paper, we propose exact and heuristic algorithms for minimizing the memory size for heterogeneous Multivalued Decision Diagrams (MDDs). In a heterogeneous MDD, ...
Shinobu Nagayama, Tsutomu Sasao
160
Voted
EVOW
2004
Springer
16 years 10 days ago
Disjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sumof-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for larg...
Nicole Drechsler, Mario Hilgemeier, Görschwin...
ILP
2004
Springer
16 years 9 days ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
181
Voted
ICDT
2003
ACM
127views Database» more  ICDT 2003»
16 years 4 days ago
On Reasoning about Structural Equality in XML: A Description Logic Approach
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
David Toman, Grant E. Weddell