Sciweavers

448 search results - page 53 / 90
» Directly optimizing evaluation measures in learning to rank
Sort
View
AI
2004
Springer
14 years 9 months ago
A selective sampling approach to active feature selection
Feature selection, as a preprocessing step to machine learning, has been very effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and imp...
Huan Liu, Hiroshi Motoda, Lei Yu
KDD
2008
ACM
172views Data Mining» more  KDD 2008»
15 years 10 months ago
Structured metric learning for high dimensional problems
The success of popular algorithms such as k-means clustering or nearest neighbor searches depend on the assumption that the underlying distance functions reflect domain-specific n...
Jason V. Davis, Inderjit S. Dhillon
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
BMCBI
2005
178views more  BMCBI 2005»
14 years 9 months ago
A quantization method based on threshold optimization for microarray short time series
Background: Reconstructing regulatory networks from gene expression profiles is a challenging problem of functional genomics. In microarray studies the number of samples is often ...
Barbara Di Camillo, Fatima Sanchez-Cabo, Gianna To...
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King