Sciweavers

2018 search results - page 172 / 404
» Magnitude-preserving ranking algorithms
Sort
View
INLG
2010
Springer
15 years 4 months ago
A Discourse-Aware Graph-Based Content-Selection Framework
This paper presents an easy-to-adapt, discourse-aware framework that can be utilized as the content selection component of a generation system whose goal is to deliver descriptive...
Seniz Demir, Sandra Carberry, Kathleen F. McCoy
STOC
2012
ACM
201views Algorithms» more  STOC 2012»
13 years 8 months ago
From irreducible representations to locally decodable codes
Locally Decodable Code (LDC) is a code that encodes a message in a way that one can decode any particular symbol of the message by reading only a constant number of locations, eve...
Klim Efremenko
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
16 years 1 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
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 23 hour ago
Stability of Feature Selection Algorithms
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...
KAIS
2007
97views more  KAIS 2007»
15 years 6 months ago
Stability of feature selection algorithms: a study on high-dimensional spaces
With the proliferation of extremely high-dimensional data, feature selection algorithms have become indispensable components of the learning process. Strangely, despite extensive ...
Alexandros Kalousis, Julien Prados, Melanie Hilari...