446 search results - page 79 / 90 » Randomization in Privacy-Preserving Data Mining |
132
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Researchers in the social and behavioral sciences routinely rely on quasi-experimental designs to discover knowledge from large databases. Quasi-experimental designs (QEDs) exploi...
156
Voted
KDD
2008
ACM
16 years 3 months ago
2008
ACM
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
142
click to vote
PAKDD
2009
ACM
15 years 11 months ago
2009
ACM
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-...
121
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: With current technology, vast amounts of data can be cheaply and efficiently produced in association studies, and to prevent data analysis to become the bottleneck of ...
142
Voted
PKDD
2007
Springer
15 years 8 months ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...