Sciweavers

126 search results - page 16 / 26
» Finding low-entropy sets and trees from binary data
Sort
View
CSDA
2008
126views more  CSDA 2008»
14 years 11 months ago
A new genetic algorithm in proteomics: Feature selection for SELDI-TOF data
Mass spectrometry from clinical specimens is used in order to identify biomarkers in a diagnosis. Thus, a reliable method for both feature selection and classification is required...
Christelle Reynès, Robert Sabatier, Nicolas...
RECOMB
2004
Springer
15 years 12 months ago
Mining protein family specific residue packing patterns from protein structure graphs
Finding recurring residue packing patterns, or spatial motifs, that characterize protein structural families is an important problem in bioinformatics. To this end, we apply a nov...
Jun Huan, Wei Wang 0010, Deepak Bandyopadhyay, Jac...
CIKM
2009
Springer
15 years 6 months ago
Feature selection for ranking using boosted trees
Modern search engines have to be fast to satisfy users, so there are hard back-end latency requirements. The set of features useful for search ranking functions, though, continues...
Feng Pan, Tim Converse, David Ahn, Franco Salvetti...
VLDB
1995
ACM
181views Database» more  VLDB 1995»
15 years 3 months ago
NeuroRule: A Connectionist Approach to Data Mining
Classification, which involves finding rules that partition a given da.ta set into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining cla...
Hongjun Lu, Rudy Setiono, Huan Liu
KDD
2001
ACM
124views Data Mining» more  KDD 2001»
16 years 1 days ago
Tri-plots: scalable tools for multidimensional data mining
We focus on the problem of finding patterns across two large, multidimensional datasets. For example, given feature vectors of healthy and of non-healthy patients, we want to answ...
Agma J. M. Traina, Caetano Traina Jr., Spiros Papa...