Sciweavers

2033 search results - page 133 / 407
» Ranking on Data Manifolds
Sort
View
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
16 years 1 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
BMCBI
2004
167views more  BMCBI 2004»
15 years 6 months ago
Feature selection for splice site prediction: A new method using EDA-based feature ranking
Background: The identification of relevant biological features in large and complex datasets is an important step towards gaining insight in the processes underlying the data. Oth...
Yvan Saeys, Sven Degroeve, Dirk Aeyels, Pierre Rou...
ICDE
2010
IEEE
180views Database» more  ICDE 2010»
15 years 6 months ago
On novelty in publish/subscribe delivery
— In publish/subscribe systems, users express their interests in specific items of information and get notified when relevant data items are produced. Such systems allow users ...
Dimitris Souravlias, Marina Drosou, Kostas Stefani...
EDBT
2006
ACM
129views Database» more  EDBT 2006»
16 years 6 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao
IJCNN
2007
IEEE
16 years 26 days ago
Branching Principal Components: Elastic Graphs, Topological Grammars and Metro Maps
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
Alexander N. Gorban, Neil R. Sumner, Andrei Yu. Zi...