Sciweavers

2018 search results - page 87 / 404
» Magnitude-preserving ranking algorithms
Sort
View
BMCBI
2010
138views more  BMCBI 2010»
15 years 6 months ago
UFFizi: a generic platform for ranking informative features
Background: Feature selection is an important pre-processing task in the analysis of complex data. Selecting an appropriate subset of features can improve classification or cluste...
Assaf Gottlieb, Roy Varshavsky, Michal Linial, Dav...
ICCV
2011
IEEE
14 years 6 months ago
Latent Low-Rank Representation for Subspace Segmentation and Feature Extraction
Low-Rank Representation (LRR) [16, 17] is an effective method for exploring the multiple subspace structures of data. Usually, the observed data matrix itself is chosen as the dic...
Guangcan Liu, Shuicheng Yan
MCS
2005
Springer
15 years 11 months ago
A Probability Model for Combining Ranks
Mixed Group Ranks is a parametric method for combining rank based classiers that is eective for many-class problems. Its parametric structure combines qualities of voting methods...
Ofer Melnik, Yehuda Vardi, Cun-Hui Zhang
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
16 years 6 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
ESANN
2008
15 years 7 months ago
Homogeneous bipartition based on multidimensional ranking
We present an algorithm which partitions a data set in two parts with equal size and experimentally nearly the same distribution measured through the likelihood of a Parzen kernel ...
Michaël Aupetit