126 search results - page 12 / 26 » kdd 2007 |
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
We propose frameworks and algorithms for identifying communities in social networks that change over time. Communities are intuitively characterized as "unusually densely kni...
76
Voted
KDD
2007
ACM
15 years 10 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
109
click to vote
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
The world-wide web has become the most important information source for most of us. Unfortunately, there is no guarantee for the correctness of information on the web. Moreover, d...