Sciweavers

627 search results - page 107 / 126
» Privacy-Preserving k-NN for Small and Large Data Sets
Sort
View
BMCBI
2007
160views more  BMCBI 2007»
14 years 11 months ago
Establishing a major cause of discrepancy in the calibration of Affymetrix GeneChips
Background: Affymetrix GeneChips are a popular platform for performing whole-genome experiments on the transcriptome. There are a range of different calibration steps, and users a...
Andrew P. Harrison, Caroline E. Johnston, Christin...
KDD
2012
ACM
200views Data Mining» more  KDD 2012»
13 years 1 months ago
Vertex neighborhoods, low conductance cuts, and good seeds for local community methods
The communities of a social network are sets of vertices with more connections inside the set than outside. We theoretically demonstrate that two commonly observed properties of s...
David F. Gleich, C. Seshadhri
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 11 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo
INFOCOM
2011
IEEE
14 years 3 months ago
Continuous multi-dimensional top-k query processing in sensor networks
—Top-k query has long been an important topic in many fields of computer science. Efficient implementation of the top-k queries is the key for information searching. With the n...
Hongbo Jiang, Jie Cheng, Dan Wang, Chonggang Wang,...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
15 years 11 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han