Sciweavers

301 search results - page 17 / 61
» Probabilistic rough set approximations
Sort
View
RSFDGRC
2005
Springer
111views Data Mining» more  RSFDGRC 2005»
14 years 1 months ago
Feature Selection with Adjustable Criteria
Abstract. We present a study on a rough set based approach for feature selection. Instead of using significance or support, Parameterized Average Support Heuristic (PASH) consider...
Jingtao Yao, Ming Zhang
JAIR
2010
131views more  JAIR 2010»
13 years 6 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
FOCS
1995
IEEE
13 years 11 months ago
Free Bits, PCPs and Non-Approximability - Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
Mihir Bellare, Oded Goldreich, Madhu Sudan
IOR
2008
119views more  IOR 2008»
13 years 7 months ago
Integrating Approximation and Interactive Decision Making in Multicriteria Optimization
We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. W...
Kathrin Klamroth, Kaisa Miettinen
TVCG
2012
181views Hardware» more  TVCG 2012»
11 years 10 months ago
Interactive Image Segmentation Based on Level Sets of Probabilities
—In this paper, we present a robust and accurate algorithm for interactive image segmentation. The level set method is clearly advantageous for image objects with a complex topol...
Yugang Liu, Yizhou Yu