25167 search results - page 4813 / 5034 » Parallel and Distributed Algorithms |
217
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
The input to an algorithm that learns a binary classifier normally consists of two sets of examples, where one set consists of positive examples of the concept to be learned, and ...
189
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 ...
219
Voted
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...
199
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...
172
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...