Sciweavers

2004 search results - page 258 / 401
» Sampling from large graphs
Sort
View
OTM
2009
Springer
15 years 9 months ago
LinksB2N: Automatic Data Integration for the Semantic Web
Abstract. The ongoing trend towards open data embraced by the Semantic Web has started to produce a large number of data sources. These data sources are published using RDF vocabul...
Manuel Salvadores, Gianluca Correndo, Bene Rodrigu...
PKDD
2009
Springer
124views Data Mining» more  PKDD 2009»
15 years 9 months ago
Capacity Control for Partially Ordered Feature Sets
Abstract. Partially ordered feature sets appear naturally in many classification settings with structured input instances, for example, when the data instances are graphs and a fe...
Ulrich Rückert
PDP
2006
IEEE
15 years 8 months ago
Parallel Adaptive Technique for Computing PageRank
Re-ranking the search results using PageRank is a well-known technique used in modern search engines. Running an iterative algorithm like PageRank on a large web graph consumes bo...
Arnon Rungsawang, Bundit Manaskasemsak
114
Voted
ICPADS
2005
IEEE
15 years 8 months ago
An Efficient Partition-Based Parallel PageRank Algorithm
PageRank becomes the most well-known re-ranking technique of the search results. By its iterative computational nature, the computation takes much computing time and resource. Res...
Bundit Manaskasemsak, Arnon Rungsawang
136
Voted
SSDBM
2005
IEEE
131views Database» more  SSDBM 2005»
15 years 8 months ago
Searching for Related Objects in Relational Databases
To discover knowledge or retrieve information from a relational database, a user often needs to find objects related to certain source objects. There are two main challenges in b...
Xiaoxin Yin, Jiawei Han, Jiong Yang