2370 search results - page 254 / 474 » The Characterization of Data-Accumulating Algorithms |
119
click to vote
KDD
2007
ACM
16 years 4 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...
121
Voted
KDD
2006
ACM
16 years 4 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
115
click to vote
KDD
2006
ACM
16 years 4 months ago
2006
ACM
In this paper, we consider the problem of identifying and segmenting topically cohesive regions in the URL tree of a large website. Each page of the website is assumed to have a t...
135
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
160
Voted
STOC
2007
ACM
16 years 4 months ago
2007
ACM
One of the main reasons of the recent success of peer to peer (P2P) file sharing systems such as BitTorrent is its built-in tit-for-tat mechanism. In this paper, we model the band...