Sciweavers

488 search results - page 3 / 98
» Hubs, authorities, and communities
Sort
View
WEBI
2004
Springer
13 years 10 months ago
Finding Related Pages Using the Link Structure of the WWW
Most of the current algorithms for finding related pages are exclusively based on text corpora of the WWW or incorporate only authority or hub values of pages. In this paper, we ...
Paul-Alexandru Chirita, Daniel Olmedilla, Wolfgang...
ICPR
2008
IEEE
13 years 11 months ago
Detecting hubs and quasi cliques in scale-free networks
Scale-free networks are believed to closely model most real-world networks. An interesting property of such networks is the existence of so-called hub and community structures. In...
Sriganesh Srihari, Hoong Kee Ng, Kang Ning, Hon Wa...
KDD
2007
ACM
220views Data Mining» more  KDD 2007»
14 years 5 months ago
SCAN: a structural clustering algorithm for networks
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...
Xiaowei Xu, Nurcan Yuruk, Zhidan Feng, Thomas A. J...
SEMWEB
2009
Springer
13 years 11 months ago
TripleRank: Ranking Semantic Web Data by Tensor Decomposition
Abstract. The Semantic Web fosters novel applications targeting a more efficient and satisfying exploitation of the data available on the web, e.g. faceted browsing of linked open...
Thomas Franz, Antje Schultz, Sergej Sizov, Steffen...
ICALP
2003
Springer
13 years 10 months ago
Similarity Matrices for Pairs of Graphs
Abstract. We introduce a concept of similarity between vertices of directed graphs. Let GA and GB be two directed graphs with respectively nA and nB vertices. We define a nA × nB...
Vincent D. Blondel, Paul Van Dooren