Sciweavers

2826 search results - page 427 / 566
» Maximal Vector Computation in Large Data Sets
Sort
View
KDD
2004
ACM
134views Data Mining» more  KDD 2004»
16 years 7 months ago
Exploiting a support-based upper bound of Pearson's correlation coefficient for efficiently identifying strongly correlated pair
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
Hui Xiong, Shashi Shekhar, Pang-Ning Tan, Vipin Ku...
SAC
2006
ACM
16 years 14 days ago
The impact of sample reduction on PCA-based feature extraction for supervised learning
“The curse of dimensionality” is pertinent to many learning algorithms, and it denotes the drastic raise of computational complexity and classification error in high dimension...
Mykola Pechenizkiy, Seppo Puuronen, Alexey Tsymbal
RECOMB
2006
Springer
16 years 6 months ago
Identifiability Issues in Phylogeny-Based Detection of Horizontal Gene Transfer
Prokaryotic organisms share genetic material across species boundaries by means of a process known as horizontal gene transfer (HGT). Detecting this process bears great significanc...
Cuong Than, Derek A. Ruths, Hideki Innan, Luay Nak...
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
15 years 8 months ago
Increasing the Output Length of Zero-Error Dispersers
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
Ariel Gabizon, Ronen Shaltiel
BMCBI
2010
105views more  BMCBI 2010»
15 years 6 months ago
A knowledge-guided strategy for improving the accuracy of scoring functions in binding affinity prediction
Background: Current scoring functions are not very successful in protein-ligand binding affinity prediction albeit their popularity in structure-based drug designs. Here, we propo...
Tiejun Cheng, Zhihai Liu, Renxiao Wang