296 search results - page 48 / 60 » Privacy-preserving algorithms for distributed mining of freq... |
KDD
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
KAIS
2010
13 years 7 months ago
2010
In systems of interacting entities such as social networks, interactions that occur regularly typically correspond to significant, yet often infrequent and hard to detect, interact...
PODS
2006
ACM
14 years 9 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
DMKD
1997
ACM
14 years 1 months ago
1997
ACM
Clustering in data mining is a discovery process that groups a set of data such that the intracluster similarity is maximized and the intercluster similarity is minimized. These d...
KBSE
2009
IEEE
14 years 3 months ago
2009
IEEE
—To improve software quality, static or dynamic verification tools accept programming rules as input and detect their violations in software as defects. As these programming rul...