Sciweavers

767 search results - page 105 / 154
» On Clustering Using Random Walks
Sort
View
ITA
2006
163views Communications» more  ITA 2006»
13 years 7 months ago
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local i...
Paolo Boldi, Violetta Lonati, Massimo Santini, Seb...
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
13 years 6 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev
ICWSM
2009
13 years 5 months ago
Modeling Blog Dynamics
How do blogs produce posts? What local, underlying mechanisms lead to the bursty temporal behaviors observed in blog networks? Earlier work analyzed network patterns of blogs and ...
Michaela Goetz, Jure Leskovec, Mary McGlohon, Chri...
ADHOC
2006
116views more  ADHOC 2006»
13 years 7 months ago
Efficient clustering algorithms for self-organizing wireless sensor networks
Self-organization of wireless sensor networks, which involves network decomposition into connected clusters, is a challenging task because of the limited bandwidth and energy reso...
Rajesh Krishnan, David Starobinski
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala