Sciweavers

2018 search results - page 359 / 404
» Magnitude-preserving ranking algorithms
Sort
View
VLDB
2005
ACM
177views Database» more  VLDB 2005»
14 years 4 months ago
Discovering Large Dense Subgraphs in Massive Graphs
We present a new algorithm for finding large, dense subgraphs in massive graphs. Our algorithm is based on a recursive application of fingerprinting via shingles, and is extreme...
David Gibson, Ravi Kumar, Andrew Tomkins
CIKM
2008
Springer
14 years 25 days ago
A sparse gaussian processes classification framework for fast tag suggestions
Tagged data is rapidly becoming more available on the World Wide Web. Web sites which populate tagging services offer a good way for Internet users to share their knowledge. An in...
Yang Song, Lu Zhang 0007, C. Lee Giles
CIKM
2008
Springer
14 years 25 days ago
Efficient sampling of information in social networks
As online social networking emerges, there has been increased interest to utilize the underlying social structure as well as the available social information to improve search. In...
Gautam Das, Nick Koudas, Manos Papagelis, Sushruth...
SIGIR
2010
ACM
13 years 11 months ago
Optimal meta search results clustering
By analogy with merging documents rankings, the outputs from multiple search results clustering algorithms can be combined into a single output. In this paper we study the feasibi...
Claudio Carpineto, Giovanni Romano
BMCBI
2010
97views more  BMCBI 2010»
13 years 11 months ago
Biomarker discovery in heterogeneous tissue samples -taking the in-silico deconfounding approach
Background: For heterogeneous tissues, such as blood, measurements of gene expression are confounded by relative proportions of cell types involved. Conclusions have to rely on es...
Dirk Repsilber, Sabine Kern, Anna Telaar, Gerhard ...