95 search results - page 8 / 19 » kdd 2010 |
KDD
2010
ACM
15 years 3 months ago
2010
ACM
In the traditional link prediction problem, a snapshot of a social network is used as a starting point to predict, by means of graph-theoretic measures, the links that are likely ...
113
Voted
KDD
2010
ACM
14 years 9 months ago
2010
ACM
One essential issue of document clustering is to estimate the appropriate number of clusters for a document collection to which documents should be partitioned. In this paper, we ...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Many social networks can be characterized by a sequence of dyadic interactions between individuals. Techniques for analyzing such events are of increasing interest. In this paper,...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
Many real-world data mining tasks require the achievement of two distinct goals when applied to unseen data: first, to induce an accurate preference ranking, and second to give g...