7865 search results - page 1240 / 1573 » Peer-to-Peer Data Management |
194
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 ...
208
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
188
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
193
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We analyze a massive social network, gathered from the records of a large mobile phone operator, with more than a million users and tens of millions of calls. We examine the distr...
200
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
The kernel function plays a central role in kernel methods. In this paper, we consider the automated learning of the kernel matrix over a convex combination of pre-specified kerne...