627 search results - page 58 / 126 » Privacy-Preserving k-NN for Small and Large Data Sets |
AUSAI
2003
Springer
15 years 4 months ago
2003
Springer
Efficient mining of frequent patterns from large databases has been an active area of research since it is the most expensive step in association rules mining. In this paper, we pr...
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Currently, a large amount of data can be best represented as graphs, e.g., social networks, protein interaction networks, etc. The analysis of these networks is an urgent research ...
ICPR
2006
IEEE
16 years 14 days ago
2006
IEEE
Finding a small set of representative instances for large datasets can bring various benefits to data mining practitioners so they can (1) build a learner superior to the one cons...
BMCBI
2010
14 years 11 months ago
2010
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
IOPADS
1996
15 years 20 days ago
1996
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...