2705 search results - page 232 / 541 » Privacy in Data Mining Using Formal Methods |
148
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
118
Voted
CIKM
2009
Springer
15 years 9 months ago
2009
Springer
We consider the problem of releasing a limited public view of a sensitive graph which reveals at least k edges per node. We are motivated by Facebook’s public search listings, w...
118
Voted
ICDM
2007
IEEE
15 years 9 months ago
2007
IEEE
It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using sta...
131
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Assume a network (V, E) where a subset of the nodes in V are active. We consider the problem of selecting a set of k active nodes that best explain the observed activation state, ...
98
Voted
AUSAI
2007
Springer
15 years 8 months ago
2007
Springer
Dimensional reduction may be effective in order to compress data without loss of essential information. Also, it may be useful in order to smooth data and reduce random noise. The...