1399 search results - page 69 / 280 » New Algorithms for k-Center and Extensions |
ICDM
2009
IEEE
13 years 6 months ago
2009
IEEE
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
PAMI
2011
13 years 4 months ago
2011
—A novel framework is proposed for the design of cost-sensitive boosting algorithms. The framework is based on the identification of two necessary conditions for optimal cost-sen...
ICDE
2011
IEEE
13 years 26 days ago
2011
IEEE
—Despite the proliferation of work on XML keyword query, it remains open to support keyword query over probabilistic XML data. Compared with traditional keyword search, it is far...
ICML
2007
IEEE
14 years 10 months ago
2007
IEEE
A cost-sensitive extension of boosting, denoted as asymmetric boosting, is presented. Unlike previous proposals, the new algorithm is derived from sound decision-theoretic princip...
IJCAI
2001
13 years 10 months ago
2001
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...