Sciweavers

2033 search results - page 74 / 407
» Ranking on Data Manifolds
Sort
View
SIGMOD
2005
ACM
164views Database» more  SIGMOD 2005»
14 years 9 months ago
RankSQL: Query Algebra and Optimization for Relational Top-k Queries
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
Chengkai Li, Kevin Chen-Chuan Chang, Ihab F. Ilyas...
CSDA
2010
132views more  CSDA 2010»
13 years 9 months ago
Approximate low-rank factorization with structured factors
An approximate rank revealing factorization problem with structure constraints on the normalized factors is considered. Examples of structure, motivated by an application in micro...
Ivan Markovsky, Mahesan Niranjan
DAWAK
2004
Springer
14 years 3 months ago
Inductive Databases as Ranking
Abstract. Most of the research in data mining has been focused on developing novel algorithms for specific data mining tasks. However, finding the theoretical foundations of data...
Taneli Mielikäinen
BMCBI
2007
179views more  BMCBI 2007»
13 years 9 months ago
Gene selection with multiple ordering criteria
Background: A microarray study may select different differentially expressed gene sets because of different selection criteria. For example, the fold-change and p-value are two co...
James J. Chen, Chen-An Tsai, ShengLi Tzeng, Chun-H...
ICDT
2007
ACM
126views Database» more  ICDT 2007»
14 years 3 months ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv