Sciweavers

2004 search results - page 210 / 401
» Sampling from large graphs
Sort
View
155
Voted
BMCBI
2004
124views more  BMCBI 2004»
15 years 3 months ago
Tests for finding complex patterns of differential expression in cancers: towards individualized medicine
Background: Microarray studies in cancer compare expression levels between two or more sample groups on thousands of genes. Data analysis follows a population-level approach (e.g....
James Lyons-Weiler, Satish Patel, Michael J. Becic...
CORR
2010
Springer
82views Education» more  CORR 2010»
15 years 3 months ago
Expansion and Search in Networks
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
Arun S. Maiya, Tanya Y. Berger-Wolf
224
Voted
INFOCOM
2011
IEEE
14 years 7 months ago
A distributed and privacy preserving algorithm for identifying information hubs in social networks
—This paper addresses the problem of identifying the top-k information hubs in a social network. Identifying topk information hubs is crucial for many applications such as advert...
Muhammad Usman Ilyas, Muhammad Zubair Shafiq, Alex...
138
Voted
CORR
2008
Springer
116views Education» more  CORR 2008»
15 years 3 months ago
Learning to rank with combinatorial Hodge theory
Abstract. We propose a number of techniques for learning a global ranking from data that may be incomplete and imbalanced -- characteristics that are almost universal to modern dat...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye
MP
2011
14 years 10 months ago
Statistical ranking and combinatorial Hodge theory
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced — characteristics that are almost universal to modern datasets co...
Xiaoye Jiang, Lek-Heng Lim, Yuan Yao, Yinyu Ye