301 search results - page 31 / 61 » The k-Median Problem for Directed Trees |
VLDB
1998
ACM
13 years 11 months ago
1998
ACM
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
CIDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Some data mining problems require predictive models to be not only accurate but also comprehensible. Comprehensibility enables human inspection and understanding of the model, m...
ICDT
2010
ACM
14 years 5 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...
ICML
1999
IEEE
14 years 8 months ago
1999
IEEE
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
TSMC
2008
13 years 7 months ago
2008
In genetic programming (GP), evolving tree nodes separately would reduce the huge solution space. However, tree nodes are highly interdependent with respect to their fitness. In th...