Sciweavers

306 search results - page 54 / 62
» Probabilistic ranking for relational databases based on corr...
Sort
View
PVLDB
2010
139views more  PVLDB 2010»
13 years 3 months ago
Identifying the Most Influential Data Objects with Reverse Top-k Queries
Top-k queries are widely applied for retrieving a ranked set of the k most interesting objects based on the individual user preferences. As an example, in online marketplaces, cus...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
PODS
1999
ACM
151views Database» more  PODS 1999»
14 years 1 months ago
Exact and Approximate Aggregation in Constraint Query
We investigate the problem of how to extend constraint query languages with aggregate operators. We deal with standard relational aggregation, and also with aggregates speci c to ...
Michael Benedikt, Leonid Libkin
BMCBI
2010
110views more  BMCBI 2010»
13 years 9 months ago
Towards the systematic discovery of signal transduction networks using phosphorylation dynamics data
Background: Phosphorylation is a ubiquitous and fundamental regulatory mechanism that controls signal transduction in living cells. The number of identified phosphoproteins and th...
Haruna Imamura, Nozomu Yachie, Rintaro Saito, Yasu...
KDD
2001
ACM
150views Data Mining» more  KDD 2001»
14 years 9 months ago
Empirical bayes screening for multi-item associations
This paper considers the framework of the so-called "market basket problem", in which a database of transactions is mined for the occurrence of unusually frequent item s...
William DuMouchel, Daryl Pregibon
ICDE
2009
IEEE
133views Database» more  ICDE 2009»
14 years 3 months ago
STAR: Steiner-Tree Approximation in Relationship Graphs
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
Gjergji Kasneci, Maya Ramanath, Mauro Sozio, Fabia...