Sciweavers

1016 search results - page 17 / 204
» Generalized distances between rankings
Sort
View
KDD
2012
ACM
212views Data Mining» more  KDD 2012»
12 years 12 days ago
Fast bregman divergence NMF using taylor expansion and coordinate descent
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...
Liangda Li, Guy Lebanon, Haesun Park
ECIR
2009
Springer
14 years 7 months ago
Mean-Variance Analysis: A New Document Ranking Theory in Information Retrieval
Abstract. This paper concerns document ranking in information retrieval. In information retrieval systems, the widely accepted probability ranking principle (PRP) suggests that, fo...
Jun Wang
ICDM
2009
IEEE
105views Data Mining» more  ICDM 2009»
14 years 4 months ago
Multi-document Summarization by Information Distance
—We are now living in a world where information is growing and updating quickly. Knowledge can be acquired more efficiently with the help of automatic document summarization and...
Chong Long, Minlie Huang, Xiaoyan Zhu, Ming Li
BMCBI
2010
95views more  BMCBI 2010»
13 years 10 months ago
Protein structure modelling and evaluation based on a 4-distance description of side-chain interactions
Background: Accurate evaluation and modelling of residue-residue interactions within and between proteins is a key aspect of computational structure prediction including homology ...
Vladimir Potapov, Mati Cohen, Yuval Inbar, Gideon ...
SDM
2007
SIAM
182views Data Mining» more  SDM 2007»
13 years 11 months ago
Distance Preserving Dimension Reduction for Manifold Learning
Manifold learning is an effective methodology for extracting nonlinear structures from high-dimensional data with many applications in image analysis, computer vision, text data a...
Hyunsoo Kim, Haesun Park, Hongyuan Zha