Sciweavers

111 search results - page 5 / 23
» Analysis of Branch Prediction Via Data Compression
Sort
View
KDD
2004
ACM
166views Data Mining» more  KDD 2004»
14 years 7 months ago
Predicting prostate cancer recurrence via maximizing the concordance index
In order to effectively use machine learning algorithms, e.g., neural networks, for the analysis of survival data, the correct treatment of censored data is crucial. The concordan...
Lian Yan, David Verbel, Olivier Saidi
NIPS
2008
13 years 9 months ago
Theory of matching pursuit
We analyse matching pursuit for kernel principal components analysis (KPCA) by proving that the sparse subspace it produces is a sample compression scheme. We show that this bound...
Zakria Hussain, John Shawe-Taylor
SIGKDD
2010
151views more  SIGKDD 2010»
13 years 2 months ago
Limitations of matrix completion via trace norm minimization
In recent years, compressive sensing attracts intensive attentions in the field of statistics, automatic control, data mining and machine learning. It assumes the sparsity of the ...
Xiaoxiao Shi, Philip S. Yu
CSB
2005
IEEE
202views Bioinformatics» more  CSB 2005»
14 years 1 months ago
Head and Neck Cancer Metastasis Prediction via Artificial Neural Networks
Cancers in head and neck tends to spread to nearby lymph nodes. Lymph nodes trap the spreading tumor cells but then the tumor starts to grow in these nodes and then spread further...
Eveleen Darby, Tezeswari Nettimi, Shilpa Kodali, L...
CAINE
2007
13 years 9 months ago
Parameter Estimation via Analysis of Fuzzy Clusters (PEAF): An Algorithm to Estimate Parameters of Agent-Based Models
Biologically focused, agent-based models need many parameters in order to simulate system dynamics. It is often essential to explore the consequences of many parameter vectors bef...
Shahab Sheikh-Bahaei, C. Anthony Hunt