A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
Filters
A large time-aware web graph
2008
SIGIR Forum
Preserved Fulltext
We describe the techniques developed to gather and distribute in a highly compressed, yet accessible, form a series of twelve snapshot of the .uk web domain. ...
., PageRank), the growth of online communities, and in general time-dependent phenomena related to the link structure. ...
The twelve graphs are also available independently, and a separate note in this SIGIR Forum issue describes a method and Java implementation for distributing part of the page content, which, due to its ...
doi:10.1145/1480506.1480511
fatcat:gbvwqvvbbrfj7fenfmrp3qkvkm
On-the-fly Learning-based Search for QoS-aware Web Service Composition
2014
Applied Mathematics & Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
However, since the QoS-aware WSC problem corresponds to a global optimization problem, it is a hard problem to solve the problem for large scale instances. ...
Moreover, the on-the-fly searching technique partially constructs a search graph only when the part of the graph is required. ...
In addition, for large scale problem instances, the ratio of not-visited space can be large and the whole graph construction needs a significant amount of time. ...
doi:10.12785/amis/081l18
fatcat:7z37ciftebhxhlofq4tlaxseom
Concept-Aware Ranking: Teaching an Old Graph New Moves
2006
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Ranking algorithms for web graphs, such as PageRank and HITS, are typically utilized for graphs where a node represents a unique URL (Webpage) and an edge is an explicitly-defined link between two such ...
For example, anchor text in a Web graph is likely to provide information about the underlying concepts connecting URLs. ...
For a large web graph (and therefore, a much larger concept-page graph), the aforementioned problems with conceptual authorities tend to be mitigated. ...
doi:10.1109/icdmw.2006.49
dblp:conf/icdm/DeLongMS06
fatcat:g2gtwf6frbh2bl5q2ktbnxyite
A Time-aware Random Walk Model for Finding Important Documents in Web Archives
2015
Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval - SIGIR '15
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Preliminary experimental results on a large-scale, real-world web archival collection shows that our method significantly improves the state-of-the-art algorithms (i.e., PageRank) in ranking temporal web ...
Due to their first-hand, diverse and evolution-aware reflection of nearly all areas of life, web archives are emerging as gold-mines for content analytics of many sorts. ...
However, different from this ordinary behavior, we present a query-dependent, time-aware vector vtemp over the temporal graph as follows: Time-aware Teleportation Instead of limiting the jumping scope ...
doi:10.1145/2766462.2767832
dblp:conf/sigir/NguyenKNZ15
fatcat:wq2kvywnuvhydnwbpgkmcftfga
Towards building large scale multimedia systems and applications
2005
Proceedings of the first ACM international workshop on Multimedia service composition - MSC '05
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Hence, building complex large scale multimedia systems is always a difficult, costly, time-consuming and challenging problem. ...
In this introduction-paper, we summarize challenges that need to be addressed and present a snapshot of the current state of the art towards building large scale multimedia systems. ...
time and space-aware fashion. ...
doi:10.1145/1099423.1099426
fatcat:3wd7dsa62bhgxigfcwgvyvz7qe
MaiterStore: A Hot-Aware, High-Performance Key-Value Store for Graph Processing
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore, observing that hot-spot property and skewed powerlaw degree distribution are widely existed in real graphs, we propose a hot-aware caching (HAC) policy to effectively manage the hot vertices ...
We evaluate MaiterStore through extensive experiments on real large graphs and validate the high performance of our system as the graph storage. ...
-HAC, a hot-aware cache for caching the hottest part of immutable graphstructured data during the graph computation. ...
doi:10.1007/978-3-662-43984-5_9
fatcat:w4nkydlzzzfnhgbhrhkhqqcvby
A QoS-Aware Hyper-graph Based Method of Semantic Service Composition
[chapter]
2012
Lecture Notes in Business Information Processing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The evaluation results have shown that the method can effectively reduce the composition time and has good robustness, especially in the case of large number of web services and concepts. ...
In this paper we propose a new hyper-graph based method supporting semantic service composition, which model the service composition problem as a hyper-graph. ...
In this paper we proposed a QoS(Quality of Service)-aware hyper-graph based method for semantic Web Service Composition. We model the service composition problem as two hyper-graphs. ...
doi:10.1007/978-3-642-33068-1_9
fatcat:jakla5knc5cqtpqsjvclrj2cxu
A Service Selection Workflow for Composition Using Correlation and Route Optimization
2015
2015 7th International Conference on Computational Intelligence, Communication Systems and Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Web services have been widely accepted as a server-side technology and are the key component to cloud computing. How to effectively compose a service from a number of services is a still an issue. ...
In this paper we present a workflow that models service composition as a service graph where each node is an individual service. ...
Precision
Figure 8 . 8 Executing time
aware path finding Correlation-aware path finding with Prim's Optimization
TABLE I . ...
doi:10.1109/cicsyn.2015.43
dblp:conf/cicsyn/ChangL15
fatcat:4bxvvvvljjdcjh7hymnvtxj2oa
Multiwave COVID-19 Prediction via Social Awareness-Based Graph Neural Networks using Mobility and Web Search Data
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
Therefore, to predict the multiwave pandemic, we propose a Social Awareness-Based Graph Neural Network (SAB-GNN) that considers the decay of symptom-related web search frequency to capture the changes ...
in public awareness across multiple waves. ...
A large value of 𝜆 2 𝑖 implies that social awareness of COVID-19 for residents living in 𝑣 𝑖 declines rapidly and we therefore adopt this large value to recover the social awareness. ...
arXiv:2110.11584v1
fatcat:oy6ci24r3zbtxpy2afptxegeja
Answering provenance-aware regular path queries on RDF graphs using an automata-based algorithm
2014
Proceedings of the 23rd International Conference on World Wide Web - WWW '14 Companion
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper presents an automata-based algorithm for answering the provenance-aware regular path queries (RPQs) over RDF graphs on the Semantic Web. ...
We implement a parallel version of the automata-based algorithm using the Pregel framework Giraph to efficiently evaluate provenanceaware RPQs on large RDF graphs. ...
INTRODUCTION RDF is a graph-based data model for describing things and their relationships on the Semantic Web. ...
doi:10.1145/2567948.2577284
dblp:conf/www/WangLWWF14
fatcat:4pjeupd3hbddlhouprynijsknu
Time-Aware Authority Ranking
2005
Internet Mathematics
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Time-and thus the freshness of web content and link structure-emanates as a factor that should be taken into account in link analysis when computing the importance of a page. ...
Experimental results show that T-Rank Light and T-Rank can produce better rankings of web pages. © A K Peters, Ltd. 1542-7951/05 $0.50 per page 301 ...
Experiment on Web Data We conducted a third series of experiments on web data and investigated in a user study how the time-aware rankings are accepted by the users. ...
doi:10.1080/15427951.2005.10129110
fatcat:qcse6actnreodpbemfhizitvfu
Time-Aware PolarisX: Auto-Growing Knowledge Graph
2021
Computers Materials & Continua
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To solve this problem, this paper proposes Time-Aware PolarisX, an automatically extended knowledge graph including time information. ...
Time-Aware PolarisX constructed a BERT model with a relation extractor and an ensemble NER model including a time tag with an entity extractor to extract knowledge consisting of subject, relation, and ...
using a time-aware knowledge graph as training data. ...
doi:10.32604/cmc.2021.015636
fatcat:udjjk23s6zbltds6hrpoq3x54m
Folksonomy Graphs Based Context-Aware Recommender System Using Spectral Clustering
2020
International Journal of Machine Learning and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This article presents a folksonomy graphs based context-aware recommender system of resources. ...
The advent of collaborative information systems has scaled up the growth of the web into a huge repository of all kind of resources. ...
INTRODUCTION A large number of available web resources is tremendously growing on the web. ...
doi:10.18178/ijmlc.2020.10.1.899
fatcat:pdzjn2dipbdmjigby7zlivf5yq
Efficient anytime algorithm for large-scale QoS-aware web service composition
2013
International Journal of Web and Grid Services
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The QoS-aware web service composition (WSC) problem aims at the fully automatic construction of a composite web service with the optimal accumulated QoS value. ...
It is, however, intractable to solve the QoS-aware WSC problem for large scale instances since the problem corresponds to a global optimisation problem. ...
Our technique uses a large sized beam width first and decreases its size gradually as going down to a search graph. ...
doi:10.1504/ijwgs.2013.052845
fatcat:qh4k57fzk5d2zokq22ycey3plu
"Context-aware access control and presentation for linked data" by Luca Costabello with Prateek Jain as coordinator
2015
ACM SIGWEB Newsletter
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
An early version of a context-aware access control system for Linked Data has been published at the Linked Data on the Web Workshop (LDOW), co-located with WWW 2012 [Costabello 2012b ]. ...
Publications The PRISSMA vocabulary and the PRISSMA presentation engine have been introduced in a doctoral consortium paper at the International Semantic Web Conference (ISWC) in 2011 [Costabello 2011 ...
Context-Aware Authorization for Graph Stores
Introduction Denying or allowing access to a set of resources or services is a common problem in a large number of computing fields. ...
doi:10.1145/2749279.2749282
fatcat:rtsg57v7fbcb7egtdfnyfvb6wu
« Previous
Showing results 1 — 15 out of 93,444 results