1413 search results - page 173 / 283 » Mining Multiple Large Databases |
101
click to vote
KDD
2001
ACM
16 years 2 months ago
2001
ACM
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
133
click to vote
KDD
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
101
click to vote
KDD
2010
ACM
15 years 5 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...
117
click to vote
KDD
2009
ACM
16 years 2 months ago
2009
ACM
Motivated by structural properties of the Web graph that support efficient data structures for in memory adjacency queries, we study the extent to which a large network can be com...
KDD
2006
ACM
16 years 2 months ago
2006
ACM
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...