Sciweavers

32 search results - page 3 / 7
» Deterministic Algorithms for Rank Aggregation and Other Rank...
Sort
View
JMLR
2010
135views more  JMLR 2010»
13 years 17 days ago
An Exponential Model for Infinite Rankings
This paper presents a statistical model for expressing preferences through rankings, when the number of alternatives (items to rank) is large. A human ranker will then typically r...
Marina Meila, Le Bao
SSDBM
2000
IEEE
87views Database» more  SSDBM 2000»
13 years 10 months ago
A Tool for Nesting and Clustering Large Objects
In implementations of non-standard database systems, large objects are often embedded within an aggregate of different types, i.e. a tuple. For a given size and access probabilit...
Stefan Dieker, Ralf Hartmut Güting, Miguel Ro...
WWW
2005
ACM
14 years 6 months ago
Ranking a stream of news
According to a recent survey made by Nielsen NetRatings, searching on news articles is one of the most important activity online. Indeed, Google, Yahoo, MSN and many others have p...
Gianna M. Del Corso, Antonio Gulli, Francesco Roma...
ICDE
2007
IEEE
178views Database» more  ICDE 2007»
14 years 7 months ago
Top-k Spatial Preference Queries
A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, consider a real estate agency office that holds a database ...
Man Lung Yiu, Xiangyuan Dai, Nikos Mamoulis, Micha...
ICPR
2008
IEEE
14 years 6 days ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel