Sciweavers

199 search results - page 31 / 40
» A large time-aware web graph
Sort
View
SIGMOD
2008
ACM
215views Database» more  SIGMOD 2008»
14 years 7 months ago
CSV: visualizing and mining cohesive subgraphs
Extracting dense sub-components from graphs efficiently is an important objective in a wide range of application domains ranging from social network analysis to biological network...
Nan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, ...
WWW
2007
ACM
14 years 8 months ago
SPARQ2L: towards support for subgraph extraction queries in rdf databases
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
Kemafor Anyanwu, Angela Maduko, Amit P. Sheth
ESWS
2008
Springer
13 years 9 months ago
Querying Distributed RDF Data Sources with SPARQL
Integrated access to multiple distributed and autonomous RDF data sources is a key challenge for many semantic web applications. As a reaction to this challenge, SPARQL, the W3C Re...
Bastian Quilitz, Ulf Leser
AIRWEB
2007
Springer
14 years 1 months ago
Extracting Link Spam using Biased Random Walks from Spam Seed Sets
Link spam deliberately manipulates hyperlinks between web pages in order to unduly boost the search engine ranking of one or more target pages. Link based ranking algorithms such ...
Baoning Wu, Kumar Chellapilla
WWW
2003
ACM
14 years 8 months ago
Mining newsgroups using networks arising from social behavior
Recent advances in information retrieval over hyperlinked corpora have convincinglydemonstratedthat links carry less noisy information than text. We investigate the feasibility of...
Rakesh Agrawal, Sridhar Rajagopalan, Ramakrishnan ...