Sciweavers

730 search results - page 12 / 146
» Combinatorics of Monotone Computations
Sort
View
ICDM
2010
IEEE
132views Data Mining» more  ICDM 2010»
13 years 5 months ago
Monotone Relabeling in Ordinal Classification
In many applications of data mining we know beforehand that the response variable should be increasing (or decreasing) in the attributes. Such relations between response and attrib...
Ad Feelders
ICML
2009
IEEE
14 years 2 months ago
Rule learning with monotonicity constraints
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
Wojciech Kotlowski, Roman Slowinski
DIS
2004
Springer
14 years 27 days ago
Extracting Minimal and Closed Monotone DNF Formulas
Abstract. In this paper, first we introduce minimal and closed monotone DNF formulas as extensions of maximal and closed itemsets. Next, by incorporating the algorithm dnf cover d...
Yoshikazu Shima, Shinji Mitsuishi, Kouichi Hirata,...
ECCC
2002
103views more  ECCC 2002»
13 years 7 months ago
Monotone complexity and the rank of matrices
We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated...
Pavel Pudlák
CCO
2001
Springer
256views Combinatorics» more  CCO 2001»
14 years 1 hour ago
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
Alexander Martin