Sciweavers

1225 search results - page 9 / 245
» Maximal Consistent Subsets
Sort
View
SAC
2006
ACM
14 years 1 months ago
Exploiting partial decision trees for feature subset selection in e-mail categorization
In this paper we propose PARTfs which adopts a supervised machine learning algorithm, namely partial decision trees, as a method for feature subset selection. In particular, it is...
Helmut Berger, Dieter Merkl, Michael Dittenbach
ECSQARU
2005
Springer
14 years 1 months ago
Multiple Semi-revision in Possibilistic Logic
Semi-revision is a model of belief change that differs from revision in that a new formula is not always accepted. Later, Fuhrmann defined multiple semi-revision by replacing a n...
Guilin Qi, Weiru Liu, David A. Bell
CP
2009
Springer
14 years 8 months ago
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
Meinolf Sellmann
JSYML
2008
45views more  JSYML 2008»
13 years 7 months ago
Internal consistency and global co-stationarity of the ground model
Global co-stationarity of the ground model from an 2-c.c. forcing which adds a new subset of 1 is internally consistent relative to an 1-Erdos hyperstrong cardinal and a sufficient...
Natasha Dobrinen, Sy-David Friedman
FOCS
2009
IEEE
14 years 2 months ago
Dynamic and Non-uniform Pricing Strategies for Revenue Maximization
We consider the Item Pricing problem for revenue maximization in the limited supply setting, where a single seller with n items caters to m buyers with unknown subadditive valuati...
Tanmoy Chakraborty, Zhiyi Huang, Sanjeev Khanna