227 search results - page 22 / 46 » Rough Set Methods in Approximation of Hierarchical Concepts |
POPL
2006
ACM
14 years 8 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
NIPS
2008
13 years 9 months ago
2008
Hierarchical probabilistic modeling of discrete data has emerged as a powerful tool for text analysis. Posterior inference in such models is intractable, and practitioners rely on...
RSFDGRC
1999
Springer
13 years 12 months ago
1999
Springer
: In real-life data, in general, many attribute values are missing. Therefore, rule induction requires preprocessing, where missing attribute values are replaced by appropriate val...
EUROCAST
2005
Springer
14 years 1 months ago
2005
Springer
abstract NP-hard optimization problem, in a general sense. From the observation that, intuitively, there are many connections among categorical concepts and structural complexity n...
ACSC
2003
IEEE
14 years 1 months ago
2003
IEEE
We introduced a novel method employing a hierarchical domain ontology structure to extract features representing documents in our previous publication (Wang 2002). All raw words i...