13414 search results - page 2448 / 2683 » The distributed boosting algorithm |
188
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
205
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The effectiveness of knowledge transfer using classification algorithms depends on the difference between the distribution that generates the training examples and the one from wh...
186
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
A hypergraph is a generalization of the traditional graph in which the edges are arbitrary non-empty subsets of the vertex set. It has been applied successfully to capture highord...
170
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Effective diagnosis of Alzheimer's disease (AD) is of primary importance in biomedical research. Recent studies have demonstrated that neuroimaging parameters are sensitive a...
193
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In recent years, the proliferation of VOIP data has created a number of applications in which it is desirable to perform quick online classification and recognition of massive voi...