Sciweavers

105 search results - page 8 / 21
» V-Trees - A Storage Method for Long Vector Data
Sort
View
EVOW
2006
Springer
13 years 11 months ago
Robust SVM-Based Biomarker Selection with Noisy Mass Spectrometric Proteomic Data
Abstract. Computational analysis of mass spectrometric (MS) proteomic data from sera is of potential relevance for diagnosis, prognosis, choice of therapy, and study of disease act...
Elena Marchiori, Connie R. Jimenez, Mikkel West-Ni...
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
13 years 11 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
FAST
2008
13 years 9 months ago
Avoiding the Disk Bottleneck in the Data Domain Deduplication File System
Disk-based deduplication storage has emerged as the new-generation storage system for enterprise data protection to replace tape libraries. Deduplication removes redundant data se...
Benjamin Zhu, Kai Li, R. Hugo Patterson
CIDM
2007
IEEE
13 years 11 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang